./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94402a909576ff0f6dec6fb8b106268679f88adb1b4c5fc615242f98a35b2243 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:37:09,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:37:09,766 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:37:09,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:37:09,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:37:09,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:37:09,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:37:09,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:37:09,797 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:37:09,797 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:37:09,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:37:09,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:37:09,798 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:37:09,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:37:09,799 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:37:09,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:37:09,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:37:09,803 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:37:09,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:37:09,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:37:09,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:37:09,804 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:37:09,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:37:09,805 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:37:09,805 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:37:09,805 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:37:09,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:37:09,806 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:37:09,806 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:37:09,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:37:09,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:37:09,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:37:09,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:37:09,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:37:09,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:37:09,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:37:09,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:37:09,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:37:09,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:37:09,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:37:09,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:37:09,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:37:09,810 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 94402a909576ff0f6dec6fb8b106268679f88adb1b4c5fc615242f98a35b2243 [2024-11-09 01:37:10,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:37:10,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:37:10,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:37:10,044 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:37:10,045 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:37:10,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i [2024-11-09 01:37:11,372 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:37:11,541 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:37:11,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i [2024-11-09 01:37:11,549 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88fb1f086/54511bf4f8b048adaf59d3f7008b2cc6/FLAGf7a2873e6 [2024-11-09 01:37:11,562 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88fb1f086/54511bf4f8b048adaf59d3f7008b2cc6 [2024-11-09 01:37:11,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:37:11,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:37:11,568 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:37:11,568 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:37:11,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:37:11,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:37:11" (1/1) ... [2024-11-09 01:37:11,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d3a8c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:11, skipping insertion in model container [2024-11-09 01:37:11,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:37:11" (1/1) ... [2024-11-09 01:37:11,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:37:11,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i[916,929] [2024-11-09 01:37:11,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:37:11,838 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:37:11,849 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i[916,929] [2024-11-09 01:37:11,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:37:11,914 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:37:11,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:11 WrapperNode [2024-11-09 01:37:11,915 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:37:11,916 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:37:11,916 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:37:11,916 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:37:11,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:11" (1/1) ... [2024-11-09 01:37:11,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:11" (1/1) ... [2024-11-09 01:37:11,996 INFO L138 Inliner]: procedures = 29, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 518 [2024-11-09 01:37:11,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:37:11,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:37:11,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:37:11,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:37:12,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:11" (1/1) ... [2024-11-09 01:37:12,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:11" (1/1) ... [2024-11-09 01:37:12,031 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:11" (1/1) ... [2024-11-09 01:37:12,046 INFO L175 MemorySlicer]: Split 134 memory accesses to 5 slices as follows [2, 64, 9, 16, 43]. 48 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 8, 1, 1, 5]. The 18 writes are split as follows [0, 8, 1, 1, 8]. [2024-11-09 01:37:12,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:11" (1/1) ... [2024-11-09 01:37:12,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:11" (1/1) ... [2024-11-09 01:37:12,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:11" (1/1) ... [2024-11-09 01:37:12,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:11" (1/1) ... [2024-11-09 01:37:12,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:11" (1/1) ... [2024-11-09 01:37:12,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:11" (1/1) ... [2024-11-09 01:37:12,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:37:12,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:37:12,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:37:12,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:37:12,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:11" (1/1) ... [2024-11-09 01:37:12,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:37:12,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:37:12,109 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:37:12,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:37:12,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:37:12,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:37:12,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:37:12,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:37:12,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:37:12,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:37:12,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:37:12,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:37:12,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:37:12,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:37:12,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:37:12,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:37:12,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:37:12,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:37:12,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:37:12,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:37:12,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:37:12,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:37:12,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:37:12,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:37:12,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:37:12,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:37:12,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:37:12,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:37:12,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:37:12,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:37:12,163 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:37:12,163 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:37:12,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:37:12,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:37:12,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:37:12,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:37:12,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:37:12,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:37:12,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:37:12,316 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:37:12,319 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:37:12,685 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2024-11-09 01:37:12,685 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:37:12,706 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:37:12,706 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:37:12,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:37:12 BoogieIcfgContainer [2024-11-09 01:37:12,707 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:37:12,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:37:12,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:37:12,714 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:37:12,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:37:11" (1/3) ... [2024-11-09 01:37:12,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5ae6e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:37:12, skipping insertion in model container [2024-11-09 01:37:12,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:11" (2/3) ... [2024-11-09 01:37:12,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5ae6e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:37:12, skipping insertion in model container [2024-11-09 01:37:12,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:37:12" (3/3) ... [2024-11-09 01:37:12,717 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-98.i [2024-11-09 01:37:12,730 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:37:12,730 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:37:12,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:37:12,795 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@49debe56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:37:12,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:37:12,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:37:12,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 01:37:12,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:37:12,817 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:37:12,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:37:12,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:37:12,821 INFO L85 PathProgramCache]: Analyzing trace with hash -251494613, now seen corresponding path program 1 times [2024-11-09 01:37:12,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:37:12,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243507682] [2024-11-09 01:37:12,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:37:12,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:37:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:13,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:37:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:13,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:37:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:13,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:37:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:13,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:37:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:13,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:37:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:13,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:37:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:13,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:37:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:13,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:37:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:13,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:37:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:13,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:37:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:13,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:37:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:13,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:37:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:13,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:37:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:13,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:37:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:13,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:37:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:13,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:37:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:13,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:37:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 01:37:13,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:37:13,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243507682] [2024-11-09 01:37:13,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243507682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:37:13,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:37:13,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:37:13,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799353978] [2024-11-09 01:37:13,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:37:13,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:37:13,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:37:13,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:37:13,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:37:13,211 INFO L87 Difference]: Start difference. First operand has 123 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 01:37:13,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:37:13,259 INFO L93 Difference]: Finished difference Result 239 states and 373 transitions. [2024-11-09 01:37:13,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:37:13,262 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-11-09 01:37:13,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:37:13,296 INFO L225 Difference]: With dead ends: 239 [2024-11-09 01:37:13,296 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 01:37:13,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:37:13,305 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:37:13,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:37:13,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 01:37:13,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-09 01:37:13,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:37:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 174 transitions. [2024-11-09 01:37:13,364 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 174 transitions. Word has length 143 [2024-11-09 01:37:13,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:37:13,366 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 174 transitions. [2024-11-09 01:37:13,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 01:37:13,366 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 174 transitions. [2024-11-09 01:37:13,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 01:37:13,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:37:13,370 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:37:13,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:37:13,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:37:13,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:37:13,372 INFO L85 PathProgramCache]: Analyzing trace with hash 13489301, now seen corresponding path program 1 times [2024-11-09 01:37:13,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:37:13,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674488478] [2024-11-09 01:37:13,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:37:13,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:37:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:37:13,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [445515323] [2024-11-09 01:37:13,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:37:13,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:37:13,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:37:13,587 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:37:13,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:37:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:37:13,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:37:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:37:14,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:37:14,124 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:37:14,125 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:37:14,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:37:14,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:37:14,335 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 01:37:14,419 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:37:14,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:37:14 BoogieIcfgContainer [2024-11-09 01:37:14,424 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:37:14,425 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:37:14,425 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:37:14,425 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:37:14,425 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:37:12" (3/4) ... [2024-11-09 01:37:14,427 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:37:14,428 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:37:14,430 INFO L158 Benchmark]: Toolchain (without parser) took 2863.75ms. Allocated memory was 186.6MB in the beginning and 291.5MB in the end (delta: 104.9MB). Free memory was 113.5MB in the beginning and 182.1MB in the end (delta: -68.7MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2024-11-09 01:37:14,431 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 186.6MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:37:14,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.98ms. Allocated memory is still 186.6MB. Free memory was 113.3MB in the beginning and 95.7MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 01:37:14,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.26ms. Allocated memory is still 186.6MB. Free memory was 95.7MB in the beginning and 154.3MB in the end (delta: -58.6MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-11-09 01:37:14,434 INFO L158 Benchmark]: Boogie Preprocessor took 75.10ms. Allocated memory was 186.6MB in the beginning and 291.5MB in the end (delta: 104.9MB). Free memory was 154.2MB in the beginning and 256.0MB in the end (delta: -101.8MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-11-09 01:37:14,434 INFO L158 Benchmark]: RCFGBuilder took 633.83ms. Allocated memory is still 291.5MB. Free memory was 255.0MB in the beginning and 218.3MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-09 01:37:14,434 INFO L158 Benchmark]: TraceAbstraction took 1715.70ms. Allocated memory is still 291.5MB. Free memory was 217.2MB in the beginning and 182.1MB in the end (delta: 35.1MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2024-11-09 01:37:14,434 INFO L158 Benchmark]: Witness Printer took 3.88ms. Allocated memory is still 291.5MB. Free memory is still 182.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:37:14,436 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 186.6MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.98ms. Allocated memory is still 186.6MB. Free memory was 113.3MB in the beginning and 95.7MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.26ms. Allocated memory is still 186.6MB. Free memory was 95.7MB in the beginning and 154.3MB in the end (delta: -58.6MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.10ms. Allocated memory was 186.6MB in the beginning and 291.5MB in the end (delta: 104.9MB). Free memory was 154.2MB in the beginning and 256.0MB in the end (delta: -101.8MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * RCFGBuilder took 633.83ms. Allocated memory is still 291.5MB. Free memory was 255.0MB in the beginning and 218.3MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1715.70ms. Allocated memory is still 291.5MB. Free memory was 217.2MB in the beginning and 182.1MB in the end (delta: 35.1MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. * Witness Printer took 3.88ms. Allocated memory is still 291.5MB. Free memory is still 182.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryArithmeticDOUBLEoperation at line 38. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L25-L27] signed long int signed_long_int_Array_0[1] = { -1 }; [L25-L27] signed long int signed_long_int_Array_0[1] = { -1 }; [L28-L30] signed short int signed_short_int_Array_0[1] = { 10 }; [L28-L30] signed short int signed_short_int_Array_0[1] = { 10 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L34] unsigned long int last_1_unsigned_long_int_Array_0_4_ = 500; VAL [double_Array_0={4:0}, isInitial=0, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] CALL updateLastVariables() [L91] EXPR unsigned_long_int_Array_0[4] [L91] last_1_unsigned_long_int_Array_0_4_ = unsigned_long_int_Array_0[4] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L61] double_Array_0[0][0][0] = __VERIFIER_nondet_double() [L62] EXPR double_Array_0[0][0][0] [L62] EXPR double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] EXPR double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F [L62] EXPR double_Array_0[0][0][0] [L62] EXPR double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] EXPR (double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 1152921.504606845700e+12F && double_Array_0[0][0][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] EXPR (double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 1152921.504606845700e+12F && double_Array_0[0][0][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] CALL assume_abort_if_not((double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 1152921.504606845700e+12F && double_Array_0[0][0][0] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] RET assume_abort_if_not((double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 1152921.504606845700e+12F && double_Array_0[0][0][0] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L63] double_Array_0[1][0][0] = __VERIFIER_nondet_double() [L64] EXPR double_Array_0[1][0][0] [L64] EXPR double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] EXPR double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F [L64] EXPR double_Array_0[1][0][0] [L64] EXPR double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] EXPR (double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 1152921.504606845700e+12F && double_Array_0[1][0][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] EXPR (double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 1152921.504606845700e+12F && double_Array_0[1][0][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] CALL assume_abort_if_not((double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 1152921.504606845700e+12F && double_Array_0[1][0][0] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] RET assume_abort_if_not((double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 1152921.504606845700e+12F && double_Array_0[1][0][0] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L65] double_Array_0[0][1][0] = __VERIFIER_nondet_double() [L66] EXPR double_Array_0[0][1][0] [L66] EXPR double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] EXPR double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F [L66] EXPR double_Array_0[0][1][0] [L66] EXPR double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] EXPR (double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F) || (double_Array_0[0][1][0] <= 2305843.009213691390e+12F && double_Array_0[0][1][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] EXPR (double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F) || (double_Array_0[0][1][0] <= 2305843.009213691390e+12F && double_Array_0[0][1][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] CALL assume_abort_if_not((double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F) || (double_Array_0[0][1][0] <= 2305843.009213691390e+12F && double_Array_0[0][1][0] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] RET assume_abort_if_not((double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F) || (double_Array_0[0][1][0] <= 2305843.009213691390e+12F && double_Array_0[0][1][0] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L67] double_Array_0[1][1][0] = __VERIFIER_nondet_double() [L68] EXPR double_Array_0[1][1][0] [L68] EXPR double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] EXPR double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F [L68] EXPR double_Array_0[1][1][0] [L68] EXPR double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] EXPR (double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 2305843.009213691390e+12F && double_Array_0[1][1][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] EXPR (double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 2305843.009213691390e+12F && double_Array_0[1][1][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] CALL assume_abort_if_not((double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 2305843.009213691390e+12F && double_Array_0[1][1][0] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] RET assume_abort_if_not((double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 2305843.009213691390e+12F && double_Array_0[1][1][0] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L69] double_Array_0[1][0][1] = __VERIFIER_nondet_double() [L70] EXPR double_Array_0[1][0][1] [L70] EXPR double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] EXPR double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F [L70] EXPR double_Array_0[1][0][1] [L70] EXPR double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] EXPR (double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F) || (double_Array_0[1][0][1] <= 9223372.036854765600e+12F && double_Array_0[1][0][1] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] EXPR (double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F) || (double_Array_0[1][0][1] <= 9223372.036854765600e+12F && double_Array_0[1][0][1] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] CALL assume_abort_if_not((double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F) || (double_Array_0[1][0][1] <= 9223372.036854765600e+12F && double_Array_0[1][0][1] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] RET assume_abort_if_not((double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F) || (double_Array_0[1][0][1] <= 9223372.036854765600e+12F && double_Array_0[1][0][1] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L71] double_Array_0[0][1][1] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[0][1][1] [L72] EXPR double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] EXPR double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F [L72] EXPR double_Array_0[0][1][1] [L72] EXPR double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] EXPR (double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] EXPR (double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] CALL assume_abort_if_not((double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] RET assume_abort_if_not((double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L73] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L74] EXPR signed_long_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L74] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L74] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] EXPR signed_long_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L76] EXPR signed_long_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L76] RET assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L77] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L78] EXPR signed_short_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L78] RET assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L79] EXPR signed_short_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L79] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L80] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L81] EXPR unsigned_long_int_Array_0[1] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L82] EXPR unsigned_long_int_Array_0[1] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L83] unsigned_long_int_Array_0[2] = __VERIFIER_nondet_ulong() [L84] EXPR unsigned_long_int_Array_0[2] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] >= 0) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[2] >= 0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L85] EXPR unsigned_long_int_Array_0[2] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] <= 2147483647) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_long_int_Array_0[2] <= 2147483647) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L86] unsigned_long_int_Array_0[3] = __VERIFIER_nondet_ulong() [L87] EXPR unsigned_long_int_Array_0[3] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] >= 2147483647) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[3] >= 2147483647) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L88] EXPR unsigned_long_int_Array_0[3] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L88] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] <= 4294967294) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L88] RET assume_abort_if_not(unsigned_long_int_Array_0[3] <= 4294967294) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L102] RET updateVariables() [L103] CALL step() [L38] EXPR double_Array_0[0][1][1] [L38] EXPR double_Array_0[1][0][1] [L38] double_Array_0[1][1][1] = (double_Array_0[0][1][1] - double_Array_0[1][0][1]) [L39] EXPR unsigned_long_int_Array_0[1] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L39] COND FALSE !(((((-128) < (last_1_unsigned_long_int_Array_0_4_)) ? (-128) : (last_1_unsigned_long_int_Array_0_4_))) < unsigned_long_int_Array_0[1]) [L46] EXPR unsigned_long_int_Array_0[2] [L46] unsigned_long_int_Array_0[4] = unsigned_long_int_Array_0[2] [L48] EXPR unsigned_long_int_Array_0[4] [L48] EXPR signed_short_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L48] EXPR unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L48] EXPR signed_long_int_Array_0[0] [L48] unsigned long int stepLocal_0 = (unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0]; [L49] COND FALSE !(8 < stepLocal_0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L52] EXPR double_Array_0[0][1][1] [L52] EXPR double_Array_0[1][0][0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L52] COND FALSE !(double_Array_0[0][1][1] < double_Array_0[1][0][0]) [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR double_Array_0[1][1][1] [L94] EXPR double_Array_0[0][1][1] [L94] EXPR double_Array_0[1][0][1] [L94] EXPR (double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR (double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR ((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR ((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR (((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1)) && ((((((-128) < (last_1_unsigned_long_int_Array_0_4_)) ? (-128) : (last_1_unsigned_long_int_Array_0_4_))) < unsigned_long_int_Array_0[1]) ? ((last_1_unsigned_long_int_Array_0_4_ > signed_long_int_Array_0[0]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) (signed_short_int_Array_0[0] + unsigned_long_int_Array_0[2]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[2]))) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR (((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1)) && ((((((-128) < (last_1_unsigned_long_int_Array_0_4_)) ? (-128) : (last_1_unsigned_long_int_Array_0_4_))) < unsigned_long_int_Array_0[1]) ? ((last_1_unsigned_long_int_Array_0_4_ > signed_long_int_Array_0[0]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) (signed_short_int_Array_0[0] + unsigned_long_int_Array_0[2]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[2]))) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94-L95] return (((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1)) && ((((((-128) < (last_1_unsigned_long_int_Array_0_4_)) ? (-128) : (last_1_unsigned_long_int_Array_0_4_))) < unsigned_long_int_Array_0[1]) ? ((last_1_unsigned_long_int_Array_0_4_ > signed_long_int_Array_0[0]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) (signed_short_int_Array_0[0] + unsigned_long_int_Array_0[2]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[2]))) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L19] reach_error() VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 2, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 174 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 174 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 544/544 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 01:37:14,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94402a909576ff0f6dec6fb8b106268679f88adb1b4c5fc615242f98a35b2243 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:37:16,413 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:37:16,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:37:16,484 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:37:16,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:37:16,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:37:16,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:37:16,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:37:16,514 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:37:16,515 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:37:16,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:37:16,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:37:16,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:37:16,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:37:16,518 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:37:16,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:37:16,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:37:16,518 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:37:16,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:37:16,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:37:16,523 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:37:16,523 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:37:16,523 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:37:16,523 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:37:16,524 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:37:16,524 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:37:16,524 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:37:16,524 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:37:16,524 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:37:16,524 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:37:16,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:37:16,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:37:16,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:37:16,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:37:16,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:37:16,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:37:16,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:37:16,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:37:16,526 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:37:16,526 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:37:16,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:37:16,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:37:16,527 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:37:16,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:37:16,527 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 94402a909576ff0f6dec6fb8b106268679f88adb1b4c5fc615242f98a35b2243 [2024-11-09 01:37:16,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:37:16,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:37:16,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:37:16,854 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:37:16,854 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:37:16,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i [2024-11-09 01:37:18,386 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:37:18,560 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:37:18,560 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i [2024-11-09 01:37:18,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b25c0aba/160acab76c154fddb51e1bd2cf13d84d/FLAG434651955 [2024-11-09 01:37:18,583 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b25c0aba/160acab76c154fddb51e1bd2cf13d84d [2024-11-09 01:37:18,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:37:18,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:37:18,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:37:18,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:37:18,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:37:18,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:37:18" (1/1) ... [2024-11-09 01:37:18,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6462d60f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:18, skipping insertion in model container [2024-11-09 01:37:18,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:37:18" (1/1) ... [2024-11-09 01:37:18,618 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:37:18,773 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i[916,929] [2024-11-09 01:37:18,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:37:18,867 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:37:18,877 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i[916,929] [2024-11-09 01:37:18,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:37:18,953 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:37:18,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:18 WrapperNode [2024-11-09 01:37:18,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:37:18,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:37:18,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:37:18,955 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:37:18,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:18" (1/1) ... [2024-11-09 01:37:18,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:18" (1/1) ... [2024-11-09 01:37:19,022 INFO L138 Inliner]: procedures = 36, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 503 [2024-11-09 01:37:19,023 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:37:19,025 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:37:19,025 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:37:19,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:37:19,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:18" (1/1) ... [2024-11-09 01:37:19,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:18" (1/1) ... [2024-11-09 01:37:19,040 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:18" (1/1) ... [2024-11-09 01:37:19,067 INFO L175 MemorySlicer]: Split 134 memory accesses to 5 slices as follows [2, 64, 9, 16, 43]. 48 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 8, 1, 1, 5]. The 18 writes are split as follows [0, 8, 1, 1, 8]. [2024-11-09 01:37:19,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:18" (1/1) ... [2024-11-09 01:37:19,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:18" (1/1) ... [2024-11-09 01:37:19,093 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:18" (1/1) ... [2024-11-09 01:37:19,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:18" (1/1) ... [2024-11-09 01:37:19,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:18" (1/1) ... [2024-11-09 01:37:19,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:18" (1/1) ... [2024-11-09 01:37:19,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:37:19,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:37:19,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:37:19,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:37:19,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:18" (1/1) ... [2024-11-09 01:37:19,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:37:19,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:37:19,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:37:19,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:37:19,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:37:19,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-09 01:37:19,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-09 01:37:19,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-09 01:37:19,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-09 01:37:19,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-09 01:37:19,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-09 01:37:19,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-09 01:37:19,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-09 01:37:19,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-09 01:37:19,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-09 01:37:19,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 01:37:19,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 01:37:19,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 01:37:19,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-09 01:37:19,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-09 01:37:19,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:37:19,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:37:19,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:37:19,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:37:19,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 01:37:19,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 01:37:19,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 01:37:19,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 01:37:19,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 01:37:19,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-09 01:37:19,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-09 01:37:19,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-09 01:37:19,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-09 01:37:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-09 01:37:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-09 01:37:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 01:37:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 01:37:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 01:37:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 01:37:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-09 01:37:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 01:37:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 01:37:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-09 01:37:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-09 01:37:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-09 01:37:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:37:19,199 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:37:19,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:37:19,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:37:19,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 01:37:19,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 01:37:19,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-09 01:37:19,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-09 01:37:19,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-09 01:37:19,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 01:37:19,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 01:37:19,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 01:37:19,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 01:37:19,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-09 01:37:19,361 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:37:19,363 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:37:26,014 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-09 01:37:26,015 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:37:26,027 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:37:26,027 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:37:26,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:37:26 BoogieIcfgContainer [2024-11-09 01:37:26,028 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:37:26,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:37:26,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:37:26,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:37:26,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:37:18" (1/3) ... [2024-11-09 01:37:26,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473ee0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:37:26, skipping insertion in model container [2024-11-09 01:37:26,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:37:18" (2/3) ... [2024-11-09 01:37:26,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473ee0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:37:26, skipping insertion in model container [2024-11-09 01:37:26,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:37:26" (3/3) ... [2024-11-09 01:37:26,039 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-98.i [2024-11-09 01:37:26,053 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:37:26,053 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:37:26,142 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:37:26,148 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@68a44c0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:37:26,152 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:37:26,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 97 states have (on average 1.4329896907216495) internal successors, (139), 98 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:37:26,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 01:37:26,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:37:26,173 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:37:26,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:37:26,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:37:26,179 INFO L85 PathProgramCache]: Analyzing trace with hash 514802496, now seen corresponding path program 1 times [2024-11-09 01:37:26,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:37:26,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306588114] [2024-11-09 01:37:26,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:37:26,206 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:37:26,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:37:26,210 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:37:26,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 01:37:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:26,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:37:26,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:37:26,725 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-09 01:37:26,725 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:37:26,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:37:26,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306588114] [2024-11-09 01:37:26,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306588114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:37:26,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:37:26,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:37:26,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265016135] [2024-11-09 01:37:26,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:37:26,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:37:26,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:37:26,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:37:26,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:37:26,750 INFO L87 Difference]: Start difference. First operand has 117 states, 97 states have (on average 1.4329896907216495) internal successors, (139), 98 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 01:37:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:37:26,776 INFO L93 Difference]: Finished difference Result 227 states and 357 transitions. [2024-11-09 01:37:26,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:37:26,782 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2024-11-09 01:37:26,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:37:26,787 INFO L225 Difference]: With dead ends: 227 [2024-11-09 01:37:26,788 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 01:37:26,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:37:26,792 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:37:26,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:37:26,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 01:37:26,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-09 01:37:26,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:37:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 166 transitions. [2024-11-09 01:37:26,827 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 166 transitions. Word has length 141 [2024-11-09 01:37:26,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:37:26,827 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 166 transitions. [2024-11-09 01:37:26,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 01:37:26,828 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 166 transitions. [2024-11-09 01:37:26,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 01:37:26,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:37:26,831 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:37:26,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 01:37:27,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:37:27,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:37:27,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:37:27,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2101668650, now seen corresponding path program 1 times [2024-11-09 01:37:27,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:37:27,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985153366] [2024-11-09 01:37:27,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:37:27,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:37:27,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:37:27,038 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:37:27,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 01:37:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:27,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:37:27,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:37:27,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:37:27,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-09 01:37:28,056 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-09 01:37:28,056 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:37:28,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:37:28,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985153366] [2024-11-09 01:37:28,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985153366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:37:28,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:37:28,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:37:28,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886694559] [2024-11-09 01:37:28,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:37:28,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:37:28,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:37:28,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:37:28,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:37:28,059 INFO L87 Difference]: Start difference. First operand 113 states and 166 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 01:37:32,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:37:36,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:37:36,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:37:36,254 INFO L93 Difference]: Finished difference Result 224 states and 330 transitions. [2024-11-09 01:37:36,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:37:36,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2024-11-09 01:37:36,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:37:36,256 INFO L225 Difference]: With dead ends: 224 [2024-11-09 01:37:36,256 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 01:37:36,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:37:36,258 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 134 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:37:36,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 482 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2024-11-09 01:37:36,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 01:37:36,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-09 01:37:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 94 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:37:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2024-11-09 01:37:36,271 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 141 [2024-11-09 01:37:36,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:37:36,272 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2024-11-09 01:37:36,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 01:37:36,272 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2024-11-09 01:37:36,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 01:37:36,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:37:36,279 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:37:36,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 01:37:36,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:37:36,480 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:37:36,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:37:36,481 INFO L85 PathProgramCache]: Analyzing trace with hash -570127706, now seen corresponding path program 1 times [2024-11-09 01:37:36,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:37:36,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583855834] [2024-11-09 01:37:36,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:37:36,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:37:36,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:37:36,484 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:37:36,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 01:37:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:37,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:37:37,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:37:37,265 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-09 01:37:37,265 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:37:37,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:37:37,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583855834] [2024-11-09 01:37:37,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583855834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:37:37,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:37:37,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:37:37,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331550624] [2024-11-09 01:37:37,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:37:37,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:37:37,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:37:37,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:37:37,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:37:37,271 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-09 01:37:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:37:37,850 INFO L93 Difference]: Finished difference Result 227 states and 332 transitions. [2024-11-09 01:37:37,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:37:37,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 143 [2024-11-09 01:37:37,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:37:37,859 INFO L225 Difference]: With dead ends: 227 [2024-11-09 01:37:37,860 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 01:37:37,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:37:37,861 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 1 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:37:37,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 682 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:37:37,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 01:37:37,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2024-11-09 01:37:37,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:37:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 164 transitions. [2024-11-09 01:37:37,870 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 164 transitions. Word has length 143 [2024-11-09 01:37:37,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:37:37,870 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 164 transitions. [2024-11-09 01:37:37,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-09 01:37:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 164 transitions. [2024-11-09 01:37:37,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 01:37:37,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:37:37,873 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:37:37,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 01:37:38,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:37:38,077 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:37:38,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:37:38,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1601168604, now seen corresponding path program 1 times [2024-11-09 01:37:38,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:37:38,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630184327] [2024-11-09 01:37:38,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:37:38,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:37:38,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:37:38,084 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:37:38,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 01:37:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:38,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:37:38,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:37:38,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:37:38,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-09 01:37:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-09 01:37:39,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:37:39,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:37:39,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630184327] [2024-11-09 01:37:39,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630184327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:37:39,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:37:39,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:37:39,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695840932] [2024-11-09 01:37:39,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:37:39,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:37:39,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:37:39,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:37:39,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:37:39,071 INFO L87 Difference]: Start difference. First operand 113 states and 164 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 01:37:44,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:37:46,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:37:46,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:37:46,547 INFO L93 Difference]: Finished difference Result 224 states and 326 transitions. [2024-11-09 01:37:46,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:37:46,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-11-09 01:37:46,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:37:46,549 INFO L225 Difference]: With dead ends: 224 [2024-11-09 01:37:46,549 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 01:37:46,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:37:46,550 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 123 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:37:46,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 471 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-11-09 01:37:46,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 01:37:46,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-09 01:37:46,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.372340425531915) internal successors, (129), 94 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:37:46,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2024-11-09 01:37:46,557 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 143 [2024-11-09 01:37:46,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:37:46,558 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2024-11-09 01:37:46,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 01:37:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2024-11-09 01:37:46,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 01:37:46,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:37:46,559 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:37:46,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 01:37:46,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:37:46,770 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:37:46,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:37:46,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1765770602, now seen corresponding path program 1 times [2024-11-09 01:37:46,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:37:46,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326264454] [2024-11-09 01:37:46,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:37:46,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:37:46,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:37:46,773 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:37:46,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process