./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.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 06557c270490180718c8b17df780a67c95f9f8a79364859de2d5e3b0ea99ce3e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:38:08,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:38:08,482 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:38:08,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:38:08,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:38:08,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:38:08,511 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:38:08,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:38:08,512 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:38:08,512 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:38:08,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:38:08,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:38:08,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:38:08,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:38:08,514 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:38:08,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:38:08,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:38:08,515 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:38:08,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:38:08,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:38:08,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:38:08,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:38:08,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:38:08,517 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:38:08,517 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:38:08,517 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:38:08,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:38:08,518 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:38:08,518 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:38:08,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:38:08,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:38:08,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:38:08,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:38:08,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:38:08,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:38:08,520 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:38:08,520 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:38:08,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:38:08,520 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:38:08,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:38:08,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:38:08,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:38:08,521 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 -> 06557c270490180718c8b17df780a67c95f9f8a79364859de2d5e3b0ea99ce3e [2024-11-19 00:38:08,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:38:08,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:38:08,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:38:08,743 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:38:08,746 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:38:08,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i [2024-11-19 00:38:10,040 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:38:10,206 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:38:10,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i [2024-11-19 00:38:10,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b45c51492/ccb413e65b584c77bf9f70fc3ee2445b/FLAG9288ca577 [2024-11-19 00:38:10,228 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b45c51492/ccb413e65b584c77bf9f70fc3ee2445b [2024-11-19 00:38:10,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:38:10,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:38:10,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:38:10,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:38:10,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:38:10,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:38:10" (1/1) ... [2024-11-19 00:38:10,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3de47110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:10, skipping insertion in model container [2024-11-19 00:38:10,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:38:10" (1/1) ... [2024-11-19 00:38:10,257 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:38:10,370 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i[916,929] [2024-11-19 00:38:10,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:38:10,430 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:38:10,439 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i[916,929] [2024-11-19 00:38:10,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:38:10,492 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:38:10,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:10 WrapperNode [2024-11-19 00:38:10,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:38:10,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:38:10,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:38:10,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:38:10,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:10" (1/1) ... [2024-11-19 00:38:10,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:10" (1/1) ... [2024-11-19 00:38:10,574 INFO L138 Inliner]: procedures = 29, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 477 [2024-11-19 00:38:10,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:38:10,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:38:10,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:38:10,575 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:38:10,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:10" (1/1) ... [2024-11-19 00:38:10,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:10" (1/1) ... [2024-11-19 00:38:10,613 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:10" (1/1) ... [2024-11-19 00:38:10,670 INFO L175 MemorySlicer]: Split 131 memory accesses to 6 slices as follows [2, 16, 23, 31, 7, 52]. 40 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 2, 2, 2, 1, 4]. The 18 writes are split as follows [0, 2, 5, 5, 2, 4]. [2024-11-19 00:38:10,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:10" (1/1) ... [2024-11-19 00:38:10,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:10" (1/1) ... [2024-11-19 00:38:10,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:10" (1/1) ... [2024-11-19 00:38:10,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:10" (1/1) ... [2024-11-19 00:38:10,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:10" (1/1) ... [2024-11-19 00:38:10,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:10" (1/1) ... [2024-11-19 00:38:10,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:38:10,748 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:38:10,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:38:10,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:38:10,749 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:10" (1/1) ... [2024-11-19 00:38:10,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:38:10,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:38:10,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:38:10,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:38:10,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:38:10,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:38:10,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:38:10,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:38:10,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:38:10,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:38:10,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-19 00:38:10,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:38:10,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:38:10,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:38:10,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:38:10,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:38:10,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 00:38:10,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:38:10,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:38:10,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:38:10,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:38:10,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:38:10,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-19 00:38:10,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:38:10,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:38:10,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:38:10,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:38:10,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:38:10,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 00:38:10,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:38:10,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:38:10,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:38:10,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:38:10,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:38:10,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-19 00:38:10,856 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:38:10,856 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:38:10,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:38:10,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:38:10,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:38:10,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:38:10,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:38:10,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 00:38:10,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:38:10,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:38:11,008 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:38:11,010 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:38:11,406 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-19 00:38:11,406 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:38:11,419 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:38:11,419 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:38:11,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:38:11 BoogieIcfgContainer [2024-11-19 00:38:11,419 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:38:11,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:38:11,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:38:11,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:38:11,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:38:10" (1/3) ... [2024-11-19 00:38:11,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423cabd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:38:11, skipping insertion in model container [2024-11-19 00:38:11,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:10" (2/3) ... [2024-11-19 00:38:11,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423cabd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:38:11, skipping insertion in model container [2024-11-19 00:38:11,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:38:11" (3/3) ... [2024-11-19 00:38:11,435 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-69.i [2024-11-19 00:38:11,456 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:38:11,457 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:38:11,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:38:11,514 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;@2d86538d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:38:11,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:38:11,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:38:11,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 00:38:11,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:11,526 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:11,527 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:11,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:11,530 INFO L85 PathProgramCache]: Analyzing trace with hash 849212081, now seen corresponding path program 1 times [2024-11-19 00:38:11,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:38:11,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077341072] [2024-11-19 00:38:11,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:11,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:38:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-19 00:38:11,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:38:11,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077341072] [2024-11-19 00:38:11,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077341072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:38:11,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363549708] [2024-11-19 00:38:11,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:11,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:38:11,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:38:11,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:38:11,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:38:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:11,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:38:11,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:11,962 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-19 00:38:11,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:11,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363549708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:11,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:38:11,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:38:11,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255504140] [2024-11-19 00:38:11,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:11,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:38:11,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:38:11,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:38:11,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:38:11,988 INFO L87 Difference]: Start difference. First operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 00:38:12,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:12,010 INFO L93 Difference]: Finished difference Result 181 states and 287 transitions. [2024-11-19 00:38:12,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:38:12,012 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2024-11-19 00:38:12,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:12,018 INFO L225 Difference]: With dead ends: 181 [2024-11-19 00:38:12,018 INFO L226 Difference]: Without dead ends: 90 [2024-11-19 00:38:12,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:38:12,023 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:12,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:38:12,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-19 00:38:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-19 00:38:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 73 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:38:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-11-19 00:38:12,064 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 119 [2024-11-19 00:38:12,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:12,065 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-11-19 00:38:12,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 00:38:12,065 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-11-19 00:38:12,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 00:38:12,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:12,070 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:12,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:38:12,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:38:12,271 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:12,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:12,271 INFO L85 PathProgramCache]: Analyzing trace with hash -392504257, now seen corresponding path program 1 times [2024-11-19 00:38:12,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:38:12,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419578561] [2024-11-19 00:38:12,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:12,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:38:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:12,729 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-19 00:38:12,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:38:12,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419578561] [2024-11-19 00:38:12,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419578561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:38:12,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130913807] [2024-11-19 00:38:12,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:12,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:38:12,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:38:12,732 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:38:12,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:38:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:12,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:38:12,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:12,972 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:38:12,972 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:12,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130913807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:12,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:38:12,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-19 00:38:12,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14716127] [2024-11-19 00:38:12,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:12,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:38:12,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:38:12,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:38:12,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:38:12,975 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:13,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:13,018 INFO L93 Difference]: Finished difference Result 179 states and 264 transitions. [2024-11-19 00:38:13,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:38:13,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-11-19 00:38:13,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:13,022 INFO L225 Difference]: With dead ends: 179 [2024-11-19 00:38:13,023 INFO L226 Difference]: Without dead ends: 92 [2024-11-19 00:38:13,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:38:13,024 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:13,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 379 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:38:13,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-19 00:38:13,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-19 00:38:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:38:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-19 00:38:13,042 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 119 [2024-11-19 00:38:13,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:13,044 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-19 00:38:13,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:13,044 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-19 00:38:13,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 00:38:13,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:13,046 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:13,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:38:13,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-19 00:38:13,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:13,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:13,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2143453626, now seen corresponding path program 1 times [2024-11-19 00:38:13,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:38:13,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53610594] [2024-11-19 00:38:13,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:13,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:38:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:38:13,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [441306325] [2024-11-19 00:38:13,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:13,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:38:13,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:38:13,430 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:38:13,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 00:38:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:13,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 00:38:13,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:13,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 00:38:13,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 00:38:13,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 00:38:14,025 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:38:14,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:14,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:38:14,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53610594] [2024-11-19 00:38:14,026 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 00:38:14,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441306325] [2024-11-19 00:38:14,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441306325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:14,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:14,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:38:14,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684835021] [2024-11-19 00:38:14,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:14,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:38:14,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:38:14,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:38:14,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:38:14,032 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:14,280 INFO L93 Difference]: Finished difference Result 247 states and 359 transitions. [2024-11-19 00:38:14,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:38:14,281 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-19 00:38:14,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:14,283 INFO L225 Difference]: With dead ends: 247 [2024-11-19 00:38:14,283 INFO L226 Difference]: Without dead ends: 158 [2024-11-19 00:38:14,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:38:14,284 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 83 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:14,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 727 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:38:14,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-19 00:38:14,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2024-11-19 00:38:14,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 130 states have (on average 1.3923076923076922) internal successors, (181), 131 states have internal predecessors, (181), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:38:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 225 transitions. [2024-11-19 00:38:14,303 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 225 transitions. Word has length 121 [2024-11-19 00:38:14,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:14,303 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 225 transitions. [2024-11-19 00:38:14,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:14,303 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 225 transitions. [2024-11-19 00:38:14,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 00:38:14,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:14,305 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:14,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 00:38:14,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:38:14,506 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:14,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:14,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1556647612, now seen corresponding path program 1 times [2024-11-19 00:38:14,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:38:14,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014716882] [2024-11-19 00:38:14,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:14,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:38:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:15,146 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:38:15,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:38:15,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014716882] [2024-11-19 00:38:15,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014716882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:15,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:15,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:38:15,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787434877] [2024-11-19 00:38:15,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:15,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:38:15,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:38:15,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:38:15,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:38:15,148 INFO L87 Difference]: Start difference. First operand 155 states and 225 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:15,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:15,484 INFO L93 Difference]: Finished difference Result 507 states and 735 transitions. [2024-11-19 00:38:15,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:38:15,485 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-19 00:38:15,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:15,488 INFO L225 Difference]: With dead ends: 507 [2024-11-19 00:38:15,488 INFO L226 Difference]: Without dead ends: 355 [2024-11-19 00:38:15,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:38:15,489 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 193 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:15,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 756 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:38:15,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-19 00:38:15,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 349. [2024-11-19 00:38:15,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 294 states have (on average 1.3911564625850341) internal successors, (409), 298 states have internal predecessors, (409), 49 states have call successors, (49), 5 states have call predecessors, (49), 5 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-19 00:38:15,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 507 transitions. [2024-11-19 00:38:15,514 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 507 transitions. Word has length 121 [2024-11-19 00:38:15,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:15,515 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 507 transitions. [2024-11-19 00:38:15,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:15,515 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 507 transitions. [2024-11-19 00:38:15,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 00:38:15,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:15,517 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:15,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:38:15,517 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:15,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:15,517 INFO L85 PathProgramCache]: Analyzing trace with hash 454509884, now seen corresponding path program 1 times [2024-11-19 00:38:15,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:38:15,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308451267] [2024-11-19 00:38:15,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:15,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:38:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:15,769 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:38:15,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:38:15,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308451267] [2024-11-19 00:38:15,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308451267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:15,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:15,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:38:15,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229109473] [2024-11-19 00:38:15,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:15,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:38:15,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:38:15,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:38:15,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:38:15,772 INFO L87 Difference]: Start difference. First operand 349 states and 507 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:16,014 INFO L93 Difference]: Finished difference Result 767 states and 1111 transitions. [2024-11-19 00:38:16,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:38:16,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-19 00:38:16,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:16,018 INFO L225 Difference]: With dead ends: 767 [2024-11-19 00:38:16,019 INFO L226 Difference]: Without dead ends: 421 [2024-11-19 00:38:16,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:38:16,020 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 90 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:16,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 749 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:38:16,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-19 00:38:16,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 360. [2024-11-19 00:38:16,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 304 states have (on average 1.388157894736842) internal successors, (422), 308 states have internal predecessors, (422), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-19 00:38:16,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 520 transitions. [2024-11-19 00:38:16,050 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 520 transitions. Word has length 121 [2024-11-19 00:38:16,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:16,051 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 520 transitions. [2024-11-19 00:38:16,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:16,051 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 520 transitions. [2024-11-19 00:38:16,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 00:38:16,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:16,052 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:16,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:38:16,053 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:16,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:16,053 INFO L85 PathProgramCache]: Analyzing trace with hash -132296130, now seen corresponding path program 1 times [2024-11-19 00:38:16,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:38:16,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255186189] [2024-11-19 00:38:16,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:16,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:38:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:38:16,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1082425546] [2024-11-19 00:38:16,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:16,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:38:16,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:38:16,110 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:38:16,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 00:38:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:16,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 00:38:16,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:16,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:16,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 19 [2024-11-19 00:38:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:38:16,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:16,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:38:16,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255186189] [2024-11-19 00:38:16,498 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 00:38:16,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082425546] [2024-11-19 00:38:16,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082425546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:16,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:16,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:38:16,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921997368] [2024-11-19 00:38:16,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:16,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:38:16,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:38:16,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:38:16,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:38:16,499 INFO L87 Difference]: Start difference. First operand 360 states and 520 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:16,737 INFO L93 Difference]: Finished difference Result 831 states and 1198 transitions. [2024-11-19 00:38:16,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:38:16,738 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-19 00:38:16,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:16,740 INFO L225 Difference]: With dead ends: 831 [2024-11-19 00:38:16,740 INFO L226 Difference]: Without dead ends: 474 [2024-11-19 00:38:16,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:38:16,742 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 77 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:16,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 909 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:38:16,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-19 00:38:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 421. [2024-11-19 00:38:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 357 states have (on average 1.3865546218487395) internal successors, (495), 362 states have internal predecessors, (495), 56 states have call successors, (56), 7 states have call predecessors, (56), 7 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-19 00:38:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 607 transitions. [2024-11-19 00:38:16,769 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 607 transitions. Word has length 121 [2024-11-19 00:38:16,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:16,769 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 607 transitions. [2024-11-19 00:38:16,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:16,770 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 607 transitions. [2024-11-19 00:38:16,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 00:38:16,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:16,771 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:16,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 00:38:16,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:38:16,972 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:16,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:16,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1337792894, now seen corresponding path program 1 times [2024-11-19 00:38:16,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:38:16,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449204113] [2024-11-19 00:38:16,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:16,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:38:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:38:17,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:38:17,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449204113] [2024-11-19 00:38:17,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449204113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:17,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:17,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:38:17,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350803233] [2024-11-19 00:38:17,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:17,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:38:17,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:38:17,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:38:17,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:38:17,322 INFO L87 Difference]: Start difference. First operand 421 states and 607 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:17,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:17,679 INFO L93 Difference]: Finished difference Result 1091 states and 1561 transitions. [2024-11-19 00:38:17,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:38:17,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-19 00:38:17,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:17,683 INFO L225 Difference]: With dead ends: 1091 [2024-11-19 00:38:17,683 INFO L226 Difference]: Without dead ends: 673 [2024-11-19 00:38:17,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:38:17,687 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 200 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:17,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 670 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:38:17,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-11-19 00:38:17,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 301. [2024-11-19 00:38:17,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 254 states have (on average 1.3818897637795275) internal successors, (351), 257 states have internal predecessors, (351), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 00:38:17,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 431 transitions. [2024-11-19 00:38:17,714 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 431 transitions. Word has length 121 [2024-11-19 00:38:17,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:17,715 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 431 transitions. [2024-11-19 00:38:17,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:17,715 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 431 transitions. [2024-11-19 00:38:17,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 00:38:17,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:17,716 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:17,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:38:17,716 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:17,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:17,717 INFO L85 PathProgramCache]: Analyzing trace with hash 224505005, now seen corresponding path program 1 times [2024-11-19 00:38:17,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:38:17,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632144476] [2024-11-19 00:38:17,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:17,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:38:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:18,019 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:38:18,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:38:18,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632144476] [2024-11-19 00:38:18,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632144476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:18,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:18,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:38:18,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627501532] [2024-11-19 00:38:18,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:18,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:38:18,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:38:18,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:38:18,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:38:18,021 INFO L87 Difference]: Start difference. First operand 301 states and 431 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:18,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:18,170 INFO L93 Difference]: Finished difference Result 672 states and 958 transitions. [2024-11-19 00:38:18,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:38:18,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-11-19 00:38:18,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:18,173 INFO L225 Difference]: With dead ends: 672 [2024-11-19 00:38:18,173 INFO L226 Difference]: Without dead ends: 374 [2024-11-19 00:38:18,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:38:18,174 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 109 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:18,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 988 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:38:18,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-19 00:38:18,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 305. [2024-11-19 00:38:18,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 255 states have (on average 1.3725490196078431) internal successors, (350), 258 states have internal predecessors, (350), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-19 00:38:18,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 434 transitions. [2024-11-19 00:38:18,211 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 434 transitions. Word has length 122 [2024-11-19 00:38:18,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:18,212 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 434 transitions. [2024-11-19 00:38:18,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:18,212 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 434 transitions. [2024-11-19 00:38:18,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 00:38:18,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:18,213 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:18,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:38:18,214 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:18,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:18,214 INFO L85 PathProgramCache]: Analyzing trace with hash -178316306, now seen corresponding path program 1 times [2024-11-19 00:38:18,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:38:18,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889728424] [2024-11-19 00:38:18,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:18,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:38:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:38:18,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:38:18,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889728424] [2024-11-19 00:38:18,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889728424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:18,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:18,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:38:18,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337904470] [2024-11-19 00:38:18,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:18,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:38:18,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:38:18,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:38:18,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:38:18,520 INFO L87 Difference]: Start difference. First operand 305 states and 434 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:18,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:18,635 INFO L93 Difference]: Finished difference Result 858 states and 1221 transitions. [2024-11-19 00:38:18,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:38:18,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-11-19 00:38:18,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:18,638 INFO L225 Difference]: With dead ends: 858 [2024-11-19 00:38:18,638 INFO L226 Difference]: Without dead ends: 556 [2024-11-19 00:38:18,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:38:18,639 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 76 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:18,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 674 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:38:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-19 00:38:18,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 550. [2024-11-19 00:38:18,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 476 states have (on average 1.3802521008403361) internal successors, (657), 483 states have internal predecessors, (657), 62 states have call successors, (62), 11 states have call predecessors, (62), 11 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-19 00:38:18,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 781 transitions. [2024-11-19 00:38:18,678 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 781 transitions. Word has length 122 [2024-11-19 00:38:18,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:18,679 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 781 transitions. [2024-11-19 00:38:18,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:18,679 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 781 transitions. [2024-11-19 00:38:18,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 00:38:18,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:18,680 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:18,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:38:18,680 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:18,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:18,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1961000661, now seen corresponding path program 1 times [2024-11-19 00:38:18,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:38:18,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466566064] [2024-11-19 00:38:18,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:18,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:38:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:38:18,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [899331943] [2024-11-19 00:38:18,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:18,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:38:18,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:38:18,738 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:38:18,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 00:38:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:19,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-19 00:38:19,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:19,073 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 9 treesize of output 3 [2024-11-19 00:38:19,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 3 [2024-11-19 00:38:19,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:38:19,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 00:38:19,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 00:38:19,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 00:38:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:38:19,239 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:19,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:38:19,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466566064] [2024-11-19 00:38:19,240 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 00:38:19,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899331943] [2024-11-19 00:38:19,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899331943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:19,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:19,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:38:19,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989483889] [2024-11-19 00:38:19,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:19,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:38:19,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:38:19,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:38:19,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:38:19,241 INFO L87 Difference]: Start difference. First operand 550 states and 781 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:19,649 INFO L93 Difference]: Finished difference Result 1351 states and 1916 transitions. [2024-11-19 00:38:19,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:38:19,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-19 00:38:19,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:19,655 INFO L225 Difference]: With dead ends: 1351 [2024-11-19 00:38:19,655 INFO L226 Difference]: Without dead ends: 804 [2024-11-19 00:38:19,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:38:19,657 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 86 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:19,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 609 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:38:19,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-11-19 00:38:19,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 518. [2024-11-19 00:38:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 460 states have (on average 1.391304347826087) internal successors, (640), 465 states have internal predecessors, (640), 48 states have call successors, (48), 9 states have call predecessors, (48), 9 states have return successors, (48), 43 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 00:38:19,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 736 transitions. [2024-11-19 00:38:19,704 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 736 transitions. Word has length 125 [2024-11-19 00:38:19,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:19,705 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 736 transitions. [2024-11-19 00:38:19,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:19,705 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 736 transitions. [2024-11-19 00:38:19,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 00:38:19,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:19,706 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:19,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 00:38:19,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 00:38:19,907 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:19,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:19,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1702835223, now seen corresponding path program 1 times [2024-11-19 00:38:19,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:38:19,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151871497] [2024-11-19 00:38:19,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:19,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:38:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:38:19,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1202461953] [2024-11-19 00:38:19,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:19,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:38:19,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:38:19,999 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:38:20,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 00:38:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:38:20,268 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:38:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:38:20,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:38:20,690 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:38:20,691 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:38:20,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 00:38:20,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:38:20,896 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:20,961 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:38:20,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:38:20 BoogieIcfgContainer [2024-11-19 00:38:20,963 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:38:20,964 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:38:20,964 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:38:20,964 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:38:20,968 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:38:11" (3/4) ... [2024-11-19 00:38:20,970 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:38:20,970 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:38:20,971 INFO L158 Benchmark]: Toolchain (without parser) took 10739.51ms. Allocated memory was 218.1MB in the beginning and 434.1MB in the end (delta: 216.0MB). Free memory was 146.4MB in the beginning and 357.1MB in the end (delta: -210.7MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2024-11-19 00:38:20,971 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 218.1MB. Free memory is still 176.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:38:20,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.29ms. Allocated memory is still 218.1MB. Free memory was 146.2MB in the beginning and 129.7MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 00:38:20,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.42ms. Allocated memory is still 218.1MB. Free memory was 129.7MB in the beginning and 186.7MB in the end (delta: -57.0MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2024-11-19 00:38:20,976 INFO L158 Benchmark]: Boogie Preprocessor took 171.90ms. Allocated memory is still 218.1MB. Free memory was 186.7MB in the beginning and 181.9MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:38:20,976 INFO L158 Benchmark]: RCFGBuilder took 671.59ms. Allocated memory is still 218.1MB. Free memory was 181.9MB in the beginning and 147.3MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-19 00:38:20,976 INFO L158 Benchmark]: TraceAbstraction took 9542.41ms. Allocated memory was 218.1MB in the beginning and 434.1MB in the end (delta: 216.0MB). Free memory was 146.3MB in the beginning and 358.2MB in the end (delta: -211.9MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2024-11-19 00:38:20,976 INFO L158 Benchmark]: Witness Printer took 6.98ms. Allocated memory is still 434.1MB. Free memory was 358.2MB in the beginning and 357.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:38:20,977 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.12ms. Allocated memory is still 218.1MB. Free memory is still 176.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.29ms. Allocated memory is still 218.1MB. Free memory was 146.2MB in the beginning and 129.7MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.42ms. Allocated memory is still 218.1MB. Free memory was 129.7MB in the beginning and 186.7MB in the end (delta: -57.0MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 171.90ms. Allocated memory is still 218.1MB. Free memory was 186.7MB in the beginning and 181.9MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 671.59ms. Allocated memory is still 218.1MB. Free memory was 181.9MB in the beginning and 147.3MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9542.41ms. Allocated memory was 218.1MB in the beginning and 434.1MB in the end (delta: 216.0MB). Free memory was 146.3MB in the beginning and 358.2MB in the end (delta: -211.9MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Witness Printer took 6.98ms. Allocated memory is still 434.1MB. Free memory was 358.2MB in the beginning and 357.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2] = { 15.5, 4.625 }; [L25-L27] double double_Array_0[2] = { 15.5, 4.625 }; [L25-L27] double double_Array_0[2] = { 15.5, 4.625 }; [L28-L30] signed char signed_char_Array_0[2] = { -8, -64 }; [L28-L30] signed char signed_char_Array_0[2] = { -8, -64 }; [L28-L30] signed char signed_char_Array_0[2] = { -8, -64 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -100 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -100 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] FCALL updateLastVariables() [L114] CALL updateVariables() [L79] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L80] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] 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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] 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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] 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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] 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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L83] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] 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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] 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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] 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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] 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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] double_Array_0[0] = __VERIFIER_nondet_double() [L86] EXPR double_Array_0[0] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L86] EXPR double_Array_0[0] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L88] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] unsigned_long_int_Array_0[0][0] = __VERIFIER_nondet_ulong() [L91] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] unsigned_long_int_Array_0[1][0] = __VERIFIER_nondet_ulong() [L94] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L96] unsigned_long_int_Array_0[0][1] = __VERIFIER_nondet_ulong() [L97] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L99] unsigned_long_int_Array_0[1][1] = __VERIFIER_nondet_ulong() [L100] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L100] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L100] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L114] RET updateVariables() [L115] CALL step() [L40] EXPR unsigned_long_int_Array_0[1][1] [L40] EXPR unsigned_long_int_Array_0[1][0] [L40] EXPR unsigned_long_int_Array_0[0][0] [L40] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L40] EXPR (((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]) [L40] EXPR unsigned_long_int_Array_0[0][1] [L40] EXPR (((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L40] COND TRUE unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]))) [L41] EXPR signed_char_Array_0[0] [L41] signed_char_Array_0[1] = signed_char_Array_0[0] [L53] EXPR unsigned_long_int_Array_0[0][0] [L53] unsigned long int stepLocal_1 = unsigned_long_int_Array_0[0][0]; [L54] EXPR unsigned_long_int_Array_0[1][1] [L54] EXPR unsigned_long_int_Array_0[0][1] [L54] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L54] EXPR ((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) [L54] EXPR unsigned_long_int_Array_0[0][1] [L54] EXPR ((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_1=499, unsigned_long_int_Array_0={8:0}] [L54] unsigned long int stepLocal_0 = unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]))); [L55] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L55] COND FALSE !(stepLocal_0 < unsigned_long_int_Array_0[0][0]) [L62] EXPR BOOL_unsigned_char_Array_0[0] [L62] unsigned char stepLocal_3 = BOOL_unsigned_char_Array_0[0]; [L63] EXPR signed_short_int_Array_0[0] [L63] EXPR signed_char_Array_0[1] [L63] signed long int stepLocal_2 = signed_short_int_Array_0[0] + signed_char_Array_0[1]; [L64] EXPR signed_char_Array_0[1] [L64] EXPR signed_char_Array_0[0] [L64] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L64] COND FALSE !(((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && stepLocal_3) [L75] EXPR double_Array_0[0] [L75] double_Array_0[1] = double_Array_0[0] [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR unsigned_long_int_Array_0[1][1] [L106] EXPR unsigned_long_int_Array_0[0][1] [L106] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) [L106] EXPR unsigned_long_int_Array_0[0][1] [L106] EXPR ((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1 [L106] EXPR ((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4))))) [L106] EXPR unsigned_long_int_Array_0[1][1] [L106] EXPR unsigned_long_int_Array_0[1][0] [L106] EXPR unsigned_long_int_Array_0[0][0] [L106] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]) [L106] EXPR unsigned_long_int_Array_0[0][1] [L106] EXPR (((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))) [L106] EXPR signed_char_Array_0[1] [L106] EXPR signed_char_Array_0[0] [L106] EXPR (unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))))) && ((((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))))) && ((((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) [L106] EXPR signed_char_Array_0[1] [L106] EXPR signed_char_Array_0[0] [L106] EXPR unsigned_long_int_Array_0[1][0] [L106] EXPR ((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0] [L106] EXPR BOOL_unsigned_char_Array_0[0] [L106] EXPR ((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0])) [L106] EXPR double_Array_0[1] [L106] EXPR double_Array_0[0] [L106] EXPR (((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))))) && ((((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106-L107] return ((((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))))) && ((((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 914 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 914 mSDsluCounter, 6593 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5040 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1619 IncrementalHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 1553 mSDtfsCounter, 1619 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 656 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=550occurred in iteration=9, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 856 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2067 NumberOfCodeBlocks, 2067 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1438 ConstructedInterpolants, 0 QuantifiedInterpolants, 3182 SizeOfPredicates, 16 NumberOfNonLiveVariables, 2154 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 4970/5040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 00:38:21,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.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 06557c270490180718c8b17df780a67c95f9f8a79364859de2d5e3b0ea99ce3e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:38:23,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:38:23,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:38:23,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:38:23,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:38:23,217 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:38:23,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:38:23,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:38:23,220 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:38:23,223 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:38:23,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:38:23,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:38:23,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:38:23,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:38:23,224 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:38:23,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:38:23,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:38:23,225 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:38:23,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:38:23,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:38:23,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:38:23,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:38:23,226 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:38:23,226 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:38:23,227 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:38:23,227 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:38:23,227 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:38:23,227 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:38:23,227 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:38:23,227 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:38:23,227 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:38:23,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:38:23,228 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:38:23,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:38:23,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:38:23,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:38:23,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:38:23,229 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:38:23,229 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:38:23,229 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:38:23,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:38:23,232 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:38:23,232 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:38:23,232 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:38:23,232 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 -> 06557c270490180718c8b17df780a67c95f9f8a79364859de2d5e3b0ea99ce3e [2024-11-19 00:38:23,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:38:23,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:38:23,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:38:23,551 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:38:23,552 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:38:23,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i [2024-11-19 00:38:25,168 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:38:25,393 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:38:25,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i [2024-11-19 00:38:25,406 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b7c5de2d/258f27a9c07c4dd99510d656fbd4e606/FLAG1eeed34b7 [2024-11-19 00:38:25,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b7c5de2d/258f27a9c07c4dd99510d656fbd4e606 [2024-11-19 00:38:25,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:38:25,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:38:25,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:38:25,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:38:25,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:38:25,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:38:25" (1/1) ... [2024-11-19 00:38:25,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c4bf0cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:25, skipping insertion in model container [2024-11-19 00:38:25,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:38:25" (1/1) ... [2024-11-19 00:38:25,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:38:25,596 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i[916,929] [2024-11-19 00:38:25,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:38:25,704 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:38:25,715 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i[916,929] [2024-11-19 00:38:25,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:38:25,786 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:38:25,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:25 WrapperNode [2024-11-19 00:38:25,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:38:25,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:38:25,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:38:25,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:38:25,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:25" (1/1) ... [2024-11-19 00:38:25,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:25" (1/1) ... [2024-11-19 00:38:25,864 INFO L138 Inliner]: procedures = 36, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2024-11-19 00:38:25,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:38:25,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:38:25,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:38:25,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:38:25,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:25" (1/1) ... [2024-11-19 00:38:25,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:25" (1/1) ... [2024-11-19 00:38:25,884 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:25" (1/1) ... [2024-11-19 00:38:25,917 INFO L175 MemorySlicer]: Split 131 memory accesses to 6 slices as follows [2, 16, 23, 31, 7, 52]. 40 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 2, 2, 2, 1, 4]. The 18 writes are split as follows [0, 2, 5, 5, 2, 4]. [2024-11-19 00:38:25,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:25" (1/1) ... [2024-11-19 00:38:25,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:25" (1/1) ... [2024-11-19 00:38:25,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:25" (1/1) ... [2024-11-19 00:38:25,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:25" (1/1) ... [2024-11-19 00:38:25,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:25" (1/1) ... [2024-11-19 00:38:25,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:25" (1/1) ... [2024-11-19 00:38:25,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:38:25,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:38:25,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:38:25,976 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:38:25,977 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:25" (1/1) ... [2024-11-19 00:38:25,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:38:25,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:38:26,007 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:38:26,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:38:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:38:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 00:38:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 00:38:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-19 00:38:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-19 00:38:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-19 00:38:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-19 00:38:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 00:38:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 00:38:26,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-19 00:38:26,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-19 00:38:26,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-19 00:38:26,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-19 00:38:26,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:38:26,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:38:26,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:38:26,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:38:26,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 00:38:26,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-19 00:38:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-19 00:38:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-19 00:38:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-19 00:38:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-19 00:38:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-19 00:38:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-19 00:38:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:38:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:38:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:38:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:38:26,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 00:38:26,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-19 00:38:26,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 00:38:26,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 00:38:26,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 00:38:26,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 00:38:26,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 00:38:26,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-19 00:38:26,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-19 00:38:26,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-19 00:38:26,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-19 00:38:26,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-19 00:38:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-19 00:38:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-19 00:38:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 00:38:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 00:38:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 00:38:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 00:38:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-19 00:38:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-19 00:38:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 00:38:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 00:38:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-19 00:38:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-19 00:38:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-19 00:38:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-19 00:38:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:38:26,060 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:38:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:38:26,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:38:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:38:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:38:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:38:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:38:26,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 00:38:26,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-19 00:38:26,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 00:38:26,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 00:38:26,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-19 00:38:26,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-19 00:38:26,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-19 00:38:26,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-19 00:38:26,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 00:38:26,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 00:38:26,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 00:38:26,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 00:38:26,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-19 00:38:26,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-19 00:38:26,228 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:38:26,230 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:38:26,839 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-19 00:38:26,839 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:38:26,854 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:38:26,854 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:38:26,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:38:26 BoogieIcfgContainer [2024-11-19 00:38:26,855 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:38:26,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:38:26,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:38:26,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:38:26,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:38:25" (1/3) ... [2024-11-19 00:38:26,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74051f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:38:26, skipping insertion in model container [2024-11-19 00:38:26,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:25" (2/3) ... [2024-11-19 00:38:26,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74051f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:38:26, skipping insertion in model container [2024-11-19 00:38:26,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:38:26" (3/3) ... [2024-11-19 00:38:26,864 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-69.i [2024-11-19 00:38:26,877 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:38:26,877 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:38:26,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:38:26,924 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;@6118cc26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:38:26,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:38:26,930 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:38:26,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 00:38:26,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:26,940 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:26,943 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:26,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:26,947 INFO L85 PathProgramCache]: Analyzing trace with hash 849212081, now seen corresponding path program 1 times [2024-11-19 00:38:26,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:26,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521849299] [2024-11-19 00:38:26,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:26,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:26,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:26,964 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:38:26,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 00:38:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:27,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:38:27,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-19 00:38:27,312 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:27,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:27,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521849299] [2024-11-19 00:38:27,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521849299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:27,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:27,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:38:27,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637287565] [2024-11-19 00:38:27,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:27,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:38:27,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:27,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:38:27,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:38:27,342 INFO L87 Difference]: Start difference. First operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 00:38:27,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:27,373 INFO L93 Difference]: Finished difference Result 181 states and 287 transitions. [2024-11-19 00:38:27,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:38:27,377 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2024-11-19 00:38:27,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:27,384 INFO L225 Difference]: With dead ends: 181 [2024-11-19 00:38:27,385 INFO L226 Difference]: Without dead ends: 90 [2024-11-19 00:38:27,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:38:27,391 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:27,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:38:27,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-19 00:38:27,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-19 00:38:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 73 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:38:27,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-11-19 00:38:27,456 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 119 [2024-11-19 00:38:27,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:27,456 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-11-19 00:38:27,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 00:38:27,457 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-11-19 00:38:27,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 00:38:27,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:27,462 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:27,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 00:38:27,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:27,667 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:27,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:27,668 INFO L85 PathProgramCache]: Analyzing trace with hash -392504257, now seen corresponding path program 1 times [2024-11-19 00:38:27,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:27,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375335761] [2024-11-19 00:38:27,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:27,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:27,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:27,672 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:38:27,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 00:38:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:27,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:38:27,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:27,986 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:38:27,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:27,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:27,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375335761] [2024-11-19 00:38:27,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1375335761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:27,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:27,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:38:27,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542955703] [2024-11-19 00:38:27,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:27,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:38:27,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:27,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:38:27,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:38:27,992 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:28,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:28,041 INFO L93 Difference]: Finished difference Result 179 states and 264 transitions. [2024-11-19 00:38:28,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:38:28,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-11-19 00:38:28,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:28,046 INFO L225 Difference]: With dead ends: 179 [2024-11-19 00:38:28,046 INFO L226 Difference]: Without dead ends: 92 [2024-11-19 00:38:28,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 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-11-19 00:38:28,048 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:28,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 379 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:38:28,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-19 00:38:28,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-19 00:38:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:38:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-19 00:38:28,063 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 119 [2024-11-19 00:38:28,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:28,066 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-19 00:38:28,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:28,066 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-19 00:38:28,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 00:38:28,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:28,069 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:28,086 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-11-19 00:38:28,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:28,270 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:28,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:28,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2143453626, now seen corresponding path program 1 times [2024-11-19 00:38:28,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:28,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080933646] [2024-11-19 00:38:28,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:28,271 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:28,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:28,282 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:38:28,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 00:38:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:28,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 00:38:28,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:29,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:29,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 16 [2024-11-19 00:38:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:38:29,355 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:29,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:29,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080933646] [2024-11-19 00:38:29,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080933646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:29,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:29,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:38:29,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777047716] [2024-11-19 00:38:29,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:29,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:38:29,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:29,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:38:29,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:38:29,358 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:30,879 INFO L93 Difference]: Finished difference Result 247 states and 359 transitions. [2024-11-19 00:38:30,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:38:30,883 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-19 00:38:30,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:30,885 INFO L225 Difference]: With dead ends: 247 [2024-11-19 00:38:30,885 INFO L226 Difference]: Without dead ends: 158 [2024-11-19 00:38:30,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:38:30,886 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 85 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:30,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 755 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 00:38:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-19 00:38:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2024-11-19 00:38:30,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 130 states have (on average 1.3923076923076922) internal successors, (181), 131 states have internal predecessors, (181), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:38:30,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 225 transitions. [2024-11-19 00:38:30,908 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 225 transitions. Word has length 121 [2024-11-19 00:38:30,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:30,913 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 225 transitions. [2024-11-19 00:38:30,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 225 transitions. [2024-11-19 00:38:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 00:38:30,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:30,914 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:30,925 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 (4)] Ended with exit code 0 [2024-11-19 00:38:31,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:31,115 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:31,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:31,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1556647612, now seen corresponding path program 1 times [2024-11-19 00:38:31,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:31,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620946789] [2024-11-19 00:38:31,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:31,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:31,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:31,122 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:38:31,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 00:38:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:31,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:38:31,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:31,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:31,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2024-11-19 00:38:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:38:31,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:31,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:31,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620946789] [2024-11-19 00:38:31,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620946789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:31,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:31,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:38:31,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554543855] [2024-11-19 00:38:31,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:31,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:38:31,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:31,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:38:31,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:38:31,470 INFO L87 Difference]: Start difference. First operand 155 states and 225 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:31,845 INFO L93 Difference]: Finished difference Result 368 states and 534 transitions. [2024-11-19 00:38:31,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:38:31,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-19 00:38:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:31,848 INFO L225 Difference]: With dead ends: 368 [2024-11-19 00:38:31,849 INFO L226 Difference]: Without dead ends: 216 [2024-11-19 00:38:31,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 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-11-19 00:38:31,850 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 92 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:31,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 484 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:38:31,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-19 00:38:31,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 213. [2024-11-19 00:38:31,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 178 states have (on average 1.3820224719101124) internal successors, (246), 180 states have internal predecessors, (246), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-19 00:38:31,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 308 transitions. [2024-11-19 00:38:31,866 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 308 transitions. Word has length 121 [2024-11-19 00:38:31,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:31,866 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 308 transitions. [2024-11-19 00:38:31,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:31,866 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 308 transitions. [2024-11-19 00:38:31,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 00:38:31,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:31,868 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:31,878 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 (5)] Ended with exit code 0 [2024-11-19 00:38:32,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:32,069 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:32,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:32,069 INFO L85 PathProgramCache]: Analyzing trace with hash 454509884, now seen corresponding path program 1 times [2024-11-19 00:38:32,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:32,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424334476] [2024-11-19 00:38:32,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:32,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:32,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:32,072 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:38:32,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 00:38:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:32,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:38:32,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:32,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:32,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 11 [2024-11-19 00:38:32,367 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:38:32,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:32,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:32,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424334476] [2024-11-19 00:38:32,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424334476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:32,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:32,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:38:32,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510860896] [2024-11-19 00:38:32,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:32,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:38:32,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:32,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:38:32,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:38:32,369 INFO L87 Difference]: Start difference. First operand 213 states and 308 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:32,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:32,782 INFO L93 Difference]: Finished difference Result 430 states and 618 transitions. [2024-11-19 00:38:32,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:38:32,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-19 00:38:32,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:32,786 INFO L225 Difference]: With dead ends: 430 [2024-11-19 00:38:32,786 INFO L226 Difference]: Without dead ends: 220 [2024-11-19 00:38:32,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:38:32,787 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 90 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:32,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 612 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:38:32,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-19 00:38:32,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 160. [2024-11-19 00:38:32,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 134 states have (on average 1.373134328358209) internal successors, (184), 135 states have internal predecessors, (184), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:38:32,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 228 transitions. [2024-11-19 00:38:32,797 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 228 transitions. Word has length 121 [2024-11-19 00:38:32,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:32,797 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 228 transitions. [2024-11-19 00:38:32,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:32,797 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 228 transitions. [2024-11-19 00:38:32,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 00:38:32,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:32,804 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:32,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 00:38:33,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:33,005 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:33,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:33,005 INFO L85 PathProgramCache]: Analyzing trace with hash -132296130, now seen corresponding path program 1 times [2024-11-19 00:38:33,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:33,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484156213] [2024-11-19 00:38:33,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:33,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:33,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:33,011 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:38:33,015 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 (7)] Waiting until timeout for monitored process [2024-11-19 00:38:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:33,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 00:38:33,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:33,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:33,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 16 [2024-11-19 00:38:33,983 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:38:33,983 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:33,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:33,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484156213] [2024-11-19 00:38:33,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484156213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:33,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:33,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:38:33,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031681819] [2024-11-19 00:38:33,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:33,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:38:33,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:33,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:38:33,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:38:33,985 INFO L87 Difference]: Start difference. First operand 160 states and 228 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:35,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:35,638 INFO L93 Difference]: Finished difference Result 375 states and 534 transitions. [2024-11-19 00:38:35,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:38:35,643 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-19 00:38:35,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:35,645 INFO L225 Difference]: With dead ends: 375 [2024-11-19 00:38:35,645 INFO L226 Difference]: Without dead ends: 218 [2024-11-19 00:38:35,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:38:35,646 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 78 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:35,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1014 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 00:38:35,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-19 00:38:35,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 166. [2024-11-19 00:38:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.3785714285714286) internal successors, (193), 141 states have internal predecessors, (193), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:38:35,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 237 transitions. [2024-11-19 00:38:35,672 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 237 transitions. Word has length 121 [2024-11-19 00:38:35,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:35,672 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 237 transitions. [2024-11-19 00:38:35,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:35,673 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 237 transitions. [2024-11-19 00:38:35,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 00:38:35,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:35,674 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:35,692 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 (7)] Ended with exit code 0 [2024-11-19 00:38:35,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:35,883 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:35,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:35,884 INFO L85 PathProgramCache]: Analyzing trace with hash 224505005, now seen corresponding path program 1 times [2024-11-19 00:38:35,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:35,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235616644] [2024-11-19 00:38:35,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:35,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:35,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:35,888 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:38:35,889 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 (8)] Waiting until timeout for monitored process [2024-11-19 00:38:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:36,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 00:38:36,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:36,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-19 00:38:36,154 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 63 treesize of output 51 [2024-11-19 00:38:36,189 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:38:36,189 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:36,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:36,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235616644] [2024-11-19 00:38:36,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235616644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:36,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:36,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:38:36,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187187001] [2024-11-19 00:38:36,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:36,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:38:36,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:36,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:38:36,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:38:36,191 INFO L87 Difference]: Start difference. First operand 166 states and 237 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:36,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:36,457 INFO L93 Difference]: Finished difference Result 382 states and 544 transitions. [2024-11-19 00:38:36,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:38:36,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-11-19 00:38:36,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:36,461 INFO L225 Difference]: With dead ends: 382 [2024-11-19 00:38:36,461 INFO L226 Difference]: Without dead ends: 219 [2024-11-19 00:38:36,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:38:36,462 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 109 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:36,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 988 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:38:36,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-19 00:38:36,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 164. [2024-11-19 00:38:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 139 states have internal predecessors, (190), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:38:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 234 transitions. [2024-11-19 00:38:36,477 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 234 transitions. Word has length 122 [2024-11-19 00:38:36,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:36,477 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 234 transitions. [2024-11-19 00:38:36,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:38:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 234 transitions. [2024-11-19 00:38:36,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 00:38:36,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:36,479 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:36,488 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 (8)] Ended with exit code 0 [2024-11-19 00:38:36,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:36,684 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:36,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:36,684 INFO L85 PathProgramCache]: Analyzing trace with hash -178316306, now seen corresponding path program 1 times [2024-11-19 00:38:36,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:36,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641571718] [2024-11-19 00:38:36,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:36,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:36,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:36,686 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:38:36,688 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 (9)] Waiting until timeout for monitored process