./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd --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 944d6be29b18a7b057c10d85533dd285a58675394c7ffcf3e8926ec3db51ce25 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:44:10,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:44:10,432 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 12:44:10,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:44:10,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:44:10,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:44:10,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:44:10,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:44:10,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:44:10,477 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:44:10,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:44:10,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:44:10,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:44:10,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:44:10,481 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:44:10,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:44:10,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:44:10,481 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:44:10,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:44:10,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:44:10,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:44:10,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:44:10,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:44:10,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:44:10,482 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:44:10,482 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:44:10,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:44:10,482 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:44:10,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:44:10,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:44:10,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:44:10,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:44:10,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:44:10,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:44:10,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:44:10,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:44:10,484 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:44:10,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:44:10,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:44:10,485 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:44:10,485 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:44:10,485 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:44:10,485 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd 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 -> 944d6be29b18a7b057c10d85533dd285a58675394c7ffcf3e8926ec3db51ce25 [2024-11-13 12:44:10,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:44:10,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:44:10,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:44:10,847 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:44:10,848 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:44:10,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i Unable to find full path for "g++" [2024-11-13 12:44:12,748 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:44:13,083 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:44:13,084 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i [2024-11-13 12:44:13,093 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/data/9c61277aa/9d778fee1bd242f780f09aaca7bf55b7/FLAGec9d9059c [2024-11-13 12:44:13,108 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/data/9c61277aa/9d778fee1bd242f780f09aaca7bf55b7 [2024-11-13 12:44:13,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:44:13,112 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:44:13,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:44:13,113 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:44:13,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:44:13,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:44:13" (1/1) ... [2024-11-13 12:44:13,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a9f91d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:13, skipping insertion in model container [2024-11-13 12:44:13,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:44:13" (1/1) ... [2024-11-13 12:44:13,144 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:44:13,311 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i[916,929] [2024-11-13 12:44:13,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:44:13,396 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:44:13,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i[916,929] [2024-11-13 12:44:13,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:44:13,486 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:44:13,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:13 WrapperNode [2024-11-13 12:44:13,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:44:13,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:44:13,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:44:13,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:44:13,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:13" (1/1) ... [2024-11-13 12:44:13,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:13" (1/1) ... [2024-11-13 12:44:13,552 INFO L138 Inliner]: procedures = 29, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 526 [2024-11-13 12:44:13,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:44:13,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:44:13,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:44:13,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:44:13,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:13" (1/1) ... [2024-11-13 12:44:13,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:13" (1/1) ... [2024-11-13 12:44:13,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:13" (1/1) ... [2024-11-13 12:44:13,599 INFO L175 MemorySlicer]: Split 127 memory accesses to 13 slices as follows [2, 11, 10, 6, 14, 9, 14, 10, 5, 8, 14, 14, 10]. 11 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 3, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1]. [2024-11-13 12:44:13,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:13" (1/1) ... [2024-11-13 12:44:13,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:13" (1/1) ... [2024-11-13 12:44:13,628 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:13" (1/1) ... [2024-11-13 12:44:13,637 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:13" (1/1) ... [2024-11-13 12:44:13,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:13" (1/1) ... [2024-11-13 12:44:13,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:13" (1/1) ... [2024-11-13 12:44:13,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:44:13,663 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:44:13,663 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:44:13,663 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:44:13,664 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:13" (1/1) ... [2024-11-13 12:44:13,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:44:13,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:13,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:44:13,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:44:13,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:44:13,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-13 12:44:13,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-13 12:44:13,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-13 12:44:13,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-13 12:44:13,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-13 12:44:13,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-13 12:44:13,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-13 12:44:13,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-13 12:44:13,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-13 12:44:13,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-13 12:44:13,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-13 12:44:13,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-13 12:44:13,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-13 12:44:13,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 12:44:13,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 12:44:13,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 12:44:13,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 12:44:13,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-13 12:44:13,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-13 12:44:13,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-13 12:44:13,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-13 12:44:13,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-13 12:44:13,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-13 12:44:13,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-13 12:44:13,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-13 12:44:13,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-13 12:44:13,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-13 12:44:13,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-13 12:44:13,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-13 12:44:13,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-13 12:44:13,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-13 12:44:13,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-13 12:44:13,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-13 12:44:13,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-13 12:44:13,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-13 12:44:13,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-13 12:44:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-13 12:44:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-13 12:44:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-13 12:44:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 12:44:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 12:44:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 12:44:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 12:44:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-13 12:44:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-13 12:44:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-13 12:44:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-13 12:44:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-13 12:44:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-13 12:44:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-13 12:44:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-13 12:44:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-13 12:44:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-13 12:44:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-13 12:44:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-13 12:44:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-13 12:44:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-13 12:44:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-13 12:44:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-13 12:44:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-13 12:44:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-13 12:44:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-13 12:44:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-13 12:44:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-13 12:44:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-13 12:44:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 12:44:13,752 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 12:44:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 12:44:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 12:44:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 12:44:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 12:44:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-13 12:44:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-13 12:44:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-13 12:44:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-13 12:44:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-13 12:44:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-13 12:44:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-13 12:44:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-13 12:44:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-13 12:44:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:44:13,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:44:14,013 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:44:14,016 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:44:14,653 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-13 12:44:14,654 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:44:14,665 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:44:14,666 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 12:44:14,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:44:14 BoogieIcfgContainer [2024-11-13 12:44:14,666 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:44:14,668 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:44:14,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:44:14,673 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:44:14,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:44:13" (1/3) ... [2024-11-13 12:44:14,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcd1bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:44:14, skipping insertion in model container [2024-11-13 12:44:14,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:13" (2/3) ... [2024-11-13 12:44:14,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcd1bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:44:14, skipping insertion in model container [2024-11-13 12:44:14,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:44:14" (3/3) ... [2024-11-13 12:44:14,676 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-15.i [2024-11-13 12:44:14,691 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:44:14,693 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-15.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 12:44:14,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:44:14,788 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;@2967a8e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:44:14,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 12:44:14,793 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 12:44:14,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 12:44:14,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:14,804 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:14,804 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:14,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:14,809 INFO L85 PathProgramCache]: Analyzing trace with hash 817243291, now seen corresponding path program 1 times [2024-11-13 12:44:14,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:14,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929040177] [2024-11-13 12:44:14,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:14,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:15,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:15,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929040177] [2024-11-13 12:44:15,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929040177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:15,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:15,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:44:15,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952610495] [2024-11-13 12:44:15,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:15,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 12:44:15,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:15,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 12:44:15,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 12:44:15,317 INFO L87 Difference]: Start difference. First operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 12:44:15,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:15,363 INFO L93 Difference]: Finished difference Result 219 states and 338 transitions. [2024-11-13 12:44:15,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:44:15,368 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-13 12:44:15,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:15,378 INFO L225 Difference]: With dead ends: 219 [2024-11-13 12:44:15,380 INFO L226 Difference]: Without dead ends: 109 [2024-11-13 12:44:15,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-13 12:44:15,389 INFO L432 NwaCegarLoop]: 157 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, 157 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-13 12:44:15,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:15,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-13 12:44:15,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-13 12:44:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 12:44:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-13 12:44:15,430 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2024-11-13 12:44:15,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:15,431 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-13 12:44:15,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 12:44:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-13 12:44:15,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 12:44:15,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:15,434 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:15,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:44:15,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:15,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:15,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1640835529, now seen corresponding path program 1 times [2024-11-13 12:44:15,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:15,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958290269] [2024-11-13 12:44:15,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:15,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:15,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:15,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958290269] [2024-11-13 12:44:15,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958290269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:15,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:15,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:44:15,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001931217] [2024-11-13 12:44:15,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:15,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:44:15,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:15,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:44:15,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:44:15,855 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:15,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:15,892 INFO L93 Difference]: Finished difference Result 216 states and 313 transitions. [2024-11-13 12:44:15,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:44:15,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 12:44:15,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:15,895 INFO L225 Difference]: With dead ends: 216 [2024-11-13 12:44:15,895 INFO L226 Difference]: Without dead ends: 110 [2024-11-13 12:44:15,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:44:15,897 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:15,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:15,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-13 12:44:15,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-13 12:44:15,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 12:44:15,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-11-13 12:44:15,913 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 115 [2024-11-13 12:44:15,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:15,919 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-11-13 12:44:15,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:15,920 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-11-13 12:44:15,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 12:44:15,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:15,921 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:15,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:44:15,922 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:15,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:15,924 INFO L85 PathProgramCache]: Analyzing trace with hash -48108213, now seen corresponding path program 1 times [2024-11-13 12:44:15,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:15,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109034738] [2024-11-13 12:44:15,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:15,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,346 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:16,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:16,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109034738] [2024-11-13 12:44:16,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109034738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:16,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:16,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:44:16,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538902985] [2024-11-13 12:44:16,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:16,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:44:16,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:16,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:44:16,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:44:16,348 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:16,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:16,386 INFO L93 Difference]: Finished difference Result 215 states and 310 transitions. [2024-11-13 12:44:16,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:44:16,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 12:44:16,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:16,388 INFO L225 Difference]: With dead ends: 215 [2024-11-13 12:44:16,388 INFO L226 Difference]: Without dead ends: 108 [2024-11-13 12:44:16,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:44:16,389 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:16,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:16,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-13 12:44:16,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-13 12:44:16,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 12:44:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2024-11-13 12:44:16,398 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 115 [2024-11-13 12:44:16,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:16,398 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2024-11-13 12:44:16,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:16,399 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2024-11-13 12:44:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 12:44:16,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:16,400 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:16,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 12:44:16,400 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:16,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:16,401 INFO L85 PathProgramCache]: Analyzing trace with hash -176271980, now seen corresponding path program 1 times [2024-11-13 12:44:16,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:16,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554932409] [2024-11-13 12:44:16,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:16,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,673 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:16,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:16,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554932409] [2024-11-13 12:44:16,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554932409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:16,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:16,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:44:16,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196761002] [2024-11-13 12:44:16,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:16,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:44:16,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:16,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:44:16,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:44:16,675 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 12:44:16,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:16,740 INFO L93 Difference]: Finished difference Result 215 states and 308 transitions. [2024-11-13 12:44:16,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:44:16,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-13 12:44:16,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:16,742 INFO L225 Difference]: With dead ends: 215 [2024-11-13 12:44:16,742 INFO L226 Difference]: Without dead ends: 110 [2024-11-13 12:44:16,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-13 12:44:16,746 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 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-13 12:44:16,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:16,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-13 12:44:16,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-13 12:44:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 12:44:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2024-11-13 12:44:16,765 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 115 [2024-11-13 12:44:16,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:16,765 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2024-11-13 12:44:16,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 12:44:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2024-11-13 12:44:16,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 12:44:16,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:16,770 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:16,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 12:44:16,771 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:16,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:16,771 INFO L85 PathProgramCache]: Analyzing trace with hash -620172654, now seen corresponding path program 1 times [2024-11-13 12:44:16,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:16,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827560167] [2024-11-13 12:44:16,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:16,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:16,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:16,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827560167] [2024-11-13 12:44:16,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827560167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:16,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:16,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:44:16,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053643186] [2024-11-13 12:44:16,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:16,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:44:16,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:16,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:44:16,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:44:16,976 INFO L87 Difference]: Start difference. First operand 110 states and 156 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:17,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:17,005 INFO L93 Difference]: Finished difference Result 218 states and 311 transitions. [2024-11-13 12:44:17,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:44:17,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 12:44:17,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:17,007 INFO L225 Difference]: With dead ends: 218 [2024-11-13 12:44:17,007 INFO L226 Difference]: Without dead ends: 111 [2024-11-13 12:44:17,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:44:17,008 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:17,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:17,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-13 12:44:17,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-13 12:44:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 12:44:17,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 157 transitions. [2024-11-13 12:44:17,025 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 157 transitions. Word has length 115 [2024-11-13 12:44:17,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:17,028 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 157 transitions. [2024-11-13 12:44:17,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:17,028 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 157 transitions. [2024-11-13 12:44:17,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 12:44:17,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:17,030 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:17,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 12:44:17,030 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:17,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:17,031 INFO L85 PathProgramCache]: Analyzing trace with hash -362007216, now seen corresponding path program 1 times [2024-11-13 12:44:17,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:17,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420582090] [2024-11-13 12:44:17,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:17,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:17,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:17,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420582090] [2024-11-13 12:44:17,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420582090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:17,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:17,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:17,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586800368] [2024-11-13 12:44:17,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:17,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:17,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:17,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:17,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:17,631 INFO L87 Difference]: Start difference. First operand 111 states and 157 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:17,789 INFO L93 Difference]: Finished difference Result 275 states and 386 transitions. [2024-11-13 12:44:17,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:17,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 12:44:17,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:17,792 INFO L225 Difference]: With dead ends: 275 [2024-11-13 12:44:17,793 INFO L226 Difference]: Without dead ends: 167 [2024-11-13 12:44:17,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:44:17,794 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 66 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:17,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 681 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:17,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-13 12:44:17,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2024-11-13 12:44:17,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 145 states have (on average 1.3586206896551725) internal successors, (197), 146 states have internal predecessors, (197), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 12:44:17,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 229 transitions. [2024-11-13 12:44:17,819 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 229 transitions. Word has length 115 [2024-11-13 12:44:17,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:17,819 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 229 transitions. [2024-11-13 12:44:17,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:17,821 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 229 transitions. [2024-11-13 12:44:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 12:44:17,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:17,823 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:17,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 12:44:17,823 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:17,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:17,824 INFO L85 PathProgramCache]: Analyzing trace with hash 449692799, now seen corresponding path program 1 times [2024-11-13 12:44:17,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:17,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588309504] [2024-11-13 12:44:17,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:17,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:18,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:18,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588309504] [2024-11-13 12:44:18,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588309504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:18,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:18,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:18,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090902010] [2024-11-13 12:44:18,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:18,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:18,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:18,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:18,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:18,276 INFO L87 Difference]: Start difference. First operand 164 states and 229 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:18,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:18,380 INFO L93 Difference]: Finished difference Result 419 states and 586 transitions. [2024-11-13 12:44:18,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:18,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-11-13 12:44:18,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:18,384 INFO L225 Difference]: With dead ends: 419 [2024-11-13 12:44:18,384 INFO L226 Difference]: Without dead ends: 258 [2024-11-13 12:44:18,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-13 12:44:18,387 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 71 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:18,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 749 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-13 12:44:18,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 166. [2024-11-13 12:44:18,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 147 states have (on average 1.3537414965986394) internal successors, (199), 148 states have internal predecessors, (199), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 12:44:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 231 transitions. [2024-11-13 12:44:18,409 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 231 transitions. Word has length 116 [2024-11-13 12:44:18,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:18,409 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 231 transitions. [2024-11-13 12:44:18,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 231 transitions. [2024-11-13 12:44:18,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 12:44:18,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:18,411 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:18,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 12:44:18,411 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:18,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:18,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1389204618, now seen corresponding path program 1 times [2024-11-13 12:44:18,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:18,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213612211] [2024-11-13 12:44:18,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:18,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:18,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:18,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213612211] [2024-11-13 12:44:18,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213612211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:18,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:18,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:18,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412672165] [2024-11-13 12:44:18,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:18,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:18,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:18,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:18,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:18,838 INFO L87 Difference]: Start difference. First operand 166 states and 231 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:18,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:18,923 INFO L93 Difference]: Finished difference Result 420 states and 586 transitions. [2024-11-13 12:44:18,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:18,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-11-13 12:44:18,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:18,927 INFO L225 Difference]: With dead ends: 420 [2024-11-13 12:44:18,928 INFO L226 Difference]: Without dead ends: 257 [2024-11-13 12:44:18,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-13 12:44:18,929 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 68 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:18,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 582 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:18,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-13 12:44:18,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 170. [2024-11-13 12:44:18,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 151 states have (on average 1.3509933774834437) internal successors, (204), 152 states have internal predecessors, (204), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 12:44:18,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 236 transitions. [2024-11-13 12:44:18,939 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 236 transitions. Word has length 116 [2024-11-13 12:44:18,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:18,940 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 236 transitions. [2024-11-13 12:44:18,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:18,940 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 236 transitions. [2024-11-13 12:44:18,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 12:44:18,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:18,942 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:18,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 12:44:18,942 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:18,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:18,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2088114228, now seen corresponding path program 1 times [2024-11-13 12:44:18,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:18,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255048926] [2024-11-13 12:44:18,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:18,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:19,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:19,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255048926] [2024-11-13 12:44:19,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255048926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:19,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:19,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 12:44:19,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115162340] [2024-11-13 12:44:19,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:19,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:44:19,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:19,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:44:19,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:44:19,464 INFO L87 Difference]: Start difference. First operand 170 states and 236 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:19,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:19,651 INFO L93 Difference]: Finished difference Result 509 states and 708 transitions. [2024-11-13 12:44:19,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:44:19,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-11-13 12:44:19,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:19,654 INFO L225 Difference]: With dead ends: 509 [2024-11-13 12:44:19,655 INFO L226 Difference]: Without dead ends: 342 [2024-11-13 12:44:19,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:44:19,656 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 166 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:19,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 572 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:19,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-13 12:44:19,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 320. [2024-11-13 12:44:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 283 states have (on average 1.3568904593639577) internal successors, (384), 285 states have internal predecessors, (384), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 12:44:19,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 448 transitions. [2024-11-13 12:44:19,683 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 448 transitions. Word has length 116 [2024-11-13 12:44:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:19,683 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 448 transitions. [2024-11-13 12:44:19,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 448 transitions. [2024-11-13 12:44:19,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 12:44:19,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:19,685 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:19,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 12:44:19,686 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:19,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:19,686 INFO L85 PathProgramCache]: Analyzing trace with hash 221423341, now seen corresponding path program 1 times [2024-11-13 12:44:19,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:19,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473427461] [2024-11-13 12:44:19,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:19,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:20,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:20,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473427461] [2024-11-13 12:44:20,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473427461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:20,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:20,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:20,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224300811] [2024-11-13 12:44:20,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:20,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:20,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:20,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:20,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:20,116 INFO L87 Difference]: Start difference. First operand 320 states and 448 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:20,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:20,207 INFO L93 Difference]: Finished difference Result 761 states and 1065 transitions. [2024-11-13 12:44:20,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:20,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-13 12:44:20,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:20,211 INFO L225 Difference]: With dead ends: 761 [2024-11-13 12:44:20,211 INFO L226 Difference]: Without dead ends: 444 [2024-11-13 12:44:20,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-13 12:44:20,212 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 60 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:20,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 612 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:20,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-13 12:44:20,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 341. [2024-11-13 12:44:20,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 304 states have (on average 1.3519736842105263) internal successors, (411), 306 states have internal predecessors, (411), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 12:44:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 475 transitions. [2024-11-13 12:44:20,249 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 475 transitions. Word has length 117 [2024-11-13 12:44:20,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:20,250 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 475 transitions. [2024-11-13 12:44:20,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:20,250 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 475 transitions. [2024-11-13 12:44:20,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 12:44:20,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:20,253 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:20,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 12:44:20,253 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:20,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:20,254 INFO L85 PathProgramCache]: Analyzing trace with hash -789693909, now seen corresponding path program 1 times [2024-11-13 12:44:20,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:20,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280982598] [2024-11-13 12:44:20,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:20,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:20,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:20,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280982598] [2024-11-13 12:44:20,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280982598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:20,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:20,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:20,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777408479] [2024-11-13 12:44:20,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:20,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:20,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:20,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:20,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:20,689 INFO L87 Difference]: Start difference. First operand 341 states and 475 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:20,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:20,864 INFO L93 Difference]: Finished difference Result 810 states and 1125 transitions. [2024-11-13 12:44:20,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:20,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-13 12:44:20,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:20,868 INFO L225 Difference]: With dead ends: 810 [2024-11-13 12:44:20,868 INFO L226 Difference]: Without dead ends: 456 [2024-11-13 12:44:20,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:44:20,870 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 259 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:20,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 680 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:20,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-13 12:44:20,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 446. [2024-11-13 12:44:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 395 states have (on average 1.3443037974683545) internal successors, (531), 397 states have internal predecessors, (531), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 12:44:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 619 transitions. [2024-11-13 12:44:20,899 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 619 transitions. Word has length 117 [2024-11-13 12:44:20,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:20,899 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 619 transitions. [2024-11-13 12:44:20,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:20,900 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 619 transitions. [2024-11-13 12:44:20,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 12:44:20,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:20,901 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:20,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 12:44:20,902 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:20,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:20,902 INFO L85 PathProgramCache]: Analyzing trace with hash -490452796, now seen corresponding path program 1 times [2024-11-13 12:44:20,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:20,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112611643] [2024-11-13 12:44:20,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:20,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,311 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:21,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:21,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112611643] [2024-11-13 12:44:21,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112611643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:21,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:21,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:21,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287441962] [2024-11-13 12:44:21,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:21,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:21,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:21,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:21,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:21,314 INFO L87 Difference]: Start difference. First operand 446 states and 619 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:21,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:21,411 INFO L93 Difference]: Finished difference Result 979 states and 1358 transitions. [2024-11-13 12:44:21,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:21,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-13 12:44:21,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:21,415 INFO L225 Difference]: With dead ends: 979 [2024-11-13 12:44:21,415 INFO L226 Difference]: Without dead ends: 536 [2024-11-13 12:44:21,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-13 12:44:21,417 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 58 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:21,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 724 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:21,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-13 12:44:21,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 442. [2024-11-13 12:44:21,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 391 states have (on average 1.329923273657289) internal successors, (520), 393 states have internal predecessors, (520), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 12:44:21,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 608 transitions. [2024-11-13 12:44:21,455 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 608 transitions. Word has length 118 [2024-11-13 12:44:21,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:21,455 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 608 transitions. [2024-11-13 12:44:21,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:21,456 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 608 transitions. [2024-11-13 12:44:21,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 12:44:21,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:21,461 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:21,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 12:44:21,461 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:21,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:21,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1306180646, now seen corresponding path program 1 times [2024-11-13 12:44:21,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:21,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371492192] [2024-11-13 12:44:21,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:21,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:21,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:21,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371492192] [2024-11-13 12:44:21,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371492192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:21,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:21,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:44:21,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261872846] [2024-11-13 12:44:21,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:21,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:44:21,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:21,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:44:21,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:44:21,905 INFO L87 Difference]: Start difference. First operand 442 states and 608 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:22,078 INFO L93 Difference]: Finished difference Result 1109 states and 1534 transitions. [2024-11-13 12:44:22,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:44:22,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-13 12:44:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:22,085 INFO L225 Difference]: With dead ends: 1109 [2024-11-13 12:44:22,085 INFO L226 Difference]: Without dead ends: 670 [2024-11-13 12:44:22,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 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-13 12:44:22,087 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 142 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:22,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1230 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:22,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-11-13 12:44:22,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 668. [2024-11-13 12:44:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 591 states have (on average 1.3367174280879865) internal successors, (790), 593 states have internal predecessors, (790), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-13 12:44:22,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 926 transitions. [2024-11-13 12:44:22,143 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 926 transitions. Word has length 118 [2024-11-13 12:44:22,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:22,145 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 926 transitions. [2024-11-13 12:44:22,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:22,145 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 926 transitions. [2024-11-13 12:44:22,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 12:44:22,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:22,149 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:22,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 12:44:22,149 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:22,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:22,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1982041249, now seen corresponding path program 1 times [2024-11-13 12:44:22,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:22,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625216027] [2024-11-13 12:44:22,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:22,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:22,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:22,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625216027] [2024-11-13 12:44:22,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625216027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:22,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:22,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:22,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893015460] [2024-11-13 12:44:22,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:22,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:22,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:22,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:22,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:22,512 INFO L87 Difference]: Start difference. First operand 668 states and 926 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:22,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:22,617 INFO L93 Difference]: Finished difference Result 1300 states and 1802 transitions. [2024-11-13 12:44:22,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:22,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-13 12:44:22,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:22,622 INFO L225 Difference]: With dead ends: 1300 [2024-11-13 12:44:22,622 INFO L226 Difference]: Without dead ends: 635 [2024-11-13 12:44:22,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-13 12:44:22,624 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 64 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:22,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 723 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:22,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-13 12:44:22,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 631. [2024-11-13 12:44:22,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 554 states have (on average 1.332129963898917) internal successors, (738), 556 states have internal predecessors, (738), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-13 12:44:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 874 transitions. [2024-11-13 12:44:22,671 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 874 transitions. Word has length 119 [2024-11-13 12:44:22,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:22,671 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 874 transitions. [2024-11-13 12:44:22,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 874 transitions. [2024-11-13 12:44:22,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 12:44:22,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:22,673 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:22,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 12:44:22,674 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:22,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:22,674 INFO L85 PathProgramCache]: Analyzing trace with hash 871041718, now seen corresponding path program 1 times [2024-11-13 12:44:22,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:22,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010642062] [2024-11-13 12:44:22,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:22,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:23,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:23,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:23,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:23,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:23,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:23,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:23,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:23,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:23,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:23,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:23,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:23,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:23,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:23,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010642062] [2024-11-13 12:44:23,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010642062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:23,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:23,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 12:44:23,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574146027] [2024-11-13 12:44:23,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:23,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:44:23,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:23,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:44:23,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:44:23,395 INFO L87 Difference]: Start difference. First operand 631 states and 874 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:23,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:23,797 INFO L93 Difference]: Finished difference Result 1507 states and 2095 transitions. [2024-11-13 12:44:23,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:44:23,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-13 12:44:23,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:23,802 INFO L225 Difference]: With dead ends: 1507 [2024-11-13 12:44:23,803 INFO L226 Difference]: Without dead ends: 879 [2024-11-13 12:44:23,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:44:23,805 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 133 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:23,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1400 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:44:23,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2024-11-13 12:44:23,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 436. [2024-11-13 12:44:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 385 states have (on average 1.309090909090909) internal successors, (504), 387 states have internal predecessors, (504), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 12:44:23,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 592 transitions. [2024-11-13 12:44:23,860 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 592 transitions. Word has length 119 [2024-11-13 12:44:23,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:23,860 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 592 transitions. [2024-11-13 12:44:23,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 592 transitions. [2024-11-13 12:44:23,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 12:44:23,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:23,863 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:23,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 12:44:23,863 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:23,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:23,863 INFO L85 PathProgramCache]: Analyzing trace with hash -863044021, now seen corresponding path program 1 times [2024-11-13 12:44:23,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:23,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316702270] [2024-11-13 12:44:23,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:23,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,514 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:24,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:24,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316702270] [2024-11-13 12:44:24,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316702270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:24,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:24,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 12:44:24,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048007368] [2024-11-13 12:44:24,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:24,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:44:24,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:24,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:44:24,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:44:24,516 INFO L87 Difference]: Start difference. First operand 436 states and 592 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:24,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:24,828 INFO L93 Difference]: Finished difference Result 1033 states and 1414 transitions. [2024-11-13 12:44:24,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:44:24,828 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-11-13 12:44:24,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:24,832 INFO L225 Difference]: With dead ends: 1033 [2024-11-13 12:44:24,832 INFO L226 Difference]: Without dead ends: 600 [2024-11-13 12:44:24,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:44:24,834 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 130 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:24,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 812 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:44:24,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-13 12:44:24,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 436. [2024-11-13 12:44:24,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 385 states have (on average 1.3038961038961039) internal successors, (502), 387 states have internal predecessors, (502), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 12:44:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 590 transitions. [2024-11-13 12:44:24,896 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 590 transitions. Word has length 120 [2024-11-13 12:44:24,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:24,896 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 590 transitions. [2024-11-13 12:44:24,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:24,897 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 590 transitions. [2024-11-13 12:44:24,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 12:44:24,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:24,898 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:24,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 12:44:24,899 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:24,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:24,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1875241179, now seen corresponding path program 1 times [2024-11-13 12:44:24,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:24,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252436150] [2024-11-13 12:44:24,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:24,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:25,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:25,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252436150] [2024-11-13 12:44:25,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252436150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:25,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:25,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 12:44:25,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301839706] [2024-11-13 12:44:25,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:25,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:44:25,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:25,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:44:25,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:44:25,254 INFO L87 Difference]: Start difference. First operand 436 states and 590 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:25,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:25,451 INFO L93 Difference]: Finished difference Result 881 states and 1190 transitions. [2024-11-13 12:44:25,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 12:44:25,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-13 12:44:25,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:25,455 INFO L225 Difference]: With dead ends: 881 [2024-11-13 12:44:25,455 INFO L226 Difference]: Without dead ends: 448 [2024-11-13 12:44:25,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:44:25,457 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 60 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:25,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1079 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:25,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-13 12:44:25,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 438. [2024-11-13 12:44:25,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 387 states have (on average 1.297157622739018) internal successors, (502), 389 states have internal predecessors, (502), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 12:44:25,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 590 transitions. [2024-11-13 12:44:25,500 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 590 transitions. Word has length 121 [2024-11-13 12:44:25,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:25,501 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 590 transitions. [2024-11-13 12:44:25,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:25,501 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 590 transitions. [2024-11-13 12:44:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 12:44:25,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:25,503 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:25,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 12:44:25,503 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:25,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:25,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2094095897, now seen corresponding path program 1 times [2024-11-13 12:44:25,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:25,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114131921] [2024-11-13 12:44:25,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:25,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,035 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:26,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:26,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114131921] [2024-11-13 12:44:26,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114131921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:26,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:26,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 12:44:26,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344849951] [2024-11-13 12:44:26,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:26,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:44:26,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:26,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:44:26,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:44:26,039 INFO L87 Difference]: Start difference. First operand 438 states and 590 transitions. Second operand has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-13 12:44:26,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:26,325 INFO L93 Difference]: Finished difference Result 941 states and 1264 transitions. [2024-11-13 12:44:26,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:44:26,326 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 121 [2024-11-13 12:44:26,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:26,329 INFO L225 Difference]: With dead ends: 941 [2024-11-13 12:44:26,329 INFO L226 Difference]: Without dead ends: 506 [2024-11-13 12:44:26,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:44:26,330 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 198 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:26,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 829 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:44:26,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-13 12:44:26,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 502. [2024-11-13 12:44:26,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 445 states have (on average 1.29438202247191) internal successors, (576), 449 states have internal predecessors, (576), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 12:44:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 672 transitions. [2024-11-13 12:44:26,412 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 672 transitions. Word has length 121 [2024-11-13 12:44:26,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:26,412 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 672 transitions. [2024-11-13 12:44:26,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-13 12:44:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 672 transitions. [2024-11-13 12:44:26,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 12:44:26,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:26,414 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:26,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 12:44:26,415 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:26,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:26,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1072029037, now seen corresponding path program 1 times [2024-11-13 12:44:26,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:26,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550757301] [2024-11-13 12:44:26,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:26,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,664 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:26,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:26,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550757301] [2024-11-13 12:44:26,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550757301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:26,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:26,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:26,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659259907] [2024-11-13 12:44:26,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:26,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:26,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:26,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:26,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:26,666 INFO L87 Difference]: Start difference. First operand 502 states and 672 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:26,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:26,785 INFO L93 Difference]: Finished difference Result 997 states and 1336 transitions. [2024-11-13 12:44:26,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:26,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-13 12:44:26,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:26,789 INFO L225 Difference]: With dead ends: 997 [2024-11-13 12:44:26,789 INFO L226 Difference]: Without dead ends: 498 [2024-11-13 12:44:26,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-13 12:44:26,790 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 50 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:26,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 575 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:26,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-13 12:44:26,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 494. [2024-11-13 12:44:26,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 437 states have (on average 1.2906178489702518) internal successors, (564), 441 states have internal predecessors, (564), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 12:44:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 660 transitions. [2024-11-13 12:44:26,845 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 660 transitions. Word has length 121 [2024-11-13 12:44:26,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:26,845 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 660 transitions. [2024-11-13 12:44:26,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:26,846 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 660 transitions. [2024-11-13 12:44:26,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 12:44:26,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:26,847 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:26,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 12:44:26,848 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:26,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:26,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1472458916, now seen corresponding path program 1 times [2024-11-13 12:44:26,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:26,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028920832] [2024-11-13 12:44:26,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:26,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,156 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:27,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:27,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028920832] [2024-11-13 12:44:27,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028920832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:27,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:27,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:27,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849891238] [2024-11-13 12:44:27,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:27,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:27,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:27,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:27,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:27,159 INFO L87 Difference]: Start difference. First operand 494 states and 660 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:27,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:27,300 INFO L93 Difference]: Finished difference Result 987 states and 1317 transitions. [2024-11-13 12:44:27,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:27,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-13 12:44:27,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:27,305 INFO L225 Difference]: With dead ends: 987 [2024-11-13 12:44:27,308 INFO L226 Difference]: Without dead ends: 496 [2024-11-13 12:44:27,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-13 12:44:27,310 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 61 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:27,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 563 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:27,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-13 12:44:27,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 492. [2024-11-13 12:44:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 435 states have (on average 1.282758620689655) internal successors, (558), 439 states have internal predecessors, (558), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 12:44:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 654 transitions. [2024-11-13 12:44:27,377 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 654 transitions. Word has length 121 [2024-11-13 12:44:27,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:27,378 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 654 transitions. [2024-11-13 12:44:27,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:27,378 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 654 transitions. [2024-11-13 12:44:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 12:44:27,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:27,380 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:27,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 12:44:27,380 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:27,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:27,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1580423306, now seen corresponding path program 1 times [2024-11-13 12:44:27,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:27,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72342651] [2024-11-13 12:44:27,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:27,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:28,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:28,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72342651] [2024-11-13 12:44:28,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72342651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:28,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:28,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 12:44:28,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486343654] [2024-11-13 12:44:28,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:28,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:44:28,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:28,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:44:28,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-13 12:44:28,290 INFO L87 Difference]: Start difference. First operand 492 states and 654 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:28,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:28,846 INFO L93 Difference]: Finished difference Result 1215 states and 1599 transitions. [2024-11-13 12:44:28,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:44:28,847 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-13 12:44:28,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:28,851 INFO L225 Difference]: With dead ends: 1215 [2024-11-13 12:44:28,851 INFO L226 Difference]: Without dead ends: 726 [2024-11-13 12:44:28,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-13 12:44:28,853 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 70 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:28,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1352 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:44:28,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2024-11-13 12:44:28,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 722. [2024-11-13 12:44:28,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 642 states have (on average 1.2601246105919004) internal successors, (809), 650 states have internal predecessors, (809), 66 states have call successors, (66), 13 states have call predecessors, (66), 13 states have return successors, (66), 58 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-13 12:44:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 941 transitions. [2024-11-13 12:44:28,956 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 941 transitions. Word has length 122 [2024-11-13 12:44:28,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:28,957 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 941 transitions. [2024-11-13 12:44:28,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:28,957 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 941 transitions. [2024-11-13 12:44:28,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 12:44:28,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:28,959 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:28,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 12:44:28,959 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:28,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:28,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2013479412, now seen corresponding path program 1 times [2024-11-13 12:44:28,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:28,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097308203] [2024-11-13 12:44:28,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:28,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:29,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:29,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:29,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:29,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:29,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:29,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:29,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:29,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:29,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:29,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:29,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:29,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:29,239 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:29,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:29,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097308203] [2024-11-13 12:44:29,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097308203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:29,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:29,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:29,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224629723] [2024-11-13 12:44:29,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:29,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:29,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:29,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:29,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:29,242 INFO L87 Difference]: Start difference. First operand 722 states and 941 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:29,410 INFO L93 Difference]: Finished difference Result 1427 states and 1860 transitions. [2024-11-13 12:44:29,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:29,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-13 12:44:29,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:29,415 INFO L225 Difference]: With dead ends: 1427 [2024-11-13 12:44:29,415 INFO L226 Difference]: Without dead ends: 708 [2024-11-13 12:44:29,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-13 12:44:29,418 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 40 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:29,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 618 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:29,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2024-11-13 12:44:29,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 706. [2024-11-13 12:44:29,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 626 states have (on average 1.2539936102236422) internal successors, (785), 634 states have internal predecessors, (785), 66 states have call successors, (66), 13 states have call predecessors, (66), 13 states have return successors, (66), 58 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-13 12:44:29,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 917 transitions. [2024-11-13 12:44:29,516 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 917 transitions. Word has length 122 [2024-11-13 12:44:29,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:29,517 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 917 transitions. [2024-11-13 12:44:29,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:29,517 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 917 transitions. [2024-11-13 12:44:29,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 12:44:29,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:29,519 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:29,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 12:44:29,520 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:29,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:29,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2012944116, now seen corresponding path program 1 times [2024-11-13 12:44:29,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:29,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113173120] [2024-11-13 12:44:29,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:29,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,234 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:30,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:30,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113173120] [2024-11-13 12:44:30,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113173120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:30,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:30,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 12:44:30,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658619281] [2024-11-13 12:44:30,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:30,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 12:44:30,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:30,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 12:44:30,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:44:30,237 INFO L87 Difference]: Start difference. First operand 706 states and 917 transitions. Second operand has 9 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-13 12:44:30,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:30,729 INFO L93 Difference]: Finished difference Result 1411 states and 1832 transitions. [2024-11-13 12:44:30,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:44:30,730 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 122 [2024-11-13 12:44:30,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:30,734 INFO L225 Difference]: With dead ends: 1411 [2024-11-13 12:44:30,734 INFO L226 Difference]: Without dead ends: 708 [2024-11-13 12:44:30,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:44:30,736 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 334 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:30,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 903 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:44:30,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2024-11-13 12:44:30,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 706. [2024-11-13 12:44:30,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 626 states have (on average 1.2476038338658146) internal successors, (781), 634 states have internal predecessors, (781), 66 states have call successors, (66), 13 states have call predecessors, (66), 13 states have return successors, (66), 58 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-13 12:44:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 913 transitions. [2024-11-13 12:44:30,864 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 913 transitions. Word has length 122 [2024-11-13 12:44:30,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:30,864 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 913 transitions. [2024-11-13 12:44:30,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-13 12:44:30,865 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 913 transitions. [2024-11-13 12:44:30,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 12:44:30,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:30,867 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:30,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 12:44:30,867 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:30,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:30,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1311879538, now seen corresponding path program 1 times [2024-11-13 12:44:30,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:30,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226778769] [2024-11-13 12:44:30,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:30,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,804 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:31,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:31,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226778769] [2024-11-13 12:44:31,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226778769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:31,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:31,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 12:44:31,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152573601] [2024-11-13 12:44:31,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:31,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 12:44:31,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:31,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 12:44:31,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:44:31,808 INFO L87 Difference]: Start difference. First operand 706 states and 913 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:32,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:32,752 INFO L93 Difference]: Finished difference Result 1939 states and 2506 transitions. [2024-11-13 12:44:32,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:44:32,753 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-13 12:44:32,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:32,759 INFO L225 Difference]: With dead ends: 1939 [2024-11-13 12:44:32,759 INFO L226 Difference]: Without dead ends: 1236 [2024-11-13 12:44:32,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2024-11-13 12:44:32,762 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 338 mSDsluCounter, 1901 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 2177 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:32,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 2177 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:44:32,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2024-11-13 12:44:32,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1099. [2024-11-13 12:44:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 969 states have (on average 1.2425180598555212) internal successors, (1204), 983 states have internal predecessors, (1204), 108 states have call successors, (108), 21 states have call predecessors, (108), 21 states have return successors, (108), 94 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-13 12:44:32,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1420 transitions. [2024-11-13 12:44:32,931 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1420 transitions. Word has length 122 [2024-11-13 12:44:32,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:32,932 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1420 transitions. [2024-11-13 12:44:32,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:32,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1420 transitions. [2024-11-13 12:44:32,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 12:44:32,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:32,934 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:32,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 12:44:32,935 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:32,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:32,935 INFO L85 PathProgramCache]: Analyzing trace with hash -516533103, now seen corresponding path program 1 times [2024-11-13 12:44:32,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:32,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869186125] [2024-11-13 12:44:32,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:32,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:33,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:33,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:33,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:33,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:33,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:33,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:33,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:33,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:33,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:33,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:33,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:33,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:33,964 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:33,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:33,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869186125] [2024-11-13 12:44:33,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869186125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:33,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:33,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 12:44:33,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941904577] [2024-11-13 12:44:33,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:33,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 12:44:33,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:33,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 12:44:33,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-13 12:44:33,967 INFO L87 Difference]: Start difference. First operand 1099 states and 1420 transitions. Second operand has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 12:44:34,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:34,735 INFO L93 Difference]: Finished difference Result 1813 states and 2343 transitions. [2024-11-13 12:44:34,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:44:34,736 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 124 [2024-11-13 12:44:34,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:34,743 INFO L225 Difference]: With dead ends: 1813 [2024-11-13 12:44:34,743 INFO L226 Difference]: Without dead ends: 1110 [2024-11-13 12:44:34,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-11-13 12:44:34,746 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 204 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:34,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1331 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:44:34,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2024-11-13 12:44:34,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1108. [2024-11-13 12:44:34,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 978 states have (on average 1.2402862985685073) internal successors, (1213), 992 states have internal predecessors, (1213), 108 states have call successors, (108), 21 states have call predecessors, (108), 21 states have return successors, (108), 94 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-13 12:44:34,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1429 transitions. [2024-11-13 12:44:34,909 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1429 transitions. Word has length 124 [2024-11-13 12:44:34,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:34,910 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1429 transitions. [2024-11-13 12:44:34,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 12:44:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1429 transitions. [2024-11-13 12:44:34,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 12:44:34,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:34,913 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:34,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 12:44:34,913 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:34,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:34,914 INFO L85 PathProgramCache]: Analyzing trace with hash -116103224, now seen corresponding path program 1 times [2024-11-13 12:44:34,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:34,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814871467] [2024-11-13 12:44:34,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:34,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:35,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:35,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814871467] [2024-11-13 12:44:35,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814871467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:35,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:35,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:35,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798138331] [2024-11-13 12:44:35,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:35,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:35,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:35,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:35,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:35,188 INFO L87 Difference]: Start difference. First operand 1108 states and 1429 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:35,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:35,385 INFO L93 Difference]: Finished difference Result 1807 states and 2328 transitions. [2024-11-13 12:44:35,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:35,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-13 12:44:35,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:35,392 INFO L225 Difference]: With dead ends: 1807 [2024-11-13 12:44:35,392 INFO L226 Difference]: Without dead ends: 1095 [2024-11-13 12:44:35,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-13 12:44:35,394 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 43 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:35,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 687 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:35,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2024-11-13 12:44:35,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1093. [2024-11-13 12:44:35,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 963 states have (on average 1.2346832814122535) internal successors, (1189), 977 states have internal predecessors, (1189), 108 states have call successors, (108), 21 states have call predecessors, (108), 21 states have return successors, (108), 94 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-13 12:44:35,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1405 transitions. [2024-11-13 12:44:35,537 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1405 transitions. Word has length 124 [2024-11-13 12:44:35,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:35,537 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1405 transitions. [2024-11-13 12:44:35,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:35,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1405 transitions. [2024-11-13 12:44:35,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 12:44:35,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:35,539 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:35,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 12:44:35,541 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:35,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:35,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1253405384, now seen corresponding path program 1 times [2024-11-13 12:44:35,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:35,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473277827] [2024-11-13 12:44:35,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:35,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:35,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:35,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473277827] [2024-11-13 12:44:35,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473277827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:35,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:35,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:35,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160022737] [2024-11-13 12:44:35,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:35,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:35,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:35,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:35,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:35,740 INFO L87 Difference]: Start difference. First operand 1093 states and 1405 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:35,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:35,877 INFO L93 Difference]: Finished difference Result 2217 states and 2853 transitions. [2024-11-13 12:44:35,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:35,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-13 12:44:35,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:35,885 INFO L225 Difference]: With dead ends: 2217 [2024-11-13 12:44:35,887 INFO L226 Difference]: Without dead ends: 1144 [2024-11-13 12:44:35,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:35,890 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:35,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 580 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:35,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2024-11-13 12:44:36,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1144. [2024-11-13 12:44:36,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1014 states have (on average 1.222879684418146) internal successors, (1240), 1028 states have internal predecessors, (1240), 108 states have call successors, (108), 21 states have call predecessors, (108), 21 states have return successors, (108), 94 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-13 12:44:36,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1456 transitions. [2024-11-13 12:44:36,029 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1456 transitions. Word has length 124 [2024-11-13 12:44:36,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:36,030 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1456 transitions. [2024-11-13 12:44:36,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:36,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1456 transitions. [2024-11-13 12:44:36,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 12:44:36,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:36,037 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:36,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 12:44:36,037 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:36,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:36,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1738222131, now seen corresponding path program 1 times [2024-11-13 12:44:36,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:36,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925665799] [2024-11-13 12:44:36,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:36,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:36,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:36,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:36,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:36,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:36,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:36,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:36,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:36,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:36,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:36,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:36,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:36,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:36,320 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:36,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:36,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925665799] [2024-11-13 12:44:36,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925665799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:36,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:36,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:36,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143181673] [2024-11-13 12:44:36,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:36,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:36,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:36,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:36,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:36,322 INFO L87 Difference]: Start difference. First operand 1144 states and 1456 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:36,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:36,518 INFO L93 Difference]: Finished difference Result 2208 states and 2802 transitions. [2024-11-13 12:44:36,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:36,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 126 [2024-11-13 12:44:36,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:36,527 INFO L225 Difference]: With dead ends: 2208 [2024-11-13 12:44:36,527 INFO L226 Difference]: Without dead ends: 1084 [2024-11-13 12:44:36,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-13 12:44:36,530 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 35 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:36,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 577 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:36,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2024-11-13 12:44:36,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1082. [2024-11-13 12:44:36,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 952 states have (on average 1.1974789915966386) internal successors, (1140), 966 states have internal predecessors, (1140), 108 states have call successors, (108), 21 states have call predecessors, (108), 21 states have return successors, (108), 94 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-13 12:44:36,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1356 transitions. [2024-11-13 12:44:36,662 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1356 transitions. Word has length 126 [2024-11-13 12:44:36,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:36,662 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1356 transitions. [2024-11-13 12:44:36,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:36,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1356 transitions. [2024-11-13 12:44:36,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 12:44:36,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:36,665 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:36,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-13 12:44:36,665 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:36,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:36,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2102624920, now seen corresponding path program 1 times [2024-11-13 12:44:36,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:36,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525924953] [2024-11-13 12:44:36,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:36,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,277 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 42 proven. 39 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-13 12:44:40,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:40,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525924953] [2024-11-13 12:44:40,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525924953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:44:40,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515302035] [2024-11-13 12:44:40,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:40,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:40,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:40,281 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:40,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 12:44:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:41,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-13 12:44:41,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:42,058 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-13 12:44:42,697 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-13 12:44:44,701 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 17 treesize of output 13 [2024-11-13 12:44:45,183 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-13 12:44:45,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 108 [2024-11-13 12:44:45,264 INFO L349 Elim1Store]: treesize reduction 60, result has 13.0 percent of original size [2024-11-13 12:44:45,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 125 [2024-11-13 12:44:46,438 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 32 treesize of output 20 [2024-11-13 12:44:46,672 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 53 treesize of output 37 [2024-11-13 12:44:46,683 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 27 treesize of output 19 [2024-11-13 12:44:46,816 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 43 treesize of output 27 [2024-11-13 12:44:47,055 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 12 proven. 212 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 12:44:47,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:44:48,929 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:48,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515302035] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:44:48,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:44:48,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [24, 33] total 63 [2024-11-13 12:44:48,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105285216] [2024-11-13 12:44:48,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:48,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 12:44:48,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:48,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 12:44:48,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=3673, Unknown=0, NotChecked=0, Total=3906 [2024-11-13 12:44:48,933 INFO L87 Difference]: Start difference. First operand 1082 states and 1356 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:50,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:50,459 INFO L93 Difference]: Finished difference Result 1951 states and 2437 transitions. [2024-11-13 12:44:50,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:44:50,460 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-13 12:44:50,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:50,467 INFO L225 Difference]: With dead ends: 1951 [2024-11-13 12:44:50,467 INFO L226 Difference]: Without dead ends: 1253 [2024-11-13 12:44:50,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=320, Invalid=4936, Unknown=0, NotChecked=0, Total=5256 [2024-11-13 12:44:50,475 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 235 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:50,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1796 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 12:44:50,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2024-11-13 12:44:50,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1163. [2024-11-13 12:44:50,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1027 states have (on average 1.195715676728335) internal successors, (1228), 1042 states have internal predecessors, (1228), 112 states have call successors, (112), 23 states have call predecessors, (112), 23 states have return successors, (112), 97 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-13 12:44:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1452 transitions. [2024-11-13 12:44:50,600 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1452 transitions. Word has length 128 [2024-11-13 12:44:50,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:50,601 INFO L471 AbstractCegarLoop]: Abstraction has 1163 states and 1452 transitions. [2024-11-13 12:44:50,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:50,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1452 transitions. [2024-11-13 12:44:50,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 12:44:50,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:50,603 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:50,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 12:44:50,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-13 12:44:50,804 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:50,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:50,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1422566550, now seen corresponding path program 1 times [2024-11-13 12:44:50,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:50,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284166159] [2024-11-13 12:44:50,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:50,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:50,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:50,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:50,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:50,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:50,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:50,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:50,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:50,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:50,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:50,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:50,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:50,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:50,981 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:50,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:50,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284166159] [2024-11-13 12:44:50,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284166159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:50,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:50,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:50,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983614317] [2024-11-13 12:44:50,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:50,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:50,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:50,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:50,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:50,983 INFO L87 Difference]: Start difference. First operand 1163 states and 1452 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:51,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:51,165 INFO L93 Difference]: Finished difference Result 1996 states and 2489 transitions. [2024-11-13 12:44:51,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:51,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-13 12:44:51,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:51,172 INFO L225 Difference]: With dead ends: 1996 [2024-11-13 12:44:51,172 INFO L226 Difference]: Without dead ends: 1217 [2024-11-13 12:44:51,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-13 12:44:51,175 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 47 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:51,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 729 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:51,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2024-11-13 12:44:51,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1184. [2024-11-13 12:44:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1048 states have (on average 1.1927480916030535) internal successors, (1250), 1063 states have internal predecessors, (1250), 112 states have call successors, (112), 23 states have call predecessors, (112), 23 states have return successors, (112), 97 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-13 12:44:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1474 transitions. [2024-11-13 12:44:51,319 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1474 transitions. Word has length 128 [2024-11-13 12:44:51,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:51,319 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1474 transitions. [2024-11-13 12:44:51,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:51,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1474 transitions. [2024-11-13 12:44:51,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 12:44:51,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:51,324 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:51,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 12:44:51,324 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:51,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:51,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2119955818, now seen corresponding path program 1 times [2024-11-13 12:44:51,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:51,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634777802] [2024-11-13 12:44:51,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:51,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:51,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:51,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634777802] [2024-11-13 12:44:51,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634777802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:51,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:51,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:51,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479867337] [2024-11-13 12:44:51,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:51,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:51,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:51,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:51,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:51,481 INFO L87 Difference]: Start difference. First operand 1184 states and 1474 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:51,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:51,646 INFO L93 Difference]: Finished difference Result 2025 states and 2514 transitions. [2024-11-13 12:44:51,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:51,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-13 12:44:51,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:51,653 INFO L225 Difference]: With dead ends: 2025 [2024-11-13 12:44:51,653 INFO L226 Difference]: Without dead ends: 1225 [2024-11-13 12:44:51,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-13 12:44:51,655 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 49 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:51,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 679 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:51,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2024-11-13 12:44:51,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1151. [2024-11-13 12:44:51,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1018 states have (on average 1.1895874263261297) internal successors, (1211), 1032 states have internal predecessors, (1211), 108 states have call successors, (108), 24 states have call predecessors, (108), 24 states have return successors, (108), 94 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-13 12:44:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1427 transitions. [2024-11-13 12:44:51,769 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1427 transitions. Word has length 128 [2024-11-13 12:44:51,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:51,770 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1427 transitions. [2024-11-13 12:44:51,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:44:51,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1427 transitions. [2024-11-13 12:44:51,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 12:44:51,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:51,772 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:51,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 12:44:51,772 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:51,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:51,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1494953108, now seen corresponding path program 1 times [2024-11-13 12:44:51,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:51,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713546428] [2024-11-13 12:44:51,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:51,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:54,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:54,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:54,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:54,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:54,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:54,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:54,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:54,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:54,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:44:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:54,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:54,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:44:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:54,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:54,254 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-13 12:44:54,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:54,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713546428] [2024-11-13 12:44:54,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713546428] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:44:54,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935777341] [2024-11-13 12:44:54,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:54,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:54,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:54,257 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:54,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 12:44:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:54,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-13 12:44:54,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:55,676 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-13 12:44:56,118 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-13 12:44:57,625 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 26 treesize of output 14 [2024-11-13 12:44:57,737 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-13 12:44:58,125 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-13 12:44:58,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 100 [2024-11-13 12:44:58,171 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2024-11-13 12:44:58,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 117 [2024-11-13 12:44:58,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 15 [2024-11-13 12:44:58,651 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 51 treesize of output 35 [2024-11-13 12:44:58,656 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 25 treesize of output 17 [2024-11-13 12:44:58,813 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 35 treesize of output 19 [2024-11-13 12:44:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 204 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-13 12:44:59,029 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:44:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:44:59,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935777341] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:44:59,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:44:59,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [24, 29] total 54 [2024-11-13 12:44:59,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342625819] [2024-11-13 12:44:59,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:59,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:44:59,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:59,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:44:59,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2702, Unknown=0, NotChecked=0, Total=2862 [2024-11-13 12:44:59,985 INFO L87 Difference]: Start difference. First operand 1151 states and 1427 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:00,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:00,974 INFO L93 Difference]: Finished difference Result 1950 states and 2414 transitions. [2024-11-13 12:45:00,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:45:00,974 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-13 12:45:00,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:00,981 INFO L225 Difference]: With dead ends: 1950 [2024-11-13 12:45:00,981 INFO L226 Difference]: Without dead ends: 1187 [2024-11-13 12:45:00,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=188, Invalid=3352, Unknown=0, NotChecked=0, Total=3540 [2024-11-13 12:45:00,986 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 47 mSDsluCounter, 1406 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:00,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1606 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:45:00,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2024-11-13 12:45:01,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1148. [2024-11-13 12:45:01,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1015 states have (on average 1.1891625615763546) internal successors, (1207), 1029 states have internal predecessors, (1207), 108 states have call successors, (108), 24 states have call predecessors, (108), 24 states have return successors, (108), 94 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-13 12:45:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1423 transitions. [2024-11-13 12:45:01,115 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1423 transitions. Word has length 128 [2024-11-13 12:45:01,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:01,116 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1423 transitions. [2024-11-13 12:45:01,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:01,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1423 transitions. [2024-11-13 12:45:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 12:45:01,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:01,118 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:01,140 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 12:45:01,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-13 12:45:01,323 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:01,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:01,324 INFO L85 PathProgramCache]: Analyzing trace with hash -2128396897, now seen corresponding path program 1 times [2024-11-13 12:45:01,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:01,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117291968] [2024-11-13 12:45:01,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:01,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 12:45:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:45:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,984 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-13 12:45:01,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:01,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117291968] [2024-11-13 12:45:01,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117291968] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:45:01,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481889940] [2024-11-13 12:45:01,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:01,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:01,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:01,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:45:01,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 12:45:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:02,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 12:45:02,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:02,695 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-13 12:45:03,035 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 4 proven. 152 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-13 12:45:03,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:45:03,327 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 36 treesize of output 32 [2024-11-13 12:45:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-13 12:45:03,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481889940] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:45:03,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:45:03,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 26 [2024-11-13 12:45:03,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689808138] [2024-11-13 12:45:03,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:45:03,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 12:45:03,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:03,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 12:45:03,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2024-11-13 12:45:03,546 INFO L87 Difference]: Start difference. First operand 1148 states and 1423 transitions. Second operand has 26 states, 22 states have (on average 6.681818181818182) internal successors, (147), 24 states have internal predecessors, (147), 11 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 8 states have call predecessors, (36), 11 states have call successors, (36) [2024-11-13 12:45:04,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:04,589 INFO L93 Difference]: Finished difference Result 2358 states and 2905 transitions. [2024-11-13 12:45:04,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 12:45:04,590 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 6.681818181818182) internal successors, (147), 24 states have internal predecessors, (147), 11 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 8 states have call predecessors, (36), 11 states have call successors, (36) Word has length 128 [2024-11-13 12:45:04,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:04,595 INFO L225 Difference]: With dead ends: 2358 [2024-11-13 12:45:04,596 INFO L226 Difference]: Without dead ends: 1234 [2024-11-13 12:45:04,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=362, Invalid=1278, Unknown=0, NotChecked=0, Total=1640 [2024-11-13 12:45:04,599 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 828 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:04,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 1771 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 12:45:04,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2024-11-13 12:45:04,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1012. [2024-11-13 12:45:04,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 892 states have (on average 1.1939461883408071) internal successors, (1065), 903 states have internal predecessors, (1065), 96 states have call successors, (96), 23 states have call predecessors, (96), 23 states have return successors, (96), 85 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-13 12:45:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1257 transitions. [2024-11-13 12:45:04,705 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1257 transitions. Word has length 128 [2024-11-13 12:45:04,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:04,705 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1257 transitions. [2024-11-13 12:45:04,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 6.681818181818182) internal successors, (147), 24 states have internal predecessors, (147), 11 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 8 states have call predecessors, (36), 11 states have call successors, (36) [2024-11-13 12:45:04,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1257 transitions. [2024-11-13 12:45:04,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 12:45:04,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:04,707 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:04,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 12:45:04,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-13 12:45:04,912 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:04,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:04,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1199580517, now seen corresponding path program 1 times [2024-11-13 12:45:04,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:04,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287453271] [2024-11-13 12:45:04,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:04,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:45:04,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:45:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:45:05,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:45:05,198 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 12:45:05,199 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 12:45:05,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-13 12:45:05,204 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:05,480 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 12:45:05,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 12:45:05 BoogieIcfgContainer [2024-11-13 12:45:05,484 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 12:45:05,485 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 12:45:05,485 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 12:45:05,485 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 12:45:05,486 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:44:14" (3/4) ... [2024-11-13 12:45:05,488 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 12:45:05,489 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 12:45:05,490 INFO L158 Benchmark]: Toolchain (without parser) took 52378.15ms. Allocated memory was 117.4MB in the beginning and 251.7MB in the end (delta: 134.2MB). Free memory was 92.9MB in the beginning and 159.2MB in the end (delta: -66.3MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. [2024-11-13 12:45:05,490 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 117.4MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:45:05,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.76ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 78.8MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 12:45:05,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.83ms. Allocated memory is still 117.4MB. Free memory was 78.8MB in the beginning and 75.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:45:05,492 INFO L158 Benchmark]: Boogie Preprocessor took 109.51ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 71.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:45:05,493 INFO L158 Benchmark]: RCFGBuilder took 1003.49ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 85.0MB in the end (delta: -13.6MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2024-11-13 12:45:05,493 INFO L158 Benchmark]: TraceAbstraction took 50815.92ms. Allocated memory was 117.4MB in the beginning and 251.7MB in the end (delta: 134.2MB). Free memory was 84.4MB in the beginning and 159.2MB in the end (delta: -74.8MB). Peak memory consumption was 154.4MB. Max. memory is 16.1GB. [2024-11-13 12:45:05,493 INFO L158 Benchmark]: Witness Printer took 4.46ms. Allocated memory is still 251.7MB. Free memory was 159.2MB in the beginning and 159.2MB in the end (delta: 33.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:45:05,494 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.34ms. Allocated memory is still 117.4MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.76ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 78.8MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.83ms. Allocated memory is still 117.4MB. Free memory was 78.8MB in the beginning and 75.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 109.51ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 71.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1003.49ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 85.0MB in the end (delta: -13.6MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * TraceAbstraction took 50815.92ms. Allocated memory was 117.4MB in the beginning and 251.7MB in the end (delta: 134.2MB). Free memory was 84.4MB in the beginning and 159.2MB in the end (delta: -74.8MB). Peak memory consumption was 154.4MB. Max. memory is 16.1GB. * Witness Printer took 4.46ms. Allocated memory is still 251.7MB. Free memory was 159.2MB in the beginning and 159.2MB in the end (delta: 33.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 72, overapproximation of someBinaryArithmeticDOUBLEoperation at line 103, overapproximation of someBinaryArithmeticDOUBLEoperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -128; [L22] signed char var_1_1 = -128; [L23] signed char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 1; [L24] unsigned char var_1_2 = 1; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] unsigned char var_1_6 = 1; [L26] unsigned char var_1_6 = 1; [L27] unsigned char* var_1_6_Pointer = &(var_1_6); [L28] signed char var_1_7 = 8; [L28] signed char var_1_7 = 8; [L29] signed char* var_1_7_Pointer = &(var_1_7); [L30] unsigned long int var_1_8 = 1; [L30] unsigned long int var_1_8 = 1; [L31] unsigned long int* var_1_8_Pointer = &(var_1_8); [L32] unsigned long int var_1_9 = 1885310857; [L32] unsigned long int var_1_9 = 1885310857; [L33] unsigned long int* var_1_9_Pointer = &(var_1_9); [L34] signed long int var_1_10 = -10; [L34] signed long int var_1_10 = -10; [L35] signed long int* var_1_10_Pointer = &(var_1_10); [L36] double var_1_11 = 32.6; [L36] double var_1_11 = 32.6; [L37] double* var_1_11_Pointer = &(var_1_11); [L38] double var_1_12 = 9.75; [L38] double var_1_12 = 9.75; [L39] double* var_1_12_Pointer = &(var_1_12); [L40] double var_1_13 = 5.1; [L40] double var_1_13 = 5.1; [L41] double* var_1_13_Pointer = &(var_1_13); [L42] double var_1_14 = 128.1; [L42] double var_1_14 = 128.1; [L43] double* var_1_14_Pointer = &(var_1_14); [L44] double var_1_15 = 63.9; [L44] double var_1_15 = 63.9; [L45] double* var_1_15_Pointer = &(var_1_15); [L46] signed long int last_1_var_1_10 = -10; VAL [isInitial=0, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L100] EXPR \read(var_1_10) [L100] last_1_var_1_10 = var_1_10 [L110] RET updateLastVariables() [L111] CALL updateVariables() [L78] var_1_2 = __VERIFIER_nondet_uchar() [L79] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L79] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L79] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L80] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L80] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L80] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L81] var_1_6 = __VERIFIER_nondet_uchar() [L82] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L82] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L82] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L83] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L83] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L83] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L84] var_1_7 = __VERIFIER_nondet_char() [L85] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L85] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L85] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] var_1_9 = __VERIFIER_nondet_ulong() [L88] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] CALL assume_abort_if_not(var_1_9 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] RET assume_abort_if_not(var_1_9 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] var_1_12 = __VERIFIER_nondet_double() [L91] EXPR \read(var_1_12) [L91] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F [L91] EXPR \read(var_1_12) [L91] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] EXPR (var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] EXPR (var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] var_1_13 = __VERIFIER_nondet_double() [L93] EXPR \read(var_1_13) [L93] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F [L93] EXPR \read(var_1_13) [L93] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] var_1_14 = __VERIFIER_nondet_double() [L95] EXPR \read(var_1_14) [L95] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F [L95] EXPR \read(var_1_14) [L95] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] EXPR (var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] EXPR (var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] var_1_15 = __VERIFIER_nondet_double() [L97] EXPR \read(var_1_15) [L97] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F [L97] EXPR \read(var_1_15) [L97] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] RET updateVariables() [L112] CALL step() [L50] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L50] COND FALSE !((*(var_1_2_Pointer))) [L53] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L53] EXPR ((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))) [L53] EXPR ((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L53] (*(var_1_8_Pointer)) = ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))) [L55] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L55] COND FALSE !((*(var_1_2_Pointer))) [L58] EXPR \read(*var_1_2_Pointer) [L58] unsigned char stepLocal_1 = (*(var_1_2_Pointer)); [L59] EXPR \read(*var_1_10_Pointer) [L59] signed long int stepLocal_0 = (*(var_1_10_Pointer)); [L60] stepLocal_1 || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer))) VAL [isInitial=1, last_1_var_1_10=-10, stepLocal_0=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L60] stepLocal_1 || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer))) [L60] EXPR \read(*var_1_10_Pointer) [L60] EXPR \read(*var_1_10_Pointer) [L60] stepLocal_1 || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer))) VAL [isInitial=1, last_1_var_1_10=-10, stepLocal_0=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L60] COND TRUE stepLocal_1 || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer))) [L61] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L61] COND FALSE !(stepLocal_0 < (*(var_1_8_Pointer))) [L66] (*(var_1_1_Pointer)) = 2 VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L71] EXPR \read(*var_1_1_Pointer) [L71] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L71] COND TRUE (*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)) [L72] EXPR \read(*var_1_12_Pointer) [L72] EXPR \read(*var_1_13_Pointer) [L72] EXPR \read(*var_1_14_Pointer) [L72] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L72] EXPR ((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer))) [L72] EXPR \read(*var_1_13_Pointer) [L72] EXPR \read(*var_1_14_Pointer) [L72] EXPR ((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L72] (*(var_1_11_Pointer)) = ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))) [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR \read(*var_1_2_Pointer) [L103] EXPR (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer))) [L103] EXPR \read(*var_1_10_Pointer) [L103] EXPR \read(*var_1_10_Pointer) [L103] EXPR (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) [L103] EXPR \read(*var_1_10_Pointer) [L103] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2)) [L103] EXPR \read(*var_1_1_Pointer) [L103] EXPR ((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2)) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))))))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))))))) [L103] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))) [L103] EXPR \read(*var_1_8_Pointer) [L103] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))) [L103] EXPR ((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))))))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1) [L103] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1 [L103] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1 VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)) && (((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer)))))))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)) && (((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer)))))))) [L103] EXPR \read(*var_1_1_Pointer) [L103] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer))))))) [L103] EXPR \read(*var_1_11_Pointer) [L103] EXPR \read(*var_1_12_Pointer) [L103] EXPR \read(*var_1_13_Pointer) [L103] EXPR \read(*var_1_14_Pointer) [L103] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer))) [L103] EXPR \read(*var_1_13_Pointer) [L103] EXPR \read(*var_1_14_Pointer) [L103] EXPR ((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer))))))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)) && (((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer)))))))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103-L104] return (((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)) && (((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer)))))))) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.5s, OverallIterations: 34, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3856 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3856 mSDsluCounter, 28121 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22056 mSDsCounter, 251 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3954 IncrementalHoareTripleChecker+Invalid, 4205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 251 mSolverCounterUnsat, 6065 mSDtfsCounter, 3954 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1904 GetRequests, 1561 SyntacticMatches, 1 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2082 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1184occurred in iteration=30, InterpolantAutomatonStates: 230, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 1655 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 32.1s InterpolantComputationTime, 4488 NumberOfCodeBlocks, 4488 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 4705 ConstructedInterpolants, 186 QuantifiedInterpolants, 29762 SizeOfPredicates, 57 NumberOfNonLiveVariables, 1703 ConjunctsInSsa, 193 ConjunctsInUnsatCore, 39 InterpolantComputations, 32 PerfectInterpolantSequences, 9629/10296 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-13 12:45:05,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd --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 944d6be29b18a7b057c10d85533dd285a58675394c7ffcf3e8926ec3db51ce25 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:45:08,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:45:08,267 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 12:45:08,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:45:08,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:45:08,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:45:08,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:45:08,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:45:08,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:45:08,323 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:45:08,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:45:08,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:45:08,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:45:08,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:45:08,324 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:45:08,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:45:08,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:45:08,325 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:45:08,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:45:08,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:45:08,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:45:08,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:45:08,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:45:08,326 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 12:45:08,326 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 12:45:08,326 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:45:08,326 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 12:45:08,326 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:45:08,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:45:08,327 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:45:08,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:45:08,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:45:08,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:45:08,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:45:08,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:45:08,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:45:08,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:45:08,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:45:08,327 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 12:45:08,328 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 12:45:08,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:45:08,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:45:08,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:45:08,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:45:08,328 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd 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 -> 944d6be29b18a7b057c10d85533dd285a58675394c7ffcf3e8926ec3db51ce25 [2024-11-13 12:45:08,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:45:08,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:45:08,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:45:08,691 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:45:08,691 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:45:08,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i Unable to find full path for "g++" [2024-11-13 12:45:10,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:45:10,971 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:45:10,972 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i [2024-11-13 12:45:10,984 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/data/2c5cf9971/ca5b3c200c094da0a451f9086cfb140f/FLAG412db3a57 [2024-11-13 12:45:11,006 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/data/2c5cf9971/ca5b3c200c094da0a451f9086cfb140f [2024-11-13 12:45:11,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:45:11,010 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:45:11,012 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:45:11,012 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:45:11,017 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:45:11,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:45:11" (1/1) ... [2024-11-13 12:45:11,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3086cb97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:11, skipping insertion in model container [2024-11-13 12:45:11,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:45:11" (1/1) ... [2024-11-13 12:45:11,047 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:45:11,247 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i[916,929] [2024-11-13 12:45:11,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:45:11,375 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:45:11,393 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i[916,929] [2024-11-13 12:45:11,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:45:11,483 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:45:11,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:11 WrapperNode [2024-11-13 12:45:11,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:45:11,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:45:11,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:45:11,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:45:11,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:11" (1/1) ... [2024-11-13 12:45:11,517 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:11" (1/1) ... [2024-11-13 12:45:11,553 INFO L138 Inliner]: procedures = 33, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 525 [2024-11-13 12:45:11,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:45:11,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:45:11,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:45:11,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:45:11,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:11" (1/1) ... [2024-11-13 12:45:11,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:11" (1/1) ... [2024-11-13 12:45:11,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:11" (1/1) ... [2024-11-13 12:45:11,598 INFO L175 MemorySlicer]: Split 127 memory accesses to 13 slices as follows [2, 11, 10, 6, 14, 9, 14, 10, 5, 8, 14, 14, 10]. 11 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 3, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1]. [2024-11-13 12:45:11,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:11" (1/1) ... [2024-11-13 12:45:11,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:11" (1/1) ... [2024-11-13 12:45:11,625 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:11" (1/1) ... [2024-11-13 12:45:11,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:11" (1/1) ... [2024-11-13 12:45:11,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:11" (1/1) ... [2024-11-13 12:45:11,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:11" (1/1) ... [2024-11-13 12:45:11,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:45:11,668 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:45:11,668 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:45:11,668 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:45:11,669 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:11" (1/1) ... [2024-11-13 12:45:11,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:45:11,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:11,711 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:45:11,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:45:11,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:45:11,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-13 12:45:11,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-13 12:45:11,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-13 12:45:11,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-13 12:45:11,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-13 12:45:11,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-13 12:45:11,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-13 12:45:11,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-13 12:45:11,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-11-13 12:45:11,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-11-13 12:45:11,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-11-13 12:45:11,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-11-13 12:45:11,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-11-13 12:45:11,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-13 12:45:11,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-13 12:45:11,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-13 12:45:11,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-13 12:45:11,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-13 12:45:11,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-13 12:45:11,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-13 12:45:11,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-13 12:45:11,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-11-13 12:45:11,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-11-13 12:45:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-11-13 12:45:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-11-13 12:45:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-11-13 12:45:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-13 12:45:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-13 12:45:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-13 12:45:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-13 12:45:11,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-13 12:45:11,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-13 12:45:11,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-13 12:45:11,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-13 12:45:11,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-13 12:45:11,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-13 12:45:11,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-13 12:45:11,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-13 12:45:11,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-13 12:45:11,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 12:45:11,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 12:45:11,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 12:45:11,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-13 12:45:11,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-13 12:45:11,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-13 12:45:11,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-13 12:45:11,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-13 12:45:11,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-13 12:45:11,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-13 12:45:11,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-13 12:45:11,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-13 12:45:11,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-13 12:45:11,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-13 12:45:11,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-13 12:45:11,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-13 12:45:11,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-13 12:45:11,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-13 12:45:11,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-13 12:45:11,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-13 12:45:11,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-13 12:45:11,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-13 12:45:11,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-13 12:45:11,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-13 12:45:11,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-13 12:45:11,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-13 12:45:11,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-13 12:45:11,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-13 12:45:11,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-13 12:45:11,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-13 12:45:11,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-13 12:45:11,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-13 12:45:11,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-13 12:45:11,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-13 12:45:11,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-11-13 12:45:11,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-11-13 12:45:11,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-11-13 12:45:11,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-11-13 12:45:11,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-11-13 12:45:11,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 12:45:11,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 12:45:11,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-13 12:45:11,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-13 12:45:11,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-13 12:45:11,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-13 12:45:11,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-13 12:45:11,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-13 12:45:11,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-13 12:45:11,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-13 12:45:11,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-13 12:45:11,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-13 12:45:11,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-13 12:45:11,766 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 12:45:11,769 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 12:45:11,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:45:11,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:45:11,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-13 12:45:11,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-13 12:45:11,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-13 12:45:11,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-13 12:45:11,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-13 12:45:11,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-13 12:45:11,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-13 12:45:11,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-13 12:45:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-13 12:45:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-13 12:45:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-13 12:45:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-13 12:45:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-13 12:45:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 12:45:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 12:45:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-13 12:45:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-13 12:45:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-13 12:45:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-13 12:45:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-13 12:45:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-13 12:45:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-13 12:45:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-13 12:45:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-13 12:45:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-13 12:45:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-13 12:45:12,014 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:45:12,016 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:45:13,938 INFO L? ?]: Removed 136 outVars from TransFormulas that were not future-live. [2024-11-13 12:45:13,938 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:45:13,951 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:45:13,951 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 12:45:13,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:45:13 BoogieIcfgContainer [2024-11-13 12:45:13,951 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:45:13,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:45:13,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:45:13,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:45:13,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:45:11" (1/3) ... [2024-11-13 12:45:13,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db53553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:45:13, skipping insertion in model container [2024-11-13 12:45:13,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:11" (2/3) ... [2024-11-13 12:45:13,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db53553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:45:13, skipping insertion in model container [2024-11-13 12:45:13,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:45:13" (3/3) ... [2024-11-13 12:45:13,962 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-15.i [2024-11-13 12:45:13,977 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:45:13,979 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-15.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 12:45:14,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:45:14,048 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;@4c9297f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:45:14,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 12:45:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 12:45:14,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 12:45:14,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:14,072 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:14,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:14,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:14,079 INFO L85 PathProgramCache]: Analyzing trace with hash 817243291, now seen corresponding path program 1 times [2024-11-13 12:45:14,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:14,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806471725] [2024-11-13 12:45:14,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:14,097 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-13 12:45:14,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:14,102 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:14,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:14,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 12:45:14,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-13 12:45:14,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:14,702 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:14,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806471725] [2024-11-13 12:45:14,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806471725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:14,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:14,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:45:14,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395500751] [2024-11-13 12:45:14,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:14,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 12:45:14,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:14,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 12:45:14,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 12:45:14,737 INFO L87 Difference]: Start difference. First operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 12:45:14,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:14,782 INFO L93 Difference]: Finished difference Result 219 states and 338 transitions. [2024-11-13 12:45:14,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:45:14,784 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-13 12:45:14,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:14,795 INFO L225 Difference]: With dead ends: 219 [2024-11-13 12:45:14,795 INFO L226 Difference]: Without dead ends: 109 [2024-11-13 12:45:14,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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-13 12:45:14,804 INFO L432 NwaCegarLoop]: 157 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, 157 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-13 12:45:14,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:45:14,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-13 12:45:14,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-13 12:45:14,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 12:45:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-13 12:45:14,862 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2024-11-13 12:45:14,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:14,863 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-13 12:45:14,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 12:45:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-13 12:45:14,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 12:45:14,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:14,869 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:14,878 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:15,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:15,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:15,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:15,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1640835529, now seen corresponding path program 1 times [2024-11-13 12:45:15,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:15,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601086359] [2024-11-13 12:45:15,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:15,072 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-13 12:45:15,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:15,078 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:15,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:15,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 12:45:15,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:15,652 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-13 12:45:15,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:15,653 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:15,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601086359] [2024-11-13 12:45:15,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601086359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:15,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:15,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:45:15,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756519829] [2024-11-13 12:45:15,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:15,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:45:15,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:15,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:45:15,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:45:15,656 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 12:45:15,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:15,750 INFO L93 Difference]: Finished difference Result 217 states and 314 transitions. [2024-11-13 12:45:15,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:45:15,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-13 12:45:15,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:15,752 INFO L225 Difference]: With dead ends: 217 [2024-11-13 12:45:15,752 INFO L226 Difference]: Without dead ends: 111 [2024-11-13 12:45:15,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 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-13 12:45:15,753 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 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.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:15,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:15,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-13 12:45:15,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-13 12:45:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 12:45:15,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-13 12:45:15,764 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 115 [2024-11-13 12:45:15,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:15,766 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-13 12:45:15,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 12:45:15,766 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-13 12:45:15,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 12:45:15,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:15,768 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:15,778 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:15,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:15,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:15,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:15,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1196934855, now seen corresponding path program 1 times [2024-11-13 12:45:15,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:15,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642521982] [2024-11-13 12:45:15,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:15,972 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-13 12:45:15,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:15,974 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:15,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:16,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 12:45:16,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:17,305 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 27 treesize of output 15 [2024-11-13 12:45:17,387 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 10 proven. 74 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-13 12:45:17,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:45:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:45:17,708 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:17,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642521982] [2024-11-13 12:45:17,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642521982] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:45:17,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:45:17,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-11-13 12:45:17,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666018258] [2024-11-13 12:45:17,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:17,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:17,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:17,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:17,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-13 12:45:17,712 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:17,899 INFO L93 Difference]: Finished difference Result 271 states and 390 transitions. [2024-11-13 12:45:17,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:45:17,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 12:45:17,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:17,901 INFO L225 Difference]: With dead ends: 271 [2024-11-13 12:45:17,901 INFO L226 Difference]: Without dead ends: 163 [2024-11-13 12:45:17,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:45:17,903 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 75 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:17,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 711 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:17,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-13 12:45:17,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 113. [2024-11-13 12:45:17,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 12:45:17,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-11-13 12:45:17,914 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 115 [2024-11-13 12:45:17,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:17,914 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-11-13 12:45:17,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:17,915 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-11-13 12:45:17,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 12:45:17,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:17,916 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:17,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:18,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:18,121 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:18,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:18,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1691804912, now seen corresponding path program 1 times [2024-11-13 12:45:18,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:18,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614084638] [2024-11-13 12:45:18,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:18,123 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-13 12:45:18,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:18,126 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:18,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:18,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 12:45:18,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:20,225 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 15 treesize of output 7 [2024-11-13 12:45:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 4 proven. 152 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-13 12:45:20,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:45:20,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:45:20,820 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 16 treesize of output 19 [2024-11-13 12:45:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-13 12:45:21,331 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:21,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614084638] [2024-11-13 12:45:21,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614084638] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:45:21,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:45:21,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-11-13 12:45:21,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380518370] [2024-11-13 12:45:21,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:45:21,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 12:45:21,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:21,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 12:45:21,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-13 12:45:21,334 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 17 states, 15 states have (on average 6.8) internal successors, (102), 16 states have internal predecessors, (102), 6 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-13 12:45:23,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:23,451 INFO L93 Difference]: Finished difference Result 388 states and 552 transitions. [2024-11-13 12:45:23,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:45:23,455 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.8) internal successors, (102), 16 states have internal predecessors, (102), 6 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 115 [2024-11-13 12:45:23,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:23,458 INFO L225 Difference]: With dead ends: 388 [2024-11-13 12:45:23,458 INFO L226 Difference]: Without dead ends: 278 [2024-11-13 12:45:23,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2024-11-13 12:45:23,460 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 670 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:23,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 1649 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 12:45:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-13 12:45:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 219. [2024-11-13 12:45:23,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 191 states have (on average 1.387434554973822) internal successors, (265), 191 states have internal predecessors, (265), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 12:45:23,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 313 transitions. [2024-11-13 12:45:23,498 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 313 transitions. Word has length 115 [2024-11-13 12:45:23,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:23,501 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 313 transitions. [2024-11-13 12:45:23,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.8) internal successors, (102), 16 states have internal predecessors, (102), 6 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-13 12:45:23,501 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 313 transitions. [2024-11-13 12:45:23,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 12:45:23,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:23,508 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:23,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-13 12:45:23,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:23,708 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:23,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:23,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1825818418, now seen corresponding path program 1 times [2024-11-13 12:45:23,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:23,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531439569] [2024-11-13 12:45:23,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:23,710 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-13 12:45:23,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:23,714 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:23,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 12:45:24,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 10 proven. 74 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-13 12:45:24,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:45:25,007 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:45:25,007 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:25,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531439569] [2024-11-13 12:45:25,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531439569] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:45:25,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:45:25,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-13 12:45:25,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760648550] [2024-11-13 12:45:25,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:25,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:25,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:25,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:25,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:45:25,010 INFO L87 Difference]: Start difference. First operand 219 states and 313 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:25,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:25,179 INFO L93 Difference]: Finished difference Result 487 states and 697 transitions. [2024-11-13 12:45:25,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:45:25,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 12:45:25,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:25,185 INFO L225 Difference]: With dead ends: 487 [2024-11-13 12:45:25,185 INFO L226 Difference]: Without dead ends: 271 [2024-11-13 12:45:25,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:45:25,187 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 72 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:25,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 590 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:25,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-13 12:45:25,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 223. [2024-11-13 12:45:25,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 195 states have (on average 1.3794871794871795) internal successors, (269), 195 states have internal predecessors, (269), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 12:45:25,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 317 transitions. [2024-11-13 12:45:25,214 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 317 transitions. Word has length 115 [2024-11-13 12:45:25,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:25,215 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 317 transitions. [2024-11-13 12:45:25,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:25,215 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 317 transitions. [2024-11-13 12:45:25,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 12:45:25,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:25,217 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:25,225 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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)] Ended with exit code 0 [2024-11-13 12:45:25,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:25,418 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:25,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:25,419 INFO L85 PathProgramCache]: Analyzing trace with hash 136874676, now seen corresponding path program 1 times [2024-11-13 12:45:25,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:25,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884241810] [2024-11-13 12:45:25,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:25,420 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-13 12:45:25,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:25,422 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:25,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 12:45:25,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:26,240 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:45:26,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:26,241 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:26,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884241810] [2024-11-13 12:45:26,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884241810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:26,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:26,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:45:26,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102757243] [2024-11-13 12:45:26,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:26,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:45:26,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:26,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:45:26,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:45:26,243 INFO L87 Difference]: Start difference. First operand 223 states and 317 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:26,333 INFO L93 Difference]: Finished difference Result 454 states and 644 transitions. [2024-11-13 12:45:26,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:45:26,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 12:45:26,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:26,336 INFO L225 Difference]: With dead ends: 454 [2024-11-13 12:45:26,336 INFO L226 Difference]: Without dead ends: 234 [2024-11-13 12:45:26,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:26,337 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 90 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:26,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 440 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:26,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-13 12:45:26,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 224. [2024-11-13 12:45:26,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 196 states have (on average 1.3724489795918366) internal successors, (269), 196 states have internal predecessors, (269), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 12:45:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 317 transitions. [2024-11-13 12:45:26,359 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 317 transitions. Word has length 115 [2024-11-13 12:45:26,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:26,359 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 317 transitions. [2024-11-13 12:45:26,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:26,360 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 317 transitions. [2024-11-13 12:45:26,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 12:45:26,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:26,361 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:26,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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)] Forceful destruction successful, exit code 0 [2024-11-13 12:45:26,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:26,562 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:26,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:26,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1817563947, now seen corresponding path program 1 times [2024-11-13 12:45:26,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:26,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914119686] [2024-11-13 12:45:26,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:26,563 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-13 12:45:26,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:26,565 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:26,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:26,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 12:45:26,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:26,915 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 12 treesize of output 8 [2024-11-13 12:45:26,935 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 25 treesize of output 13 [2024-11-13 12:45:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:45:26,960 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:26,960 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:26,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914119686] [2024-11-13 12:45:26,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914119686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:26,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:26,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:45:26,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101214885] [2024-11-13 12:45:26,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:26,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:45:26,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:26,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:45:26,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:45:26,962 INFO L87 Difference]: Start difference. First operand 224 states and 317 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:27,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:27,131 INFO L93 Difference]: Finished difference Result 662 states and 939 transitions. [2024-11-13 12:45:27,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:45:27,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-11-13 12:45:27,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:27,135 INFO L225 Difference]: With dead ends: 662 [2024-11-13 12:45:27,135 INFO L226 Difference]: Without dead ends: 441 [2024-11-13 12:45:27,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:27,136 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 147 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:27,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 632 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:27,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-13 12:45:27,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 439. [2024-11-13 12:45:27,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 384 states have (on average 1.3697916666666667) internal successors, (526), 384 states have internal predecessors, (526), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 12:45:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 622 transitions. [2024-11-13 12:45:27,173 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 622 transitions. Word has length 116 [2024-11-13 12:45:27,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:27,174 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 622 transitions. [2024-11-13 12:45:27,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:27,174 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 622 transitions. [2024-11-13 12:45:27,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 12:45:27,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:27,176 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:27,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:27,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:27,377 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:27,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:27,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1689400180, now seen corresponding path program 1 times [2024-11-13 12:45:27,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:27,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229945361] [2024-11-13 12:45:27,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:27,378 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-13 12:45:27,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:27,381 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:27,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 12:45:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:27,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 12:45:27,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:28,503 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 10 proven. 74 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-13 12:45:28,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:45:28,705 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:45:28,705 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:28,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229945361] [2024-11-13 12:45:28,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229945361] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:45:28,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:45:28,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-13 12:45:28,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998360225] [2024-11-13 12:45:28,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:28,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:28,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:28,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:28,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:45:28,708 INFO L87 Difference]: Start difference. First operand 439 states and 622 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:28,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:28,878 INFO L93 Difference]: Finished difference Result 965 states and 1370 transitions. [2024-11-13 12:45:28,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:45:28,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-11-13 12:45:28,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:28,882 INFO L225 Difference]: With dead ends: 965 [2024-11-13 12:45:28,882 INFO L226 Difference]: Without dead ends: 529 [2024-11-13 12:45:28,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:45:28,884 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 63 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:28,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 599 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:28,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-11-13 12:45:28,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 459. [2024-11-13 12:45:28,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 404 states have (on average 1.3712871287128714) internal successors, (554), 404 states have internal predecessors, (554), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 12:45:28,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 650 transitions. [2024-11-13 12:45:28,918 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 650 transitions. Word has length 116 [2024-11-13 12:45:28,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:28,919 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 650 transitions. [2024-11-13 12:45:28,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:28,919 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 650 transitions. [2024-11-13 12:45:28,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 12:45:28,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:28,921 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:28,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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)] Ended with exit code 0 [2024-11-13 12:45:29,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:29,122 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:29,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:29,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1947565618, now seen corresponding path program 1 times [2024-11-13 12:45:29,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:29,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838772285] [2024-11-13 12:45:29,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:29,123 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-13 12:45:29,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:29,124 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:29,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (10)] Waiting until timeout for monitored process [2024-11-13 12:45:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:29,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 12:45:29,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:30,146 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:45:30,146 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:30,146 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:30,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838772285] [2024-11-13 12:45:30,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838772285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:30,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:30,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:45:30,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631137129] [2024-11-13 12:45:30,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:30,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:45:30,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:30,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:45:30,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:45:30,148 INFO L87 Difference]: Start difference. First operand 459 states and 650 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:30,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:30,270 INFO L93 Difference]: Finished difference Result 935 states and 1322 transitions. [2024-11-13 12:45:30,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:45:30,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-11-13 12:45:30,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:30,275 INFO L225 Difference]: With dead ends: 935 [2024-11-13 12:45:30,275 INFO L226 Difference]: Without dead ends: 479 [2024-11-13 12:45:30,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:30,277 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 80 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:30,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 524 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-13 12:45:30,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 461. [2024-11-13 12:45:30,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 406 states have (on average 1.3645320197044335) internal successors, (554), 406 states have internal predecessors, (554), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 12:45:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 650 transitions. [2024-11-13 12:45:30,320 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 650 transitions. Word has length 116 [2024-11-13 12:45:30,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:30,321 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 650 transitions. [2024-11-13 12:45:30,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:30,321 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 650 transitions. [2024-11-13 12:45:30,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 12:45:30,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:30,323 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:30,335 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (10)] Ended with exit code 0 [2024-11-13 12:45:30,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:30,524 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:30,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:30,525 INFO L85 PathProgramCache]: Analyzing trace with hash 12923938, now seen corresponding path program 1 times [2024-11-13 12:45:30,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:30,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135505183] [2024-11-13 12:45:30,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:30,529 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-13 12:45:30,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:30,531 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:30,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (11)] Waiting until timeout for monitored process [2024-11-13 12:45:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 12:45:30,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:31,477 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 10 proven. 74 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-13 12:45:31,477 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:45:31,703 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:45:31,703 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:31,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135505183] [2024-11-13 12:45:31,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135505183] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:45:31,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:45:31,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-11-13 12:45:31,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659461305] [2024-11-13 12:45:31,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:31,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:31,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:31,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:31,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:45:31,704 INFO L87 Difference]: Start difference. First operand 461 states and 650 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:31,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:31,858 INFO L93 Difference]: Finished difference Result 777 states and 1098 transitions. [2024-11-13 12:45:31,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:45:31,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-13 12:45:31,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:31,862 INFO L225 Difference]: With dead ends: 777 [2024-11-13 12:45:31,862 INFO L226 Difference]: Without dead ends: 529 [2024-11-13 12:45:31,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-13 12:45:31,863 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 70 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:31,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 694 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:31,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-11-13 12:45:31,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 459. [2024-11-13 12:45:31,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 404 states have (on average 1.3564356435643565) internal successors, (548), 404 states have internal predecessors, (548), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 12:45:31,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 644 transitions. [2024-11-13 12:45:31,897 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 644 transitions. Word has length 117 [2024-11-13 12:45:31,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:31,898 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 644 transitions. [2024-11-13 12:45:31,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 644 transitions. [2024-11-13 12:45:31,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 12:45:31,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:31,900 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:31,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (11)] Ended with exit code 0 [2024-11-13 12:45:32,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:32,101 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:32,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:32,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1220360755, now seen corresponding path program 1 times [2024-11-13 12:45:32,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:32,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378777253] [2024-11-13 12:45:32,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:32,103 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-13 12:45:32,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:32,105 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:32,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (12)] Waiting until timeout for monitored process [2024-11-13 12:45:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:32,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 12:45:32,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 10 proven. 74 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-13 12:45:33,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:45:33,217 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:45:33,217 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:33,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378777253] [2024-11-13 12:45:33,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378777253] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:45:33,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:45:33,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-13 12:45:33,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231776608] [2024-11-13 12:45:33,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:33,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:33,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:33,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:33,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:45:33,219 INFO L87 Difference]: Start difference. First operand 459 states and 644 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:33,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:33,380 INFO L93 Difference]: Finished difference Result 771 states and 1084 transitions. [2024-11-13 12:45:33,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:45:33,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-13 12:45:33,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:33,384 INFO L225 Difference]: With dead ends: 771 [2024-11-13 12:45:33,384 INFO L226 Difference]: Without dead ends: 525 [2024-11-13 12:45:33,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:45:33,386 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 69 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:33,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 657 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:33,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-13 12:45:33,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 455. [2024-11-13 12:45:33,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 400 states have (on average 1.345) internal successors, (538), 400 states have internal predecessors, (538), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 12:45:33,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 634 transitions. [2024-11-13 12:45:33,425 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 634 transitions. Word has length 117 [2024-11-13 12:45:33,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:33,425 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 634 transitions. [2024-11-13 12:45:33,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:33,426 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 634 transitions. [2024-11-13 12:45:33,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 12:45:33,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:33,428 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:33,436 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (12)] Ended with exit code 0 [2024-11-13 12:45:33,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:33,628 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:33,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:33,629 INFO L85 PathProgramCache]: Analyzing trace with hash -490452796, now seen corresponding path program 1 times [2024-11-13 12:45:33,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:33,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072521098] [2024-11-13 12:45:33,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:33,630 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-13 12:45:33,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:33,632 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:33,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (13)] Waiting until timeout for monitored process [2024-11-13 12:45:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:34,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 12:45:34,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:35,000 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 10 proven. 74 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-13 12:45:35,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:45:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:45:35,226 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:35,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072521098] [2024-11-13 12:45:35,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072521098] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:45:35,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:45:35,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-11-13 12:45:35,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983209260] [2024-11-13 12:45:35,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:35,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:35,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:35,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:35,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:45:35,228 INFO L87 Difference]: Start difference. First operand 455 states and 634 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:35,369 INFO L93 Difference]: Finished difference Result 765 states and 1068 transitions. [2024-11-13 12:45:35,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:45:35,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-13 12:45:35,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:35,373 INFO L225 Difference]: With dead ends: 765 [2024-11-13 12:45:35,373 INFO L226 Difference]: Without dead ends: 523 [2024-11-13 12:45:35,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-13 12:45:35,374 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 119 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:35,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 544 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:35,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-11-13 12:45:35,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 455. [2024-11-13 12:45:35,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 400 states have (on average 1.34) internal successors, (536), 400 states have internal predecessors, (536), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 12:45:35,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 632 transitions. [2024-11-13 12:45:35,404 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 632 transitions. Word has length 118 [2024-11-13 12:45:35,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:35,404 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 632 transitions. [2024-11-13 12:45:35,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:35,405 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 632 transitions. [2024-11-13 12:45:35,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 12:45:35,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:35,406 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:35,420 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (13)] Ended with exit code 0 [2024-11-13 12:45:35,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:35,607 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:35,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:35,608 INFO L85 PathProgramCache]: Analyzing trace with hash -617047388, now seen corresponding path program 1 times [2024-11-13 12:45:35,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:35,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253040980] [2024-11-13 12:45:35,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:35,609 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-13 12:45:35,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:35,611 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:35,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (14)] Waiting until timeout for monitored process [2024-11-13 12:45:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 12:45:36,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:36,206 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 12 treesize of output 8 [2024-11-13 12:45:36,256 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 37 treesize of output 25 [2024-11-13 12:45:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:45:36,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:36,299 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:36,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253040980] [2024-11-13 12:45:36,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253040980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:36,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:36,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:45:36,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615088452] [2024-11-13 12:45:36,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:36,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:45:36,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:36,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:45:36,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:45:36,300 INFO L87 Difference]: Start difference. First operand 455 states and 632 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:36,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:36,555 INFO L93 Difference]: Finished difference Result 915 states and 1270 transitions. [2024-11-13 12:45:36,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:45:36,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-13 12:45:36,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:36,559 INFO L225 Difference]: With dead ends: 915 [2024-11-13 12:45:36,560 INFO L226 Difference]: Without dead ends: 463 [2024-11-13 12:45:36,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 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-13 12:45:36,562 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 143 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:36,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1210 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:45:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-13 12:45:36,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 461. [2024-11-13 12:45:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 406 states have (on average 1.3349753694581281) internal successors, (542), 406 states have internal predecessors, (542), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 12:45:36,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 638 transitions. [2024-11-13 12:45:36,595 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 638 transitions. Word has length 118 [2024-11-13 12:45:36,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:36,596 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 638 transitions. [2024-11-13 12:45:36,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:36,596 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 638 transitions. [2024-11-13 12:45:36,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 12:45:36,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:36,598 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:36,610 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (14)] Ended with exit code 0 [2024-11-13 12:45:36,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:36,798 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:36,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:36,799 INFO L85 PathProgramCache]: Analyzing trace with hash -8156689, now seen corresponding path program 1 times [2024-11-13 12:45:36,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:36,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348802361] [2024-11-13 12:45:36,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:36,799 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-13 12:45:36,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:36,801 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:36,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (15)] Waiting until timeout for monitored process [2024-11-13 12:45:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:37,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 12:45:37,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:38,190 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 11 treesize of output 9 [2024-11-13 12:45:38,311 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:45:38,312 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:38,312 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:38,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348802361] [2024-11-13 12:45:38,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348802361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:38,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:38,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 12:45:38,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275357324] [2024-11-13 12:45:38,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:38,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:45:38,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:38,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:45:38,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:45:38,313 INFO L87 Difference]: Start difference. First operand 461 states and 638 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:39,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:39,140 INFO L93 Difference]: Finished difference Result 892 states and 1229 transitions. [2024-11-13 12:45:39,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:45:39,141 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-13 12:45:39,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:39,143 INFO L225 Difference]: With dead ends: 892 [2024-11-13 12:45:39,143 INFO L226 Difference]: Without dead ends: 434 [2024-11-13 12:45:39,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:45:39,145 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 316 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:39,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1188 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 12:45:39,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-13 12:45:39,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 412. [2024-11-13 12:45:39,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 357 states have (on average 1.3249299719887955) internal successors, (473), 357 states have internal predecessors, (473), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 12:45:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 569 transitions. [2024-11-13 12:45:39,185 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 569 transitions. Word has length 119 [2024-11-13 12:45:39,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:39,186 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 569 transitions. [2024-11-13 12:45:39,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:39,186 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 569 transitions. [2024-11-13 12:45:39,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 12:45:39,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:39,187 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:39,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (15)] Forceful destruction successful, exit code 0 [2024-11-13 12:45:39,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:39,388 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:39,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:39,389 INFO L85 PathProgramCache]: Analyzing trace with hash 2045719881, now seen corresponding path program 1 times [2024-11-13 12:45:39,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:39,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494749446] [2024-11-13 12:45:39,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:39,390 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-13 12:45:39,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:39,394 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:39,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (16)] Waiting until timeout for monitored process [2024-11-13 12:45:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:40,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 12:45:40,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:40,888 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 11 treesize of output 9 [2024-11-13 12:45:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:45:41,117 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:41,117 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:41,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494749446] [2024-11-13 12:45:41,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494749446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:41,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:41,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:45:41,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835135823] [2024-11-13 12:45:41,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:41,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:45:41,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:41,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:45:41,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:45:41,119 INFO L87 Difference]: Start difference. First operand 412 states and 569 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:41,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:41,925 INFO L93 Difference]: Finished difference Result 774 states and 1064 transitions. [2024-11-13 12:45:41,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:45:41,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-11-13 12:45:41,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:41,928 INFO L225 Difference]: With dead ends: 774 [2024-11-13 12:45:41,928 INFO L226 Difference]: Without dead ends: 423 [2024-11-13 12:45:41,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:45:41,930 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 290 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:41,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1078 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:45:41,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-13 12:45:41,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 407. [2024-11-13 12:45:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 352 states have (on average 1.3210227272727273) internal successors, (465), 352 states have internal predecessors, (465), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 12:45:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 561 transitions. [2024-11-13 12:45:41,971 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 561 transitions. Word has length 120 [2024-11-13 12:45:41,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:41,972 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 561 transitions. [2024-11-13 12:45:41,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:41,972 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 561 transitions. [2024-11-13 12:45:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 12:45:41,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:41,974 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:41,988 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (16)] Ended with exit code 0 [2024-11-13 12:45:42,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:42,175 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:42,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:42,175 INFO L85 PathProgramCache]: Analyzing trace with hash -2106635553, now seen corresponding path program 1 times [2024-11-13 12:45:42,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:42,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761343619] [2024-11-13 12:45:42,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:42,176 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-13 12:45:42,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:42,178 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:42,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (17)] Waiting until timeout for monitored process [2024-11-13 12:45:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:42,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 12:45:42,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:42,607 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 27 treesize of output 19 [2024-11-13 12:45:42,616 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 13 treesize of output 9 [2024-11-13 12:45:42,662 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 26 treesize of output 14 [2024-11-13 12:45:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:45:42,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:42,702 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:42,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761343619] [2024-11-13 12:45:42,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761343619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:42,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:42,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:45:42,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291033157] [2024-11-13 12:45:42,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:42,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:45:42,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:42,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:45:42,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:45:42,704 INFO L87 Difference]: Start difference. First operand 407 states and 561 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:43,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:43,233 INFO L93 Difference]: Finished difference Result 960 states and 1317 transitions. [2024-11-13 12:45:43,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:45:43,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-13 12:45:43,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:43,238 INFO L225 Difference]: With dead ends: 960 [2024-11-13 12:45:43,238 INFO L226 Difference]: Without dead ends: 715 [2024-11-13 12:45:43,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-13 12:45:43,239 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 319 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:43,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 994 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:45:43,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-11-13 12:45:43,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 698. [2024-11-13 12:45:43,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 615 states have (on average 1.3235772357723576) internal successors, (814), 618 states have internal predecessors, (814), 72 states have call successors, (72), 10 states have call predecessors, (72), 10 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-13 12:45:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 958 transitions. [2024-11-13 12:45:43,281 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 958 transitions. Word has length 121 [2024-11-13 12:45:43,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:43,281 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 958 transitions. [2024-11-13 12:45:43,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:43,282 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 958 transitions. [2024-11-13 12:45:43,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 12:45:43,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:43,283 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:43,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (17)] Forceful destruction successful, exit code 0 [2024-11-13 12:45:43,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:43,484 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:43,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:43,484 INFO L85 PathProgramCache]: Analyzing trace with hash -717964056, now seen corresponding path program 1 times [2024-11-13 12:45:43,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:43,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310545013] [2024-11-13 12:45:43,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:43,485 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-13 12:45:43,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:43,489 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:43,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (18)] Waiting until timeout for monitored process [2024-11-13 12:45:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:44,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-13 12:45:44,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:46,149 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 22 treesize of output 10 [2024-11-13 12:45:46,217 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-13 12:45:46,427 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 20 treesize of output 12 [2024-11-13 12:45:46,650 INFO L349 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2024-11-13 12:45:46,651 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 1 case distinctions, treesize of input 30 treesize of output 37 [2024-11-13 12:45:47,146 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 152 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-13 12:45:47,146 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:45:47,641 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:45:47,641 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:47,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310545013] [2024-11-13 12:45:47,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310545013] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:45:47,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:45:47,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [19] total 24 [2024-11-13 12:45:47,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987900009] [2024-11-13 12:45:47,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:47,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:45:47,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:47,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:45:47,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2024-11-13 12:45:47,643 INFO L87 Difference]: Start difference. First operand 698 states and 958 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:48,072 INFO L93 Difference]: Finished difference Result 1487 states and 2049 transitions. [2024-11-13 12:45:48,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:45:48,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-13 12:45:48,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:48,079 INFO L225 Difference]: With dead ends: 1487 [2024-11-13 12:45:48,079 INFO L226 Difference]: Without dead ends: 951 [2024-11-13 12:45:48,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2024-11-13 12:45:48,081 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 250 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:48,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 831 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:45:48,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2024-11-13 12:45:48,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 499. [2024-11-13 12:45:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 448 states have (on average 1.3147321428571428) internal successors, (589), 450 states have internal predecessors, (589), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 12:45:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 677 transitions. [2024-11-13 12:45:48,124 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 677 transitions. Word has length 121 [2024-11-13 12:45:48,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:48,124 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 677 transitions. [2024-11-13 12:45:48,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:48,124 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 677 transitions. [2024-11-13 12:45:48,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 12:45:48,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:48,126 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:48,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (18)] Forceful destruction successful, exit code 0 [2024-11-13 12:45:48,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:48,327 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:48,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:48,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1158589213, now seen corresponding path program 1 times [2024-11-13 12:45:48,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:48,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339880472] [2024-11-13 12:45:48,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:48,328 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-13 12:45:48,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:48,332 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:48,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (19)] Waiting until timeout for monitored process [2024-11-13 12:45:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:48,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 12:45:48,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:52,377 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 22 treesize of output 10 [2024-11-13 12:45:52,489 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-13 12:45:52,816 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 29 treesize of output 17 [2024-11-13 12:45:53,059 INFO L349 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2024-11-13 12:45:53,059 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 1 case distinctions, treesize of input 30 treesize of output 37 [2024-11-13 12:45:54,041 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 42 treesize of output 26 [2024-11-13 12:45:54,056 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 50 treesize of output 34 [2024-11-13 12:45:54,319 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 12 proven. 203 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-13 12:45:54,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:45:54,949 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:45:54,949 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:54,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339880472] [2024-11-13 12:45:54,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1339880472] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:45:54,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:45:54,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [25] total 30 [2024-11-13 12:45:54,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887099019] [2024-11-13 12:45:54,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:54,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:45:54,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:54,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:45:54,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2024-11-13 12:45:54,951 INFO L87 Difference]: Start difference. First operand 499 states and 677 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:55,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:55,460 INFO L93 Difference]: Finished difference Result 1017 states and 1387 transitions. [2024-11-13 12:45:55,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:45:55,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-13 12:45:55,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:55,464 INFO L225 Difference]: With dead ends: 1017 [2024-11-13 12:45:55,465 INFO L226 Difference]: Without dead ends: 622 [2024-11-13 12:45:55,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2024-11-13 12:45:55,466 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 339 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:55,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 579 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:45:55,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-13 12:45:55,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 499. [2024-11-13 12:45:55,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 448 states have (on average 1.3102678571428572) internal successors, (587), 450 states have internal predecessors, (587), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 12:45:55,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 675 transitions. [2024-11-13 12:45:55,502 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 675 transitions. Word has length 122 [2024-11-13 12:45:55,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:55,503 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 675 transitions. [2024-11-13 12:45:55,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:55,503 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 675 transitions. [2024-11-13 12:45:55,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 12:45:55,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:55,505 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:55,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (19)] Ended with exit code 0 [2024-11-13 12:45:55,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:55,706 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:55,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:55,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1612514237, now seen corresponding path program 1 times [2024-11-13 12:45:55,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:55,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [946559965] [2024-11-13 12:45:55,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:55,707 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-13 12:45:55,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:55,709 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:55,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (20)] Waiting until timeout for monitored process [2024-11-13 12:45:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:56,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 12:45:56,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 10 proven. 74 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-13 12:45:56,846 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:45:57,020 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:45:57,021 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:57,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [946559965] [2024-11-13 12:45:57,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [946559965] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:45:57,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:45:57,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-13 12:45:57,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458909396] [2024-11-13 12:45:57,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:57,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:57,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:57,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:57,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:45:57,022 INFO L87 Difference]: Start difference. First operand 499 states and 675 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:57,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:57,162 INFO L93 Difference]: Finished difference Result 1061 states and 1436 transitions. [2024-11-13 12:45:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:45:57,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-13 12:45:57,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:57,165 INFO L225 Difference]: With dead ends: 1061 [2024-11-13 12:45:57,165 INFO L226 Difference]: Without dead ends: 565 [2024-11-13 12:45:57,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:45:57,167 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 100 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:57,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 461 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:57,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-13 12:45:57,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 515. [2024-11-13 12:45:57,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 464 states have (on average 1.3060344827586208) internal successors, (606), 466 states have internal predecessors, (606), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 12:45:57,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 694 transitions. [2024-11-13 12:45:57,197 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 694 transitions. Word has length 122 [2024-11-13 12:45:57,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:57,198 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 694 transitions. [2024-11-13 12:45:57,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:45:57,198 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 694 transitions. [2024-11-13 12:45:57,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 12:45:57,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:57,199 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:45:57,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (20)] Ended with exit code 0 [2024-11-13 12:45:57,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:57,400 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:57,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:57,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2012944116, now seen corresponding path program 1 times [2024-11-13 12:45:57,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:57,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571927189] [2024-11-13 12:45:57,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:57,401 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-13 12:45:57,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:57,405 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:45:57,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (21)] Waiting until timeout for monitored process [2024-11-13 12:45:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:57,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 12:45:57,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:59,226 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 15 treesize of output 7 [2024-11-13 12:45:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 4 proven. 152 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-13 12:45:59,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:45:59,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:45:59,821 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 16 treesize of output 19 [2024-11-13 12:46:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-13 12:46:00,181 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:00,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571927189] [2024-11-13 12:46:00,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571927189] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:46:00,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:46:00,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-11-13 12:46:00,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11465575] [2024-11-13 12:46:00,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:46:00,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 12:46:00,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:00,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 12:46:00,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-13 12:46:00,183 INFO L87 Difference]: Start difference. First operand 515 states and 694 transitions. Second operand has 17 states, 15 states have (on average 8.6) internal successors, (129), 16 states have internal predecessors, (129), 6 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-13 12:46:01,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:01,828 INFO L93 Difference]: Finished difference Result 1196 states and 1600 transitions. [2024-11-13 12:46:01,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 12:46:01,829 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.6) internal successors, (129), 16 states have internal predecessors, (129), 6 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 122 [2024-11-13 12:46:01,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:01,831 INFO L225 Difference]: With dead ends: 1196 [2024-11-13 12:46:01,832 INFO L226 Difference]: Without dead ends: 684 [2024-11-13 12:46:01,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2024-11-13 12:46:01,833 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 787 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:01,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 1407 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 12:46:01,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2024-11-13 12:46:01,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 601. [2024-11-13 12:46:01,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 550 states have (on average 1.2945454545454544) internal successors, (712), 552 states have internal predecessors, (712), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 12:46:01,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 800 transitions. [2024-11-13 12:46:01,879 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 800 transitions. Word has length 122 [2024-11-13 12:46:01,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:01,880 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 800 transitions. [2024-11-13 12:46:01,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.6) internal successors, (129), 16 states have internal predecessors, (129), 6 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-13 12:46:01,880 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 800 transitions. [2024-11-13 12:46:01,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 12:46:01,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:01,881 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:46:01,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (21)] Forceful destruction successful, exit code 0 [2024-11-13 12:46:02,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:02,082 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:02,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:02,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1311879538, now seen corresponding path program 1 times [2024-11-13 12:46:02,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:02,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042875942] [2024-11-13 12:46:02,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:02,083 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-13 12:46:02,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:02,089 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:02,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (22)] Waiting until timeout for monitored process [2024-11-13 12:46:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:02,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 12:46:02,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:03,025 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 11 treesize of output 9 [2024-11-13 12:46:03,330 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:46:03,330 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:46:03,331 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:03,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042875942] [2024-11-13 12:46:03,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042875942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:46:03,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:46:03,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 12:46:03,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236171996] [2024-11-13 12:46:03,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:03,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 12:46:03,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:03,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 12:46:03,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:46:03,333 INFO L87 Difference]: Start difference. First operand 601 states and 800 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:46:04,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:04,612 INFO L93 Difference]: Finished difference Result 1334 states and 1777 transitions. [2024-11-13 12:46:04,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:46:04,613 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-13 12:46:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:04,616 INFO L225 Difference]: With dead ends: 1334 [2024-11-13 12:46:04,616 INFO L226 Difference]: Without dead ends: 736 [2024-11-13 12:46:04,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2024-11-13 12:46:04,618 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 296 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:04,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1900 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 12:46:04,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-11-13 12:46:04,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 601. [2024-11-13 12:46:04,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 550 states have (on average 1.2927272727272727) internal successors, (711), 552 states have internal predecessors, (711), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 12:46:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 799 transitions. [2024-11-13 12:46:04,685 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 799 transitions. Word has length 122 [2024-11-13 12:46:04,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:04,685 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 799 transitions. [2024-11-13 12:46:04,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:46:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 799 transitions. [2024-11-13 12:46:04,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-13 12:46:04,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:04,687 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:46:04,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (22)] Ended with exit code 0 [2024-11-13 12:46:04,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:04,888 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:04,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:04,888 INFO L85 PathProgramCache]: Analyzing trace with hash -445917555, now seen corresponding path program 1 times [2024-11-13 12:46:04,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:04,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310261838] [2024-11-13 12:46:04,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:04,889 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-13 12:46:04,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:04,892 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:04,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (23)] Waiting until timeout for monitored process [2024-11-13 12:46:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:05,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 12:46:05,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:06,044 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 17 treesize of output 13 [2024-11-13 12:46:06,189 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 54 treesize of output 42 [2024-11-13 12:46:06,195 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 54 treesize of output 34 [2024-11-13 12:46:06,337 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-13 12:46:06,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:46:06,683 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:06,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310261838] [2024-11-13 12:46:06,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310261838] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:46:06,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:46:06,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 14 [2024-11-13 12:46:06,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752937268] [2024-11-13 12:46:06,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:06,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:46:06,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:06,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:46:06,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:46:06,685 INFO L87 Difference]: Start difference. First operand 601 states and 799 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:46:07,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:07,236 INFO L93 Difference]: Finished difference Result 1186 states and 1582 transitions. [2024-11-13 12:46:07,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 12:46:07,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2024-11-13 12:46:07,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:07,244 INFO L225 Difference]: With dead ends: 1186 [2024-11-13 12:46:07,244 INFO L226 Difference]: Without dead ends: 773 [2024-11-13 12:46:07,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-13 12:46:07,246 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 69 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:07,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1148 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:46:07,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2024-11-13 12:46:07,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 666. [2024-11-13 12:46:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 615 states have (on average 1.2829268292682927) internal successors, (789), 617 states have internal predecessors, (789), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 12:46:07,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 877 transitions. [2024-11-13 12:46:07,285 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 877 transitions. Word has length 123 [2024-11-13 12:46:07,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:07,285 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 877 transitions. [2024-11-13 12:46:07,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:46:07,286 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 877 transitions. [2024-11-13 12:46:07,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-13 12:46:07,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:07,287 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:46:07,301 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (23)] Ended with exit code 0 [2024-11-13 12:46:07,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:07,487 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:07,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:07,488 INFO L85 PathProgramCache]: Analyzing trace with hash -227062837, now seen corresponding path program 1 times [2024-11-13 12:46:07,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:07,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522214827] [2024-11-13 12:46:07,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:07,488 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-13 12:46:07,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:07,490 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:07,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (24)] Waiting until timeout for monitored process [2024-11-13 12:46:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:08,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 12:46:08,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:08,798 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 27 treesize of output 15 [2024-11-13 12:46:08,846 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-13 12:46:08,846 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:46:09,073 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:09,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522214827] [2024-11-13 12:46:09,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522214827] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:46:09,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:46:09,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-11-13 12:46:09,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120299799] [2024-11-13 12:46:09,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:09,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:46:09,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:09,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:46:09,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-13 12:46:09,074 INFO L87 Difference]: Start difference. First operand 666 states and 877 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:46:09,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:09,226 INFO L93 Difference]: Finished difference Result 1263 states and 1665 transitions. [2024-11-13 12:46:09,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:46:09,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2024-11-13 12:46:09,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:09,230 INFO L225 Difference]: With dead ends: 1263 [2024-11-13 12:46:09,231 INFO L226 Difference]: Without dead ends: 784 [2024-11-13 12:46:09,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:46:09,232 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 61 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:09,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 701 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:46:09,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-11-13 12:46:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 778. [2024-11-13 12:46:09,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 714 states have (on average 1.2703081232492996) internal successors, (907), 720 states have internal predecessors, (907), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 46 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 12:46:09,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1011 transitions. [2024-11-13 12:46:09,277 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1011 transitions. Word has length 123 [2024-11-13 12:46:09,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:09,278 INFO L471 AbstractCegarLoop]: Abstraction has 778 states and 1011 transitions. [2024-11-13 12:46:09,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:46:09,278 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1011 transitions. [2024-11-13 12:46:09,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 12:46:09,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:09,279 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:46:09,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (24)] Ended with exit code 0 [2024-11-13 12:46:09,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:09,480 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:09,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:09,481 INFO L85 PathProgramCache]: Analyzing trace with hash -516533103, now seen corresponding path program 1 times [2024-11-13 12:46:09,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:09,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766032068] [2024-11-13 12:46:09,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:09,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:09,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:09,490 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:09,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (25)] Waiting until timeout for monitored process [2024-11-13 12:46:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:10,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-13 12:46:10,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:11,916 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 17 treesize of output 13 [2024-11-13 12:46:12,354 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 21 treesize of output 13 [2024-11-13 12:46:12,431 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 31 treesize of output 15 [2024-11-13 12:46:12,609 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 152 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-13 12:46:12,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:13,180 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:46:13,180 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:13,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766032068] [2024-11-13 12:46:13,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766032068] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:46:13,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:46:13,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 25 [2024-11-13 12:46:13,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063305926] [2024-11-13 12:46:13,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:13,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 12:46:13,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:13,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 12:46:13,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2024-11-13 12:46:13,182 INFO L87 Difference]: Start difference. First operand 778 states and 1011 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:46:13,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:13,989 INFO L93 Difference]: Finished difference Result 1456 states and 1912 transitions. [2024-11-13 12:46:13,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:46:13,990 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-13 12:46:13,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:13,993 INFO L225 Difference]: With dead ends: 1456 [2024-11-13 12:46:13,993 INFO L226 Difference]: Without dead ends: 889 [2024-11-13 12:46:13,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2024-11-13 12:46:13,995 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 52 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:13,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1260 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:46:13,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-11-13 12:46:14,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 799. [2024-11-13 12:46:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 735 states have (on average 1.2625850340136053) internal successors, (928), 741 states have internal predecessors, (928), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 46 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 12:46:14,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1032 transitions. [2024-11-13 12:46:14,042 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1032 transitions. Word has length 124 [2024-11-13 12:46:14,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:14,042 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1032 transitions. [2024-11-13 12:46:14,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:46:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1032 transitions. [2024-11-13 12:46:14,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 12:46:14,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:14,044 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:46:14,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (25)] Forceful destruction successful, exit code 0 [2024-11-13 12:46:14,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:14,245 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:14,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:14,246 INFO L85 PathProgramCache]: Analyzing trace with hash -817167802, now seen corresponding path program 1 times [2024-11-13 12:46:14,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:14,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183604345] [2024-11-13 12:46:14,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:14,247 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-13 12:46:14,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:14,249 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:14,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (26)] Waiting until timeout for monitored process [2024-11-13 12:46:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:14,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 12:46:14,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:15,510 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 27 treesize of output 15 [2024-11-13 12:46:15,556 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 10 proven. 74 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-13 12:46:15,556 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:46:15,818 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:15,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183604345] [2024-11-13 12:46:15,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183604345] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:46:15,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:46:15,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-11-13 12:46:15,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024932857] [2024-11-13 12:46:15,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:15,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:46:15,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:15,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:46:15,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-13 12:46:15,820 INFO L87 Difference]: Start difference. First operand 799 states and 1032 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:46:15,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:15,954 INFO L93 Difference]: Finished difference Result 1446 states and 1881 transitions. [2024-11-13 12:46:15,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:46:15,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-13 12:46:15,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:15,957 INFO L225 Difference]: With dead ends: 1446 [2024-11-13 12:46:15,957 INFO L226 Difference]: Without dead ends: 853 [2024-11-13 12:46:15,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:46:15,959 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 47 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:15,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 637 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:46:15,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2024-11-13 12:46:16,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 684. [2024-11-13 12:46:16,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 620 states have (on average 1.2580645161290323) internal successors, (780), 626 states have internal predecessors, (780), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 46 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 12:46:16,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 884 transitions. [2024-11-13 12:46:16,018 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 884 transitions. Word has length 124 [2024-11-13 12:46:16,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:16,019 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 884 transitions. [2024-11-13 12:46:16,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:46:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 884 transitions. [2024-11-13 12:46:16,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 12:46:16,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:16,021 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:46:16,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (26)] Forceful destruction successful, exit code 0 [2024-11-13 12:46:16,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:16,222 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:16,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:16,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1912597956, now seen corresponding path program 1 times [2024-11-13 12:46:16,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:16,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997409795] [2024-11-13 12:46:16,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:16,224 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-13 12:46:16,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:16,226 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:16,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (27)] Waiting until timeout for monitored process [2024-11-13 12:46:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:16,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 12:46:16,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:46:16,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:46:16,842 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:16,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997409795] [2024-11-13 12:46:16,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997409795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:46:16,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:46:16,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:46:16,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321446768] [2024-11-13 12:46:16,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:16,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:46:16,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:16,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:46:16,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:46:16,844 INFO L87 Difference]: Start difference. First operand 684 states and 884 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:46:16,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:16,927 INFO L93 Difference]: Finished difference Result 1380 states and 1787 transitions. [2024-11-13 12:46:16,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:46:16,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-13 12:46:16,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:16,931 INFO L225 Difference]: With dead ends: 1380 [2024-11-13 12:46:16,931 INFO L226 Difference]: Without dead ends: 708 [2024-11-13 12:46:16,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:46:16,932 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:16,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 600 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:46:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2024-11-13 12:46:16,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2024-11-13 12:46:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 644 states have (on average 1.2484472049689441) internal successors, (804), 650 states have internal predecessors, (804), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 46 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 12:46:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 908 transitions. [2024-11-13 12:46:16,982 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 908 transitions. Word has length 124 [2024-11-13 12:46:16,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:16,983 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 908 transitions. [2024-11-13 12:46:16,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:46:16,983 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 908 transitions. [2024-11-13 12:46:16,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 12:46:16,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:16,987 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:46:17,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (27)] Ended with exit code 0 [2024-11-13 12:46:17,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:17,187 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:17,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:17,188 INFO L85 PathProgramCache]: Analyzing trace with hash 385647049, now seen corresponding path program 1 times [2024-11-13 12:46:17,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:17,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209787275] [2024-11-13 12:46:17,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:17,188 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-13 12:46:17,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:17,190 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:17,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (28)] Waiting until timeout for monitored process [2024-11-13 12:46:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:17,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 12:46:17,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 10 proven. 74 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-13 12:46:18,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:46:18,584 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:18,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209787275] [2024-11-13 12:46:18,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209787275] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:46:18,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:46:18,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-13 12:46:18,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613375874] [2024-11-13 12:46:18,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:18,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:46:18,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:18,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:46:18,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:46:18,586 INFO L87 Difference]: Start difference. First operand 708 states and 908 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:46:18,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:18,729 INFO L93 Difference]: Finished difference Result 1473 states and 1893 transitions. [2024-11-13 12:46:18,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:46:18,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 126 [2024-11-13 12:46:18,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:18,732 INFO L225 Difference]: With dead ends: 1473 [2024-11-13 12:46:18,732 INFO L226 Difference]: Without dead ends: 777 [2024-11-13 12:46:18,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:46:18,733 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 40 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:18,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 597 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:46:18,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-11-13 12:46:18,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 707. [2024-11-13 12:46:18,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 643 states have (on average 1.244167962674961) internal successors, (800), 649 states have internal predecessors, (800), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 46 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 12:46:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 904 transitions. [2024-11-13 12:46:18,765 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 904 transitions. Word has length 126 [2024-11-13 12:46:18,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:18,765 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 904 transitions. [2024-11-13 12:46:18,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:46:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 904 transitions. [2024-11-13 12:46:18,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 12:46:18,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:18,767 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:46:18,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (28)] Ended with exit code 0 [2024-11-13 12:46:18,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:18,968 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:18,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:18,968 INFO L85 PathProgramCache]: Analyzing trace with hash -2102624920, now seen corresponding path program 1 times [2024-11-13 12:46:18,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:18,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880442293] [2024-11-13 12:46:18,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:18,969 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-13 12:46:18,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:18,971 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:18,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (29)] Waiting until timeout for monitored process [2024-11-13 12:46:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:19,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 12:46:19,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:20,016 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 24 treesize of output 20 [2024-11-13 12:46:20,226 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 28 treesize of output 20 [2024-11-13 12:46:20,234 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 24 treesize of output 16 [2024-11-13 12:46:20,280 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 23 treesize of output 15 [2024-11-13 12:46:20,444 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-13 12:46:20,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:20,918 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:46:20,918 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:20,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880442293] [2024-11-13 12:46:20,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880442293] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:46:20,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:46:20,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 14 [2024-11-13 12:46:20,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051966521] [2024-11-13 12:46:20,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:20,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:46:20,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:20,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:46:20,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:46:20,919 INFO L87 Difference]: Start difference. First operand 707 states and 904 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:46:21,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:21,963 INFO L93 Difference]: Finished difference Result 1329 states and 1697 transitions. [2024-11-13 12:46:21,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:46:21,963 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-13 12:46:21,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:21,966 INFO L225 Difference]: With dead ends: 1329 [2024-11-13 12:46:21,966 INFO L226 Difference]: Without dead ends: 731 [2024-11-13 12:46:21,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 242 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:46:21,967 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 60 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:21,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1552 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 12:46:21,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-11-13 12:46:22,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 718. [2024-11-13 12:46:22,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 651 states have (on average 1.241167434715822) internal successors, (808), 657 states have internal predecessors, (808), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (54), 48 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 12:46:22,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 916 transitions. [2024-11-13 12:46:22,030 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 916 transitions. Word has length 128 [2024-11-13 12:46:22,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:22,030 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 916 transitions. [2024-11-13 12:46:22,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:46:22,030 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 916 transitions. [2024-11-13 12:46:22,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 12:46:22,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:22,031 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:46:22,046 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (29)] Ended with exit code 0 [2024-11-13 12:46:22,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:22,232 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:22,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:22,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1422566550, now seen corresponding path program 1 times [2024-11-13 12:46:22,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:22,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069265242] [2024-11-13 12:46:22,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:22,233 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-13 12:46:22,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:22,237 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:22,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (30)] Waiting until timeout for monitored process [2024-11-13 12:46:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:22,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 12:46:22,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:22,989 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 18 treesize of output 10 [2024-11-13 12:46:23,021 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:46:23,021 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:46:23,021 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:23,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069265242] [2024-11-13 12:46:23,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069265242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:46:23,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:46:23,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:46:23,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975231068] [2024-11-13 12:46:23,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:23,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:46:23,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:23,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:46:23,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:46:23,023 INFO L87 Difference]: Start difference. First operand 718 states and 916 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:46:23,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:23,251 INFO L93 Difference]: Finished difference Result 1319 states and 1682 transitions. [2024-11-13 12:46:23,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:46:23,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-13 12:46:23,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:23,254 INFO L225 Difference]: With dead ends: 1319 [2024-11-13 12:46:23,254 INFO L226 Difference]: Without dead ends: 710 [2024-11-13 12:46:23,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 124 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-13 12:46:23,256 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 50 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:23,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 739 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:46:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-13 12:46:23,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 706. [2024-11-13 12:46:23,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 639 states have (on average 1.2363067292644758) internal successors, (790), 645 states have internal predecessors, (790), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (54), 48 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 12:46:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 898 transitions. [2024-11-13 12:46:23,287 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 898 transitions. Word has length 128 [2024-11-13 12:46:23,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:23,288 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 898 transitions. [2024-11-13 12:46:23,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:46:23,288 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 898 transitions. [2024-11-13 12:46:23,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 12:46:23,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:23,289 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:46:23,302 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (30)] Ended with exit code 0 [2024-11-13 12:46:23,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:23,489 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:23,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:23,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2119955818, now seen corresponding path program 1 times [2024-11-13 12:46:23,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:23,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041354702] [2024-11-13 12:46:23,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:23,490 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-13 12:46:23,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:23,492 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:23,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (31)] Waiting until timeout for monitored process [2024-11-13 12:46:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:24,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 12:46:24,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:24,200 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 19 treesize of output 11 [2024-11-13 12:46:24,226 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:46:24,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:46:24,226 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:24,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041354702] [2024-11-13 12:46:24,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041354702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:46:24,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:46:24,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:46:24,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135985930] [2024-11-13 12:46:24,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:24,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:46:24,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:24,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:46:24,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:46:24,227 INFO L87 Difference]: Start difference. First operand 706 states and 898 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:46:24,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:24,596 INFO L93 Difference]: Finished difference Result 1428 states and 1812 transitions. [2024-11-13 12:46:24,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:46:24,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-13 12:46:24,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:24,600 INFO L225 Difference]: With dead ends: 1428 [2024-11-13 12:46:24,600 INFO L226 Difference]: Without dead ends: 831 [2024-11-13 12:46:24,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 124 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-13 12:46:24,602 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 53 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:24,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 699 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:46:24,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2024-11-13 12:46:24,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 720. [2024-11-13 12:46:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 650 states have (on average 1.2307692307692308) internal successors, (800), 656 states have internal predecessors, (800), 56 states have call successors, (56), 13 states have call predecessors, (56), 13 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-13 12:46:24,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 912 transitions. [2024-11-13 12:46:24,658 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 912 transitions. Word has length 128 [2024-11-13 12:46:24,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:24,658 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 912 transitions. [2024-11-13 12:46:24,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:46:24,659 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 912 transitions. [2024-11-13 12:46:24,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 12:46:24,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:24,660 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:46:24,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (31)] Forceful destruction successful, exit code 0 [2024-11-13 12:46:24,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:24,861 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:24,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:24,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1494953108, now seen corresponding path program 1 times [2024-11-13 12:46:24,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:24,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258697073] [2024-11-13 12:46:24,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:24,862 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-13 12:46:24,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:24,863 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:24,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (32)] Waiting until timeout for monitored process [2024-11-13 12:46:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:25,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 12:46:25,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:25,736 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 23 treesize of output 19 [2024-11-13 12:46:25,914 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 27 treesize of output 19 [2024-11-13 12:46:25,918 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 23 treesize of output 15 [2024-11-13 12:46:25,964 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 21 treesize of output 13 [2024-11-13 12:46:26,111 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-13 12:46:26,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 12:46:26,564 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:26,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258697073] [2024-11-13 12:46:26,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258697073] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:46:26,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:46:26,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 14 [2024-11-13 12:46:26,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250767741] [2024-11-13 12:46:26,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:26,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:46:26,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:26,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:46:26,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:46:26,565 INFO L87 Difference]: Start difference. First operand 720 states and 912 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:46:27,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:27,550 INFO L93 Difference]: Finished difference Result 1442 states and 1821 transitions. [2024-11-13 12:46:27,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:46:27,551 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-13 12:46:27,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:27,554 INFO L225 Difference]: With dead ends: 1442 [2024-11-13 12:46:27,554 INFO L226 Difference]: Without dead ends: 839 [2024-11-13 12:46:27,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 242 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:46:27,555 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 53 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:27,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1662 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 12:46:27,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2024-11-13 12:46:27,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 707. [2024-11-13 12:46:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 637 states have (on average 1.2307692307692308) internal successors, (784), 643 states have internal predecessors, (784), 56 states have call successors, (56), 13 states have call predecessors, (56), 13 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-13 12:46:27,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 896 transitions. [2024-11-13 12:46:27,594 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 896 transitions. Word has length 128 [2024-11-13 12:46:27,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:27,595 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 896 transitions. [2024-11-13 12:46:27,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 12:46:27,595 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 896 transitions. [2024-11-13 12:46:27,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 12:46:27,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:27,596 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:46:27,610 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (32)] Ended with exit code 0 [2024-11-13 12:46:27,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:27,796 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:27,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:27,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1199580517, now seen corresponding path program 1 times [2024-11-13 12:46:27,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:27,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636222246] [2024-11-13 12:46:27,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:27,798 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-13 12:46:27,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:27,799 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:27,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (33)] Waiting until timeout for monitored process [2024-11-13 12:46:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:28,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 12:46:28,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:28,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:46:28,806 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 155 treesize of output 65 [2024-11-13 12:46:28,837 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-13 12:46:28,837 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:46:28,837 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:28,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636222246] [2024-11-13 12:46:28,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636222246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:46:28,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:46:28,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:46:28,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338192278] [2024-11-13 12:46:28,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:28,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:46:28,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:28,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:46:28,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:46:28,838 INFO L87 Difference]: Start difference. First operand 707 states and 896 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 12:46:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:31,482 INFO L93 Difference]: Finished difference Result 1397 states and 1773 transitions. [2024-11-13 12:46:31,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:46:31,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 128 [2024-11-13 12:46:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:31,492 INFO L225 Difference]: With dead ends: 1397 [2024-11-13 12:46:31,493 INFO L226 Difference]: Without dead ends: 710 [2024-11-13 12:46:31,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:46:31,496 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 124 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:31,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 494 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-13 12:46:31,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-13 12:46:31,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 707. [2024-11-13 12:46:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 637 states have (on average 1.2260596546310831) internal successors, (781), 643 states have internal predecessors, (781), 56 states have call successors, (56), 13 states have call predecessors, (56), 13 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-13 12:46:31,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 893 transitions. [2024-11-13 12:46:31,549 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 893 transitions. Word has length 128 [2024-11-13 12:46:31,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:31,550 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 893 transitions. [2024-11-13 12:46:31,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 12:46:31,551 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 893 transitions. [2024-11-13 12:46:31,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 12:46:31,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:31,552 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:46:31,571 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (33)] Ended with exit code 0 [2024-11-13 12:46:31,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:31,753 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:31,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:31,753 INFO L85 PathProgramCache]: Analyzing trace with hash -594906495, now seen corresponding path program 1 times [2024-11-13 12:46:31,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:31,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520544343] [2024-11-13 12:46:31,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:31,754 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-13 12:46:31,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:31,756 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:31,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (34)] Waiting until timeout for monitored process [2024-11-13 12:46:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:32,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 12:46:32,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:32,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:46:32,855 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 155 treesize of output 65 [2024-11-13 12:46:32,887 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-13 12:46:32,887 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:46:32,887 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:32,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520544343] [2024-11-13 12:46:32,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520544343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:46:32,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:46:32,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:46:32,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762920466] [2024-11-13 12:46:32,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:32,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:46:32,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:32,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:46:32,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:46:32,888 INFO L87 Difference]: Start difference. First operand 707 states and 893 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 12:46:35,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:35,607 INFO L93 Difference]: Finished difference Result 1394 states and 1764 transitions. [2024-11-13 12:46:35,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:46:35,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 130 [2024-11-13 12:46:35,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:35,615 INFO L225 Difference]: With dead ends: 1394 [2024-11-13 12:46:35,615 INFO L226 Difference]: Without dead ends: 707 [2024-11-13 12:46:35,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:46:35,617 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 117 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:35,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 486 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-13 12:46:35,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-13 12:46:35,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 701. [2024-11-13 12:46:35,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 631 states have (on average 1.2234548335974644) internal successors, (772), 637 states have internal predecessors, (772), 56 states have call successors, (56), 13 states have call predecessors, (56), 13 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-13 12:46:35,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 884 transitions. [2024-11-13 12:46:35,669 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 884 transitions. Word has length 130 [2024-11-13 12:46:35,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:35,669 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 884 transitions. [2024-11-13 12:46:35,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 12:46:35,670 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 884 transitions. [2024-11-13 12:46:35,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 12:46:35,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:35,671 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:46:35,690 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (34)] Ended with exit code 0 [2024-11-13 12:46:35,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:35,871 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:35,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:35,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1803647001, now seen corresponding path program 1 times [2024-11-13 12:46:35,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:35,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233295173] [2024-11-13 12:46:35,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:35,872 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-13 12:46:35,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:35,874 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:35,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (35)] Waiting until timeout for monitored process [2024-11-13 12:46:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:36,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 12:46:36,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:37,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:46:37,072 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 154 treesize of output 64 [2024-11-13 12:46:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 36 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-13 12:46:37,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:37,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:46:37,457 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 98 treesize of output 1 [2024-11-13 12:46:37,525 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-13 12:46:37,525 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:37,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233295173] [2024-11-13 12:46:37,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233295173] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:46:37,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:46:37,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-13 12:46:37,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025132622] [2024-11-13 12:46:37,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:46:37,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 12:46:37,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:37,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 12:46:37,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:46:37,527 INFO L87 Difference]: Start difference. First operand 701 states and 884 transitions. Second operand has 12 states, 11 states have (on average 9.909090909090908) internal successors, (109), 12 states have internal predecessors, (109), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-13 12:46:41,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:41,392 INFO L93 Difference]: Finished difference Result 1439 states and 1809 transitions. [2024-11-13 12:46:41,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:46:41,400 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.909090909090908) internal successors, (109), 12 states have internal predecessors, (109), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 132 [2024-11-13 12:46:41,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:41,404 INFO L225 Difference]: With dead ends: 1439 [2024-11-13 12:46:41,404 INFO L226 Difference]: Without dead ends: 725 [2024-11-13 12:46:41,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-13 12:46:41,406 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 128 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:41,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 746 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-13 12:46:41,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-11-13 12:46:41,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 701. [2024-11-13 12:46:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 631 states have (on average 1.213946117274168) internal successors, (766), 637 states have internal predecessors, (766), 56 states have call successors, (56), 13 states have call predecessors, (56), 13 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-13 12:46:41,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 878 transitions. [2024-11-13 12:46:41,460 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 878 transitions. Word has length 132 [2024-11-13 12:46:41,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:41,461 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 878 transitions. [2024-11-13 12:46:41,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.909090909090908) internal successors, (109), 12 states have internal predecessors, (109), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-13 12:46:41,461 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 878 transitions. [2024-11-13 12:46:41,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 12:46:41,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:41,462 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:46:41,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (35)] Ended with exit code 0 [2024-11-13 12:46:41,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:41,663 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:41,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:41,663 INFO L85 PathProgramCache]: Analyzing trace with hash 849706843, now seen corresponding path program 1 times [2024-11-13 12:46:41,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:41,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590571355] [2024-11-13 12:46:41,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:41,664 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-13 12:46:41,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:41,665 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:41,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (36)] Waiting until timeout for monitored process [2024-11-13 12:46:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:42,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 12:46:42,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:42,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:46:42,908 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 155 treesize of output 65 [2024-11-13 12:46:42,944 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-13 12:46:42,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:46:42,944 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:42,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590571355] [2024-11-13 12:46:42,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1590571355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:46:42,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:46:42,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:46:42,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589959130] [2024-11-13 12:46:42,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:42,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:46:42,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:42,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:46:42,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:46:42,946 INFO L87 Difference]: Start difference. First operand 701 states and 878 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 12:46:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:45,558 INFO L93 Difference]: Finished difference Result 1385 states and 1737 transitions. [2024-11-13 12:46:45,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:46:45,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 132 [2024-11-13 12:46:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:45,570 INFO L225 Difference]: With dead ends: 1385 [2024-11-13 12:46:45,570 INFO L226 Difference]: Without dead ends: 704 [2024-11-13 12:46:45,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:46:45,572 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 105 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:45,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 474 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-13 12:46:45,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2024-11-13 12:46:45,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 701. [2024-11-13 12:46:45,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 631 states have (on average 1.2091917591125199) internal successors, (763), 637 states have internal predecessors, (763), 56 states have call successors, (56), 13 states have call predecessors, (56), 13 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-13 12:46:45,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 875 transitions. [2024-11-13 12:46:45,623 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 875 transitions. Word has length 132 [2024-11-13 12:46:45,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:45,624 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 875 transitions. [2024-11-13 12:46:45,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 12:46:45,624 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 875 transitions. [2024-11-13 12:46:45,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 12:46:45,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:45,625 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:46:45,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (36)] Ended with exit code 0 [2024-11-13 12:46:45,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:45,826 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:45,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:45,827 INFO L85 PathProgramCache]: Analyzing trace with hash 189075777, now seen corresponding path program 1 times [2024-11-13 12:46:45,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:45,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218125565] [2024-11-13 12:46:45,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:45,827 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-13 12:46:45,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:45,830 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:45,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (37)] Waiting until timeout for monitored process [2024-11-13 12:46:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:46,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 12:46:46,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:47,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:46:47,246 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 155 treesize of output 65 [2024-11-13 12:46:47,279 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 12:46:47,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:46:47,279 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:47,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218125565] [2024-11-13 12:46:47,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218125565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:46:47,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:46:47,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:46:47,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779832119] [2024-11-13 12:46:47,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:47,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:46:47,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:47,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:46:47,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:46:47,280 INFO L87 Difference]: Start difference. First operand 701 states and 875 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 12:46:50,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:50,047 INFO L93 Difference]: Finished difference Result 1385 states and 1731 transitions. [2024-11-13 12:46:50,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:46:50,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 134 [2024-11-13 12:46:50,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:50,054 INFO L225 Difference]: With dead ends: 1385 [2024-11-13 12:46:50,054 INFO L226 Difference]: Without dead ends: 704 [2024-11-13 12:46:50,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:46:50,055 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 95 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:50,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 471 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-13 12:46:50,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2024-11-13 12:46:50,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 701. [2024-11-13 12:46:50,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 631 states have (on average 1.2044374009508716) internal successors, (760), 637 states have internal predecessors, (760), 56 states have call successors, (56), 13 states have call predecessors, (56), 13 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-13 12:46:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 872 transitions. [2024-11-13 12:46:50,092 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 872 transitions. Word has length 134 [2024-11-13 12:46:50,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:50,092 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 872 transitions. [2024-11-13 12:46:50,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 12:46:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 872 transitions. [2024-11-13 12:46:50,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 12:46:50,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:50,093 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:46:50,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (37)] Ended with exit code 0 [2024-11-13 12:46:50,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:50,294 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:50,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:50,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2095772699, now seen corresponding path program 1 times [2024-11-13 12:46:50,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:50,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016284542] [2024-11-13 12:46:50,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:50,295 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-13 12:46:50,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:50,296 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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-13 12:46:50,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_929507a7-0148-49e0-93bb-e45b079aad34/bin/uautomizer-verify-qhAvR1uOyd/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 (38)] Waiting until timeout for monitored process