./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-77.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 1332668b30eb71a22e05594324fbd055ee8541d9c40b03d97de5dc2467d579cb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:01:38,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:01:38,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:01:38,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:01:38,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:01:38,800 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:01:38,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:01:38,802 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:01:38,802 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:01:38,803 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:01:38,804 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:01:38,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:01:38,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:01:38,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:01:38,806 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:01:38,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:01:38,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:01:38,807 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:01:38,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:01:38,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:01:38,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:01:38,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:01:38,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:01:38,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:01:38,809 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:01:38,809 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:01:38,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:01:38,810 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:01:38,810 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:01:38,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:01:38,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:01:38,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:01:38,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:01:38,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:01:38,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:01:38,813 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:01:38,813 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:01:38,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:01:38,814 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:01:38,814 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:01:38,814 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:01:38,815 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:01:38,815 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 -> 1332668b30eb71a22e05594324fbd055ee8541d9c40b03d97de5dc2467d579cb [2024-10-13 06:01:39,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:01:39,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:01:39,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:01:39,119 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:01:39,119 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:01:39,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-77.i [2024-10-13 06:01:40,586 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:01:40,826 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:01:40,826 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-77.i [2024-10-13 06:01:40,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/268cfa9b6/bb66ba2c7dca40838bb0c55c49ea055b/FLAG5ffcc4cb3 [2024-10-13 06:01:40,860 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/268cfa9b6/bb66ba2c7dca40838bb0c55c49ea055b [2024-10-13 06:01:40,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:01:40,864 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:01:40,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:01:40,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:01:40,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:01:40,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:01:40" (1/1) ... [2024-10-13 06:01:40,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@584983f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:40, skipping insertion in model container [2024-10-13 06:01:40,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:01:40" (1/1) ... [2024-10-13 06:01:40,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:01:41,096 WARN L248 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-77.i[916,929] [2024-10-13 06:01:41,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:01:41,192 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:01:41,201 WARN L248 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-77.i[916,929] [2024-10-13 06:01:41,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:01:41,263 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:01:41,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:41 WrapperNode [2024-10-13 06:01:41,264 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:01:41,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:01:41,267 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:01:41,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:01:41,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:41" (1/1) ... [2024-10-13 06:01:41,289 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:41" (1/1) ... [2024-10-13 06:01:41,335 INFO L138 Inliner]: procedures = 29, calls = 199, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 630 [2024-10-13 06:01:41,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:01:41,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:01:41,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:01:41,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:01:41,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:41" (1/1) ... [2024-10-13 06:01:41,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:41" (1/1) ... [2024-10-13 06:01:41,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:41" (1/1) ... [2024-10-13 06:01:41,381 INFO L175 MemorySlicer]: Split 165 memory accesses to 6 slices as follows [2, 12, 11, 65, 7, 68]. 41 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 2, 1, 5, 1, 6]. The 19 writes are split as follows [0, 2, 1, 6, 2, 8]. [2024-10-13 06:01:41,382 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:41" (1/1) ... [2024-10-13 06:01:41,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:41" (1/1) ... [2024-10-13 06:01:41,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:41" (1/1) ... [2024-10-13 06:01:41,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:41" (1/1) ... [2024-10-13 06:01:41,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:41" (1/1) ... [2024-10-13 06:01:41,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:41" (1/1) ... [2024-10-13 06:01:41,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:01:41,444 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:01:41,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:01:41,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:01:41,445 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:41" (1/1) ... [2024-10-13 06:01:41,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:01:41,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:01:41,481 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-10-13 06:01:41,485 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-10-13 06:01:41,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:01:41,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:01:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:01:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 06:01:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 06:01:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 06:01:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-13 06:01:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:01:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:01:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-13 06:01:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-13 06:01:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-13 06:01:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-13 06:01:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:01:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:01:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-13 06:01:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-13 06:01:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-13 06:01:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-13 06:01:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:01:41,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:01:41,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 06:01:41,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 06:01:41,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 06:01:41,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-13 06:01:41,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:01:41,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:01:41,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-13 06:01:41,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-13 06:01:41,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-13 06:01:41,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-13 06:01:41,544 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:01:41,544 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:01:41,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:01:41,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:01:41,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 06:01:41,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 06:01:41,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 06:01:41,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-13 06:01:41,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:01:41,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:01:41,697 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:01:41,699 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:01:42,369 INFO L? ?]: Removed 172 outVars from TransFormulas that were not future-live. [2024-10-13 06:01:42,369 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:01:42,411 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:01:42,412 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:01:42,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:01:42 BoogieIcfgContainer [2024-10-13 06:01:42,413 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:01:42,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:01:42,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:01:42,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:01:42,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:01:40" (1/3) ... [2024-10-13 06:01:42,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33161a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:01:42, skipping insertion in model container [2024-10-13 06:01:42,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:41" (2/3) ... [2024-10-13 06:01:42,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33161a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:01:42, skipping insertion in model container [2024-10-13 06:01:42,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:01:42" (3/3) ... [2024-10-13 06:01:42,423 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-77.i [2024-10-13 06:01:42,439 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:01:42,440 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:01:42,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:01:42,506 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;@a5c0907, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:01:42,506 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:01:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 102 states have (on average 1.4803921568627452) internal successors, (151), 103 states have internal predecessors, (151), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 06:01:42,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:01:42,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:42,523 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:01:42,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:42,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:42,528 INFO L85 PathProgramCache]: Analyzing trace with hash 489871276, now seen corresponding path program 1 times [2024-10-13 06:01:42,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:42,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255287286] [2024-10-13 06:01:42,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:42,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:42,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:42,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:42,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:42,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:42,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:01:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:42,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:01:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:42,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:42,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:01:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:42,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:42,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:01:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:42,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:01:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:42,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:01:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:42,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:01:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:42,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:01:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:42,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:01:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:42,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:01:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:42,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:01:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:42,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:01:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:42,968 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:01:42,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:42,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255287286] [2024-10-13 06:01:42,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255287286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:42,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:42,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:01:42,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557184247] [2024-10-13 06:01:42,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:42,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:01:42,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:43,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:01:43,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:01:43,006 INFO L87 Difference]: Start difference. First operand has 123 states, 102 states have (on average 1.4803921568627452) internal successors, (151), 103 states have internal predecessors, (151), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 06:01:43,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:43,066 INFO L93 Difference]: Finished difference Result 243 states and 390 transitions. [2024-10-13 06:01:43,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:01:43,071 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2024-10-13 06:01:43,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:43,081 INFO L225 Difference]: With dead ends: 243 [2024-10-13 06:01:43,082 INFO L226 Difference]: Without dead ends: 121 [2024-10-13 06:01:43,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-10-13 06:01:43,092 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:43,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:01:43,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-13 06:01:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-13 06:01:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 101 states have internal predecessors, (146), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 06:01:43,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 182 transitions. [2024-10-13 06:01:43,140 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 182 transitions. Word has length 146 [2024-10-13 06:01:43,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:43,141 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 182 transitions. [2024-10-13 06:01:43,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 06:01:43,141 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 182 transitions. [2024-10-13 06:01:43,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:01:43,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:43,147 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:01:43,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:01:43,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:43,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:43,149 INFO L85 PathProgramCache]: Analyzing trace with hash 918513336, now seen corresponding path program 1 times [2024-10-13 06:01:43,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:43,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737192995] [2024-10-13 06:01:43,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:43,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:43,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:43,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:43,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:43,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:43,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:01:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:43,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:01:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:43,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:43,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:01:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:43,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:43,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:01:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:43,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:01:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:43,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:01:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:43,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:01:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:43,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:01:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:43,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:01:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:43,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:01:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:43,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:01:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:43,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:01:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:43,798 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:01:43,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:43,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737192995] [2024-10-13 06:01:43,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737192995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:43,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:43,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:01:43,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166828719] [2024-10-13 06:01:43,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:43,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:01:43,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:43,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:01:43,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:01:43,807 INFO L87 Difference]: Start difference. First operand 121 states and 182 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:01:43,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:43,877 INFO L93 Difference]: Finished difference Result 243 states and 366 transitions. [2024-10-13 06:01:43,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:01:43,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2024-10-13 06:01:43,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:43,882 INFO L225 Difference]: With dead ends: 243 [2024-10-13 06:01:43,882 INFO L226 Difference]: Without dead ends: 123 [2024-10-13 06:01:43,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:01:43,885 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:43,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 521 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:01:43,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-13 06:01:43,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-10-13 06:01:43,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 103 states have (on average 1.4368932038834952) internal successors, (148), 103 states have internal predecessors, (148), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 06:01:43,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 184 transitions. [2024-10-13 06:01:43,913 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 184 transitions. Word has length 146 [2024-10-13 06:01:43,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:43,917 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 184 transitions. [2024-10-13 06:01:43,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:01:43,918 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 184 transitions. [2024-10-13 06:01:43,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 06:01:43,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:43,920 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:01:43,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:01:43,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:43,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:43,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1338740995, now seen corresponding path program 1 times [2024-10-13 06:01:43,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:43,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926843169] [2024-10-13 06:01:43,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:43,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:44,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:44,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:44,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:44,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:44,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:01:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:44,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:01:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:44,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:44,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:01:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:44,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:44,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:01:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:44,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:01:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:44,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:01:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:44,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:01:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:44,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:01:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:44,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:01:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:44,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:01:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:44,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:01:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:44,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:01:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:01:44,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:44,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926843169] [2024-10-13 06:01:44,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926843169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:44,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:44,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:01:44,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473034638] [2024-10-13 06:01:44,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:44,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:01:44,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:44,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:01:44,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:01:44,737 INFO L87 Difference]: Start difference. First operand 123 states and 184 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:01:45,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:45,128 INFO L93 Difference]: Finished difference Result 346 states and 518 transitions. [2024-10-13 06:01:45,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:01:45,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2024-10-13 06:01:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:45,131 INFO L225 Difference]: With dead ends: 346 [2024-10-13 06:01:45,131 INFO L226 Difference]: Without dead ends: 224 [2024-10-13 06:01:45,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:01:45,138 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 142 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:45,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 530 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:01:45,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-13 06:01:45,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2024-10-13 06:01:45,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 190 states have (on average 1.4526315789473685) internal successors, (276), 191 states have internal predecessors, (276), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 06:01:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 332 transitions. [2024-10-13 06:01:45,179 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 332 transitions. Word has length 148 [2024-10-13 06:01:45,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:45,180 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 332 transitions. [2024-10-13 06:01:45,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:01:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 332 transitions. [2024-10-13 06:01:45,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 06:01:45,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:45,188 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:01:45,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:01:45,188 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:45,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:45,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1367878399, now seen corresponding path program 1 times [2024-10-13 06:01:45,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:45,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984270769] [2024-10-13 06:01:45,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:45,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:01:45,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [851810889] [2024-10-13 06:01:45,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:45,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:01:45,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:01:45,367 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-10-13 06:01:45,369 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-10-13 06:01:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:01:45,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:01:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:01:46,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:01:46,435 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:01:46,436 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 06:01:46,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 06:01:46,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:01:46,642 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 06:01:46,759 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:01:46,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:01:46 BoogieIcfgContainer [2024-10-13 06:01:46,765 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:01:46,766 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:01:46,766 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:01:46,766 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:01:46,767 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:01:42" (3/4) ... [2024-10-13 06:01:46,770 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 06:01:46,772 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:01:46,774 INFO L158 Benchmark]: Toolchain (without parser) took 5908.61ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 100.6MB in the beginning and 59.8MB in the end (delta: 40.9MB). Peak memory consumption was 101.5MB. Max. memory is 16.1GB. [2024-10-13 06:01:46,774 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 155.2MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:01:46,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.24ms. Allocated memory is still 155.2MB. Free memory was 100.4MB in the beginning and 82.4MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 06:01:46,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.53ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 77.7MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:01:46,777 INFO L158 Benchmark]: Boogie Preprocessor took 106.45ms. Allocated memory is still 155.2MB. Free memory was 77.7MB in the beginning and 71.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 06:01:46,777 INFO L158 Benchmark]: RCFGBuilder took 969.44ms. Allocated memory is still 155.2MB. Free memory was 71.4MB in the beginning and 106.4MB in the end (delta: -35.1MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2024-10-13 06:01:46,777 INFO L158 Benchmark]: TraceAbstraction took 4350.01ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 105.8MB in the beginning and 60.8MB in the end (delta: 45.0MB). Peak memory consumption was 106.8MB. Max. memory is 16.1GB. [2024-10-13 06:01:46,777 INFO L158 Benchmark]: Witness Printer took 6.22ms. Allocated memory is still 213.9MB. Free memory was 60.8MB in the beginning and 59.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:01:46,779 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.20ms. Allocated memory is still 155.2MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.24ms. Allocated memory is still 155.2MB. Free memory was 100.4MB in the beginning and 82.4MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.53ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 77.7MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.45ms. Allocated memory is still 155.2MB. Free memory was 77.7MB in the beginning and 71.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 969.44ms. Allocated memory is still 155.2MB. Free memory was 71.4MB in the beginning and 106.4MB in the end (delta: -35.1MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4350.01ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 105.8MB in the beginning and 60.8MB in the end (delta: 45.0MB). Peak memory consumption was 106.8MB. Max. memory is 16.1GB. * Witness Printer took 6.22ms. Allocated memory is still 213.9MB. Free memory was 60.8MB in the beginning and 59.8MB in the end (delta: 1.0MB). 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 75, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someUnaryFLOAToperation at line 41. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] double double_Array_0[1] = { 10000000000000.375 }; [L25-L27] double double_Array_0[1] = { 10000000000000.375 }; [L28-L30] float float_Array_0[5] = { 0.0, 49.5, 63.8, 31.875, 255.25 }; [L28-L30] float float_Array_0[5] = { 0.0, 49.5, 63.8, 31.875, 255.25 }; [L28-L30] float float_Array_0[5] = { 0.0, 49.5, 63.8, 31.875, 255.25 }; [L28-L30] float float_Array_0[5] = { 0.0, 49.5, 63.8, 31.875, 255.25 }; [L28-L30] float float_Array_0[5] = { 0.0, 49.5, 63.8, 31.875, 255.25 }; [L28-L30] float float_Array_0[5] = { 0.0, 49.5, 63.8, 31.875, 255.25 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -8 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -8 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {5, 28896, 60871}, {4, 1, 50} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {5, 28896, 60871}, {4, 1, 50} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {5, 28896, 60871}, {4, 1, 50} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {5, 28896, 60871}, {4, 1, 50} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {5, 28896, 60871}, {4, 1, 50} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {5, 28896, 60871}, {4, 1, 50} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {5, 28896, 60871}, {4, 1, 50} }; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] FCALL updateLastVariables() [L108] CALL updateVariables() [L67] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L68] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] double_Array_0[0] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[0] [L74] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L74] EXPR double_Array_0[0] [L74] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(double_Array_0[0] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not(double_Array_0[0] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] float_Array_0[0] = __VERIFIER_nondet_float() [L77] EXPR float_Array_0[0] [L77] EXPR float_Array_0[0] >= 4611686.018427382800e+12F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR float_Array_0[0] >= 4611686.018427382800e+12F && float_Array_0[0] <= -1.0e-20F [L77] EXPR float_Array_0[0] [L77] EXPR float_Array_0[0] >= 4611686.018427382800e+12F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR (float_Array_0[0] >= 4611686.018427382800e+12F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR (float_Array_0[0] >= 4611686.018427382800e+12F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not((float_Array_0[0] >= 4611686.018427382800e+12F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not((float_Array_0[0] >= 4611686.018427382800e+12F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] float_Array_0[1] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[1] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L79] EXPR float_Array_0[1] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] float_Array_0[3] = __VERIFIER_nondet_float() [L81] EXPR float_Array_0[3] [L81] EXPR float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] EXPR float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F [L81] EXPR float_Array_0[3] [L81] EXPR float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] EXPR (float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] EXPR (float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not((float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not((float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] float_Array_0[4] = __VERIFIER_nondet_float() [L83] EXPR float_Array_0[4] [L83] EXPR float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] EXPR float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F [L83] EXPR float_Array_0[4] [L83] EXPR float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] EXPR (float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854765600e+12F && float_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] EXPR (float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854765600e+12F && float_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] CALL assume_abort_if_not((float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854765600e+12F && float_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] RET assume_abort_if_not((float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854765600e+12F && float_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] unsigned_short_int_Array_0[0][0] = __VERIFIER_nondet_ushort() [L85] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L88] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L88] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L88] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] unsigned_short_int_Array_0[1][1] = __VERIFIER_nondet_ushort() [L91] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] unsigned_short_int_Array_0[0][2] = __VERIFIER_nondet_ushort() [L94] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L108] RET updateVariables() [L109] CALL step() [L40] EXPR unsigned_short_int_Array_0[0][0] [L40] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L40] COND TRUE unsigned_short_int_Array_0[0][0] > unsigned_short_int_Array_0[1][1] [L41] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L41] EXPR ((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]) [L41] EXPR float_Array_0[1] [L41] EXPR ((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L41] float_Array_0[2] = ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))) [L45] EXPR unsigned_short_int_Array_0[0][1] [L45] unsigned short int stepLocal_0 = unsigned_short_int_Array_0[0][1]; [L46] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L46] COND FALSE !(stepLocal_0 <= unsigned_short_int_Array_0[1][1]) [L51] EXPR unsigned_short_int_Array_0[0][0] [L51] signed_short_int_Array_0[0] = unsigned_short_int_Array_0[0][0] [L53] EXPR unsigned_short_int_Array_0[0][1] [L53] EXPR signed_short_int_Array_0[0] [L53] EXPR unsigned_short_int_Array_0[1][1] [L53] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L53] EXPR ((unsigned_short_int_Array_0[1][1]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][1]) : (unsigned_short_int_Array_0[0][0]) [L53] EXPR unsigned_short_int_Array_0[0][0] [L53] EXPR ((unsigned_short_int_Array_0[1][1]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][1]) : (unsigned_short_int_Array_0[0][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L53] COND FALSE !(unsigned_short_int_Array_0[0][1] > (signed_short_int_Array_0[0] * ((((unsigned_short_int_Array_0[1][1]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][1]) : (unsigned_short_int_Array_0[0][0]))))) [L60] EXPR unsigned_short_int_Array_0[0][1] [L60] unsigned_short_int_Array_0[1][0] = unsigned_short_int_Array_0[0][1] [L62] EXPR float_Array_0[2] [L62] EXPR float_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L62] COND FALSE !(float_Array_0[2] != float_Array_0[2]) [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR float_Array_0[2] [L100] EXPR float_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (float_Array_0[2] != float_Array_0[2]) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - ((((unsigned_short_int_Array_0[1][1]) < ((unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[0][0]))) ? (unsigned_short_int_Array_0[1][1]) : ((unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[0][0]))))))) : 1 [L100] EXPR unsigned_short_int_Array_0[1][2] [L100] EXPR unsigned_short_int_Array_0[0][2] [L100] EXPR unsigned_short_int_Array_0[1][1] [L100] EXPR unsigned_short_int_Array_0[0][1] [L100] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((unsigned_short_int_Array_0[1][1]) < ((unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[0][0]))) ? (unsigned_short_int_Array_0[1][1]) : ((unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[0][0])) [L100] EXPR unsigned_short_int_Array_0[1][1] [L100] EXPR ((unsigned_short_int_Array_0[1][1]) < ((unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[0][0]))) ? (unsigned_short_int_Array_0[1][1]) : ((unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (float_Array_0[2] != float_Array_0[2]) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - ((((unsigned_short_int_Array_0[1][1]) < ((unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[0][0]))) ? (unsigned_short_int_Array_0[1][1]) : ((unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[0][0]))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((float_Array_0[2] != float_Array_0[2]) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - ((((unsigned_short_int_Array_0[1][1]) < ((unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[0][0]))) ? (unsigned_short_int_Array_0[1][1]) : ((unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[0][0]))))))) : 1) && ((unsigned_short_int_Array_0[0][0] > unsigned_short_int_Array_0[1][1]) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) (((((float_Array_0[3]) > (float_Array_0[4])) ? (float_Array_0[3]) : (float_Array_0[4]))) - (float_Array_0[0] - 3.4f))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((float_Array_0[2] != float_Array_0[2]) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - ((((unsigned_short_int_Array_0[1][1]) < ((unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[0][0]))) ? (unsigned_short_int_Array_0[1][1]) : ((unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[0][0]))))))) : 1) && ((unsigned_short_int_Array_0[0][0] > unsigned_short_int_Array_0[1][1]) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) (((((float_Array_0[3]) > (float_Array_0[4])) ? (float_Array_0[3]) : (float_Array_0[4]))) - (float_Array_0[0] - 3.4f))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((float_Array_0[2] != float_Array_0[2]) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - ((((unsigned_short_int_Array_0[1][1]) < ((unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[0][0]))) ? (unsigned_short_int_Array_0[1][1]) : ((unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[0][0]))))))) : 1) && ((unsigned_short_int_Array_0[0][0] > unsigned_short_int_Array_0[1][1]) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) (((((float_Array_0[3]) > (float_Array_0[4])) ? (float_Array_0[3]) : (float_Array_0[4]))) - (float_Array_0[0] - 3.4f)))))) && ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[1][1]) ? ((((((float_Array_0[2]) > ((float_Array_0[0] / double_Array_0[0]))) ? (float_Array_0[2]) : ((float_Array_0[0] / double_Array_0[0])))) > ((((float_Array_0[3]) < (float_Array_0[2])) ? (float_Array_0[3]) : (float_Array_0[2])))) ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[0][0])) : 1) : (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((float_Array_0[2] != float_Array_0[2]) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - ((((unsigned_short_int_Array_0[1][1]) < ((unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[0][0]))) ? (unsigned_short_int_Array_0[1][1]) : ((unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[0][0]))))))) : 1) && ((unsigned_short_int_Array_0[0][0] > unsigned_short_int_Array_0[1][1]) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) (((((float_Array_0[3]) > (float_Array_0[4])) ? (float_Array_0[3]) : (float_Array_0[4]))) - (float_Array_0[0] - 3.4f)))))) && ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[1][1]) ? ((((((float_Array_0[2]) > ((float_Array_0[0] / double_Array_0[0]))) ? (float_Array_0[2]) : ((float_Array_0[0] / double_Array_0[0])))) > ((((float_Array_0[3]) < (float_Array_0[2])) ? (float_Array_0[3]) : (float_Array_0[2])))) ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[0][0])) : 1) : (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((((float_Array_0[2] != float_Array_0[2]) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - ((((unsigned_short_int_Array_0[1][1]) < ((unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[0][0]))) ? (unsigned_short_int_Array_0[1][1]) : ((unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[0][0]))))))) : 1) && ((unsigned_short_int_Array_0[0][0] > unsigned_short_int_Array_0[1][1]) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) (((((float_Array_0[3]) > (float_Array_0[4])) ? (float_Array_0[3]) : (float_Array_0[4]))) - (float_Array_0[0] - 3.4f)))))) && ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[1][1]) ? ((((((float_Array_0[2]) > ((float_Array_0[0] / double_Array_0[0]))) ? (float_Array_0[2]) : ((float_Array_0[0] / double_Array_0[0])))) > ((((float_Array_0[3]) < (float_Array_0[2])) ? (float_Array_0[3]) : (float_Array_0[2])))) ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[0][0])) : 1) : (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[0][0])))) && ((unsigned_short_int_Array_0[0][1] > (signed_short_int_Array_0[0] * ((((unsigned_short_int_Array_0[1][1]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][1]) : (unsigned_short_int_Array_0[0][0]))))) ? ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) unsigned_short_int_Array_0[0][0]))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) unsigned_short_int_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((((float_Array_0[2] != float_Array_0[2]) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - ((((unsigned_short_int_Array_0[1][1]) < ((unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[0][0]))) ? (unsigned_short_int_Array_0[1][1]) : ((unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[0][0]))))))) : 1) && ((unsigned_short_int_Array_0[0][0] > unsigned_short_int_Array_0[1][1]) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) (((((float_Array_0[3]) > (float_Array_0[4])) ? (float_Array_0[3]) : (float_Array_0[4]))) - (float_Array_0[0] - 3.4f)))))) && ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[1][1]) ? ((((((float_Array_0[2]) > ((float_Array_0[0] / double_Array_0[0]))) ? (float_Array_0[2]) : ((float_Array_0[0] / double_Array_0[0])))) > ((((float_Array_0[3]) < (float_Array_0[2])) ? (float_Array_0[3]) : (float_Array_0[2])))) ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[0][0])) : 1) : (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[0][0])))) && ((unsigned_short_int_Array_0[0][1] > (signed_short_int_Array_0[0] * ((((unsigned_short_int_Array_0[1][1]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][1]) : (unsigned_short_int_Array_0[0][0]))))) ? ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) unsigned_short_int_Array_0[0][0]))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) unsigned_short_int_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100-L101] return ((((float_Array_0[2] != float_Array_0[2]) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - ((((unsigned_short_int_Array_0[1][1]) < ((unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[0][0]))) ? (unsigned_short_int_Array_0[1][1]) : ((unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[0][0]))))))) : 1) && ((unsigned_short_int_Array_0[0][0] > unsigned_short_int_Array_0[1][1]) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) (((((float_Array_0[3]) > (float_Array_0[4])) ? (float_Array_0[3]) : (float_Array_0[4]))) - (float_Array_0[0] - 3.4f)))))) && ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[1][1]) ? ((((((float_Array_0[2]) > ((float_Array_0[0] / double_Array_0[0]))) ? (float_Array_0[2]) : ((float_Array_0[0] / double_Array_0[0])))) > ((((float_Array_0[3]) < (float_Array_0[2])) ? (float_Array_0[3]) : (float_Array_0[2])))) ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[0][0])) : 1) : (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[0][0])))) && ((unsigned_short_int_Array_0[0][1] > (signed_short_int_Array_0[0] * ((((unsigned_short_int_Array_0[1][1]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][1]) : (unsigned_short_int_Array_0[0][0]))))) ? ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) unsigned_short_int_Array_0[0][0]))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) unsigned_short_int_Array_0[0][1]))) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 142 mSDsluCounter, 1229 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 725 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 220 IncrementalHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 504 mSDtfsCounter, 220 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=3, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 736 NumberOfCodeBlocks, 736 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 437 ConstructedInterpolants, 0 QuantifiedInterpolants, 577 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1836/1836 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-10-13 06:01:46,822 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-77.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 1332668b30eb71a22e05594324fbd055ee8541d9c40b03d97de5dc2467d579cb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:01:49,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:01:49,382 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 06:01:49,387 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:01:49,388 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:01:49,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:01:49,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:01:49,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:01:49,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:01:49,419 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:01:49,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:01:49,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:01:49,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:01:49,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:01:49,426 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:01:49,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:01:49,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:01:49,426 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:01:49,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:01:49,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:01:49,427 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:01:49,431 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:01:49,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:01:49,432 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 06:01:49,432 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 06:01:49,432 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:01:49,432 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 06:01:49,433 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:01:49,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:01:49,433 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:01:49,433 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:01:49,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:01:49,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:01:49,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:01:49,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:01:49,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:01:49,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:01:49,439 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:01:49,439 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 06:01:49,439 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 06:01:49,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:01:49,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:01:49,441 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:01:49,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:01:49,441 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 06:01:49,441 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 -> 1332668b30eb71a22e05594324fbd055ee8541d9c40b03d97de5dc2467d579cb [2024-10-13 06:01:49,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:01:49,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:01:49,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:01:49,851 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:01:49,851 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:01:49,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-77.i [2024-10-13 06:01:51,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:01:51,918 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:01:51,920 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-77.i [2024-10-13 06:01:51,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4f805d50/4c1b56793474491fae03ff556b894658/FLAGd6623fe0e [2024-10-13 06:01:51,952 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4f805d50/4c1b56793474491fae03ff556b894658 [2024-10-13 06:01:51,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:01:51,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:01:51,961 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:01:51,961 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:01:51,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:01:51,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:01:51" (1/1) ... [2024-10-13 06:01:51,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5a4df0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:51, skipping insertion in model container [2024-10-13 06:01:51,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:01:51" (1/1) ... [2024-10-13 06:01:51,997 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:01:52,184 WARN L248 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-77.i[916,929] [2024-10-13 06:01:52,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:01:52,311 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:01:52,323 WARN L248 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-77.i[916,929] [2024-10-13 06:01:52,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:01:52,409 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:01:52,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:52 WrapperNode [2024-10-13 06:01:52,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:01:52,411 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:01:52,411 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:01:52,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:01:52,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:52" (1/1) ... [2024-10-13 06:01:52,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:52" (1/1) ... [2024-10-13 06:01:52,511 INFO L138 Inliner]: procedures = 36, calls = 199, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 630 [2024-10-13 06:01:52,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:01:52,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:01:52,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:01:52,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:01:52,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:52" (1/1) ... [2024-10-13 06:01:52,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:52" (1/1) ... [2024-10-13 06:01:52,549 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:52" (1/1) ... [2024-10-13 06:01:52,609 INFO L175 MemorySlicer]: Split 165 memory accesses to 6 slices as follows [2, 12, 11, 65, 7, 68]. 41 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 2, 1, 5, 1, 6]. The 19 writes are split as follows [0, 2, 1, 6, 2, 8]. [2024-10-13 06:01:52,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:52" (1/1) ... [2024-10-13 06:01:52,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:52" (1/1) ... [2024-10-13 06:01:52,660 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:52" (1/1) ... [2024-10-13 06:01:52,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:52" (1/1) ... [2024-10-13 06:01:52,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:52" (1/1) ... [2024-10-13 06:01:52,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:52" (1/1) ... [2024-10-13 06:01:52,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:01:52,702 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:01:52,702 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:01:52,702 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:01:52,703 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:52" (1/1) ... [2024-10-13 06:01:52,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:01:52,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:01:52,741 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-10-13 06:01:52,746 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-10-13 06:01:52,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:01:52,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-13 06:01:52,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-13 06:01:52,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-13 06:01:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-13 06:01:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-13 06:01:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-13 06:01:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-13 06:01:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-13 06:01:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-13 06:01:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-13 06:01:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-13 06:01:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-13 06:01:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 06:01:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 06:01:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 06:01:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-13 06:01:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-13 06:01:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-13 06:01:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-13 06:01:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-13 06:01:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-13 06:01:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-13 06:01:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-13 06:01:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-13 06:01:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 06:01:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 06:01:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 06:01:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-13 06:01:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-13 06:01:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-13 06:01:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-13 06:01:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-13 06:01:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-13 06:01:52,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-13 06:01:52,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-13 06:01:52,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-13 06:01:52,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-13 06:01:52,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-13 06:01:52,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-13 06:01:52,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-13 06:01:52,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-13 06:01:52,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-13 06:01:52,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-13 06:01:52,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-13 06:01:52,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-13 06:01:52,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-13 06:01:52,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-13 06:01:52,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-13 06:01:52,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-13 06:01:52,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-13 06:01:52,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-13 06:01:52,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-13 06:01:52,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-13 06:01:52,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-13 06:01:52,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-13 06:01:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-13 06:01:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-13 06:01:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-13 06:01:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-13 06:01:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-13 06:01:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:01:52,811 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:01:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:01:52,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:01:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 06:01:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 06:01:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-13 06:01:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-13 06:01:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-13 06:01:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-13 06:01:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-13 06:01:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-13 06:01:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-13 06:01:52,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-13 06:01:52,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-13 06:01:52,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-13 06:01:53,003 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:01:53,006 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:02:16,110 INFO L? ?]: Removed 182 outVars from TransFormulas that were not future-live. [2024-10-13 06:02:16,110 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:02:16,171 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:02:16,171 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:02:16,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:02:16 BoogieIcfgContainer [2024-10-13 06:02:16,172 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:02:16,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:02:16,174 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:02:16,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:02:16,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:01:51" (1/3) ... [2024-10-13 06:02:16,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc1d853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:02:16, skipping insertion in model container [2024-10-13 06:02:16,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:52" (2/3) ... [2024-10-13 06:02:16,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc1d853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:02:16, skipping insertion in model container [2024-10-13 06:02:16,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:02:16" (3/3) ... [2024-10-13 06:02:16,181 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-77.i [2024-10-13 06:02:16,201 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:02:16,202 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:02:16,280 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:02:16,287 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;@7a3d0283, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:02:16,287 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:02:16,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 102 states have (on average 1.4803921568627452) internal successors, (151), 103 states have internal predecessors, (151), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 06:02:16,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:02:16,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:02:16,310 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:02:16,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:02:16,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:02:16,315 INFO L85 PathProgramCache]: Analyzing trace with hash 489871276, now seen corresponding path program 1 times [2024-10-13 06:02:16,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:02:16,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538473748] [2024-10-13 06:02:16,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:02:16,330 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-10-13 06:02:16,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:02:16,333 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-10-13 06:02:16,335 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-10-13 06:02:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:02:16,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 06:02:16,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:02:16,870 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-10-13 06:02:16,871 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:02:16,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:02:16,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538473748] [2024-10-13 06:02:16,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538473748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:02:16,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:02:16,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:02:16,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922116116] [2024-10-13 06:02:16,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:02:16,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:02:16,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:02:16,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:02:16,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:02:16,917 INFO L87 Difference]: Start difference. First operand has 123 states, 102 states have (on average 1.4803921568627452) internal successors, (151), 103 states have internal predecessors, (151), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 06:02:17,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:02:17,118 INFO L93 Difference]: Finished difference Result 243 states and 390 transitions. [2024-10-13 06:02:17,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:02:17,121 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2024-10-13 06:02:17,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:02:17,128 INFO L225 Difference]: With dead ends: 243 [2024-10-13 06:02:17,128 INFO L226 Difference]: Without dead ends: 121 [2024-10-13 06:02:17,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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-10-13 06:02:17,135 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:02:17,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:02:17,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-13 06:02:17,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-13 06:02:17,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 101 states have internal predecessors, (146), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 06:02:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 182 transitions. [2024-10-13 06:02:17,185 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 182 transitions. Word has length 146 [2024-10-13 06:02:17,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:02:17,185 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 182 transitions. [2024-10-13 06:02:17,186 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 06:02:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 182 transitions. [2024-10-13 06:02:17,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:02:17,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:02:17,190 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:02:17,201 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-10-13 06:02:17,391 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-10-13 06:02:17,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:02:17,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:02:17,392 INFO L85 PathProgramCache]: Analyzing trace with hash 918513336, now seen corresponding path program 1 times [2024-10-13 06:02:17,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:02:17,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056436872] [2024-10-13 06:02:17,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:02:17,394 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-10-13 06:02:17,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:02:17,395 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-10-13 06:02:17,397 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-10-13 06:02:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:02:17,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 06:02:17,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:02:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:02:18,237 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:02:18,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:02:18,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056436872] [2024-10-13 06:02:18,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056436872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:02:18,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:02:18,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:02:18,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981781950] [2024-10-13 06:02:18,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:02:18,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:02:18,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:02:18,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:02:18,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:02:18,242 INFO L87 Difference]: Start difference. First operand 121 states and 182 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:02:19,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:02:19,122 INFO L93 Difference]: Finished difference Result 243 states and 366 transitions. [2024-10-13 06:02:19,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:02:19,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2024-10-13 06:02:19,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:02:19,138 INFO L225 Difference]: With dead ends: 243 [2024-10-13 06:02:19,138 INFO L226 Difference]: Without dead ends: 123 [2024-10-13 06:02:19,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:02:19,140 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 06:02:19,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 521 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 06:02:19,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-13 06:02:19,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-10-13 06:02:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 103 states have (on average 1.4368932038834952) internal successors, (148), 103 states have internal predecessors, (148), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 06:02:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 184 transitions. [2024-10-13 06:02:19,177 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 184 transitions. Word has length 146 [2024-10-13 06:02:19,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:02:19,184 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 184 transitions. [2024-10-13 06:02:19,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:02:19,184 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 184 transitions. [2024-10-13 06:02:19,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 06:02:19,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:02:19,190 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:02:19,254 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 (3)] Ended with exit code 0 [2024-10-13 06:02:19,390 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-10-13 06:02:19,391 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:02:19,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:02:19,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1338740995, now seen corresponding path program 1 times [2024-10-13 06:02:19,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:02:19,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980204305] [2024-10-13 06:02:19,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:02:19,395 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-10-13 06:02:19,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:02:19,398 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-10-13 06:02:19,400 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-10-13 06:02:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:02:19,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 06:02:19,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:02:23,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 43 [2024-10-13 06:02:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-10-13 06:02:24,178 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:02:24,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:02:24,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980204305] [2024-10-13 06:02:24,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980204305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:02:24,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:02:24,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:02:24,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273596776] [2024-10-13 06:02:24,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:02:24,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:02:24,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:02:24,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:02:24,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:02:24,185 INFO L87 Difference]: Start difference. First operand 123 states and 184 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 06:02:34,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:02:38,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:02:42,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:02:46,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:02:51,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:02:55,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:02:59,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:03:03,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:03:10,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []