./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-54.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_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-54.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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_d6a561e3-06be-4125-b164-5b61698a011a/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 803841a343f4a7b18ae8961ad2990e50b3678fbcd0340baeebfb73af8679dd6e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:26:31,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:26:32,046 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:26:32,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:26:32,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:26:32,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:26:32,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:26:32,110 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:26:32,110 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:26:32,110 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:26:32,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:26:32,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:26:32,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:26:32,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:26:32,111 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:26:32,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:26:32,112 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:26:32,112 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:26:32,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:26:32,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:26:32,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:26:32,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:26:32,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:26:32,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:26:32,113 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:26:32,113 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:26:32,113 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:26:32,113 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:26:32,113 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:26:32,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:26:32,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:26:32,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:26:32,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:26:32,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:26:32,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:26:32,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:26:32,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:26:32,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:26:32,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:26:32,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:26:32,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:26:32,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:26:32,119 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_d6a561e3-06be-4125-b164-5b61698a011a/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 -> 803841a343f4a7b18ae8961ad2990e50b3678fbcd0340baeebfb73af8679dd6e [2024-11-13 14:26:32,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:26:32,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:26:32,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:26:32,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:26:32,551 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:26:32,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-54.i Unable to find full path for "g++" [2024-11-13 14:26:34,562 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:26:34,949 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:26:34,952 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-54.i [2024-11-13 14:26:34,963 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/data/8408ef11d/e6de5f15eb8341cd9145443ce6fd6615/FLAG2bfcb7974 [2024-11-13 14:26:34,981 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/data/8408ef11d/e6de5f15eb8341cd9145443ce6fd6615 [2024-11-13 14:26:34,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:26:34,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:26:34,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:26:34,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:26:34,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:26:34,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:26:34" (1/1) ... [2024-11-13 14:26:34,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@287886a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:34, skipping insertion in model container [2024-11-13 14:26:34,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:26:34" (1/1) ... [2024-11-13 14:26:35,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:26:35,234 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_d6a561e3-06be-4125-b164-5b61698a011a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-54.i[916,929] [2024-11-13 14:26:35,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:26:35,322 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:26:35,335 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_d6a561e3-06be-4125-b164-5b61698a011a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-54.i[916,929] [2024-11-13 14:26:35,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:26:35,395 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:26:35,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:35 WrapperNode [2024-11-13 14:26:35,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:26:35,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:26:35,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:26:35,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:26:35,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:35" (1/1) ... [2024-11-13 14:26:35,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:35" (1/1) ... [2024-11-13 14:26:35,464 INFO L138 Inliner]: procedures = 29, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 495 [2024-11-13 14:26:35,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:26:35,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:26:35,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:26:35,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:26:35,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:35" (1/1) ... [2024-11-13 14:26:35,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:35" (1/1) ... [2024-11-13 14:26:35,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:35" (1/1) ... [2024-11-13 14:26:35,532 INFO L175 MemorySlicer]: Split 115 memory accesses to 13 slices as follows [2, 9, 10, 9, 6, 10, 8, 13, 18, 10, 7, 7, 6]. 16 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, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1, 1, 1]. [2024-11-13 14:26:35,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:35" (1/1) ... [2024-11-13 14:26:35,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:35" (1/1) ... [2024-11-13 14:26:35,563 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:35" (1/1) ... [2024-11-13 14:26:35,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:35" (1/1) ... [2024-11-13 14:26:35,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:35" (1/1) ... [2024-11-13 14:26:35,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:35" (1/1) ... [2024-11-13 14:26:35,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:26:35,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:26:35,597 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:26:35,597 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:26:35,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:35" (1/1) ... [2024-11-13 14:26:35,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:26:35,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:26:35,631 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:26:35,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:26:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:26:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 14:26:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 14:26:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 14:26:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 14:26:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-13 14:26:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-13 14:26:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-13 14:26:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-13 14:26:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-13 14:26:35,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-13 14:26:35,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-13 14:26:35,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-13 14:26:35,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-13 14:26:35,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-13 14:26:35,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-13 14:26:35,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-13 14:26:35,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-13 14:26:35,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-13 14:26:35,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-13 14:26:35,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-13 14:26:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-13 14:26:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-13 14:26:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-13 14:26:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-13 14:26:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-13 14:26:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-13 14:26:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-13 14:26:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-13 14:26:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-13 14:26:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-13 14:26:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-13 14:26:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-13 14:26:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-13 14:26:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-13 14:26:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-13 14:26:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-13 14:26:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-13 14:26:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-13 14:26:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-13 14:26:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 14:26:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 14:26:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 14:26:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 14:26:35,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-13 14:26:35,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-13 14:26:35,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-13 14:26:35,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-13 14:26:35,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-13 14:26:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-13 14:26:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-13 14:26:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-13 14:26:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-13 14:26:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-13 14:26:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-13 14:26:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-13 14:26:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-13 14:26:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-13 14:26:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-13 14:26:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-13 14:26:35,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-13 14:26:35,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-13 14:26:35,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-13 14:26:35,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-13 14:26:35,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-13 14:26:35,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-13 14:26:35,677 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:26:35,677 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:26:35,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:26:35,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 14:26:35,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 14:26:35,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 14:26:35,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-13 14:26:35,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-13 14:26:35,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-13 14:26:35,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-13 14:26:35,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-13 14:26:35,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-13 14:26:35,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-13 14:26:35,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-13 14:26:35,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-13 14:26:35,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:26:35,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:26:36,024 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:26:36,027 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:26:36,828 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-13 14:26:36,829 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:26:36,847 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:26:36,849 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:26:36,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:26:36 BoogieIcfgContainer [2024-11-13 14:26:36,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:26:36,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:26:36,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:26:36,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:26:36,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:26:34" (1/3) ... [2024-11-13 14:26:36,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5422a31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:26:36, skipping insertion in model container [2024-11-13 14:26:36,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:35" (2/3) ... [2024-11-13 14:26:36,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5422a31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:26:36, skipping insertion in model container [2024-11-13 14:26:36,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:26:36" (3/3) ... [2024-11-13 14:26:36,863 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-54.i [2024-11-13 14:26:36,881 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:26:36,883 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-54.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:26:36,951 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:26:36,964 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;@7b860ee2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:26:36,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:26:36,970 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 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 14:26:36,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 14:26:36,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:26:36,983 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] [2024-11-13 14:26:36,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:26:36,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:26:36,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1225739204, now seen corresponding path program 1 times [2024-11-13 14:26:36,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:26:36,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856393904] [2024-11-13 14:26:36,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:26:36,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:26:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:37,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:26:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:37,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:26:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:37,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:26:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:37,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:26:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:37,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:26:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:37,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:26:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:37,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:26:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:37,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:26:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:37,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:26:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:37,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:26:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:37,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:26:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:37,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:26:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:37,438 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 14:26:37,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:26:37,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856393904] [2024-11-13 14:26:37,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856393904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:26:37,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:26:37,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:26:37,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278297818] [2024-11-13 14:26:37,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:26:37,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:26:37,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:26:37,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:26:37,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:26:37,481 INFO L87 Difference]: Start difference. First operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 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 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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 14:26:37,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:26:37,526 INFO L93 Difference]: Finished difference Result 213 states and 330 transitions. [2024-11-13 14:26:37,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:26:37,529 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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 105 [2024-11-13 14:26:37,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:26:37,538 INFO L225 Difference]: With dead ends: 213 [2024-11-13 14:26:37,538 INFO L226 Difference]: Without dead ends: 106 [2024-11-13 14:26:37,542 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 14:26:37,548 INFO L432 NwaCegarLoop]: 155 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, 155 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 14:26:37,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:26:37,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-13 14:26:37,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-13 14:26:37,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 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 14:26:37,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-13 14:26:37,604 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 105 [2024-11-13 14:26:37,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:26:37,606 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-13 14:26:37,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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 14:26:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-13 14:26:37,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 14:26:37,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:26:37,615 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] [2024-11-13 14:26:37,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:26:37,616 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:26:37,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:26:37,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2000187248, now seen corresponding path program 1 times [2024-11-13 14:26:37,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:26:37,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051799] [2024-11-13 14:26:37,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:26:37,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:26:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:38,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:26:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:38,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:26:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:38,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:26:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:38,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:26:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:38,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:26:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:38,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:26:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:38,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:26:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:38,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:26:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:38,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:26:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:38,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:26:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:38,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:26:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:38,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:26:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:38,313 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 14:26:38,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:26:38,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051799] [2024-11-13 14:26:38,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:26:38,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:26:38,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:26:38,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865421330] [2024-11-13 14:26:38,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:26:38,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:26:38,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:26:38,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:26:38,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:26:38,319 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 14:26:38,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:26:38,409 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2024-11-13 14:26:38,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:26:38,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 105 [2024-11-13 14:26:38,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:26:38,418 INFO L225 Difference]: With dead ends: 211 [2024-11-13 14:26:38,420 INFO L226 Difference]: Without dead ends: 108 [2024-11-13 14:26:38,421 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 14:26:38,424 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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 14:26:38,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:26:38,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-13 14:26:38,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-13 14:26:38,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 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 14:26:38,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-13 14:26:38,456 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 105 [2024-11-13 14:26:38,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:26:38,458 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-13 14:26:38,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 14:26:38,458 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-13 14:26:38,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 14:26:38,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:26:38,464 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] [2024-11-13 14:26:38,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:26:38,465 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:26:38,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:26:38,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1397386770, now seen corresponding path program 1 times [2024-11-13 14:26:38,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:26:38,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722257042] [2024-11-13 14:26:38,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:26:38,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:26:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:38,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:26:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:38,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:26:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:38,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:26:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:38,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:26:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:38,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:26:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:38,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:26:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:38,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:26:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:38,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:26:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:26:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:26:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:26:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:26:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,031 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 14:26:39,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:26:39,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722257042] [2024-11-13 14:26:39,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722257042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:26:39,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:26:39,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:26:39,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247500716] [2024-11-13 14:26:39,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:26:39,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:26:39,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:26:39,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:26:39,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:26:39,038 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 14:26:39,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:26:39,104 INFO L93 Difference]: Finished difference Result 215 states and 314 transitions. [2024-11-13 14:26:39,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:26:39,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 105 [2024-11-13 14:26:39,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:26:39,110 INFO L225 Difference]: With dead ends: 215 [2024-11-13 14:26:39,110 INFO L226 Difference]: Without dead ends: 110 [2024-11-13 14:26:39,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 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 14:26:39,112 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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 14:26:39,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:26:39,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-13 14:26:39,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-13 14:26:39,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.40625) internal successors, (135), 96 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 14:26:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-11-13 14:26:39,135 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 105 [2024-11-13 14:26:39,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:26:39,135 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-11-13 14:26:39,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 14:26:39,136 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-11-13 14:26:39,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 14:26:39,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:26:39,142 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] [2024-11-13 14:26:39,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:26:39,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:26:39,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:26:39,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1873109815, now seen corresponding path program 1 times [2024-11-13 14:26:39,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:26:39,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142347343] [2024-11-13 14:26:39,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:26:39,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:26:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:26:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:26:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:26:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:26:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:26:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:26:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:26:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:26:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:26:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:26:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:26:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:26:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,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 14:26:39,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:26:39,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142347343] [2024-11-13 14:26:39,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142347343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:26:39,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:26:39,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:26:39,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793256389] [2024-11-13 14:26:39,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:26:39,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:26:39,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:26:39,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:26:39,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:26:39,484 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 14:26:39,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:26:39,545 INFO L93 Difference]: Finished difference Result 220 states and 319 transitions. [2024-11-13 14:26:39,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:26:39,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 107 [2024-11-13 14:26:39,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:26:39,550 INFO L225 Difference]: With dead ends: 220 [2024-11-13 14:26:39,550 INFO L226 Difference]: Without dead ends: 113 [2024-11-13 14:26:39,550 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 14:26:39,551 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:26:39,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:26:39,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-13 14:26:39,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-13 14:26:39,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 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 14:26:39,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2024-11-13 14:26:39,574 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 107 [2024-11-13 14:26:39,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:26:39,575 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2024-11-13 14:26:39,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 14:26:39,575 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2024-11-13 14:26:39,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 14:26:39,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:26:39,579 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] [2024-11-13 14:26:39,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:26:39,580 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:26:39,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:26:39,580 INFO L85 PathProgramCache]: Analyzing trace with hash -98102453, now seen corresponding path program 1 times [2024-11-13 14:26:39,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:26:39,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388371825] [2024-11-13 14:26:39,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:26:39,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:26:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:26:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:26:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:26:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:26:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:26:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:26:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:26:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:26:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:26:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:26:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:26:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:26:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:39,857 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 14:26:39,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:26:39,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388371825] [2024-11-13 14:26:39,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388371825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:26:39,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:26:39,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:26:39,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522826814] [2024-11-13 14:26:39,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:26:39,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:26:39,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:26:39,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:26:39,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:26:39,860 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 14:26:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:26:39,894 INFO L93 Difference]: Finished difference Result 224 states and 323 transitions. [2024-11-13 14:26:39,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:26:39,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 107 [2024-11-13 14:26:39,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:26:39,897 INFO L225 Difference]: With dead ends: 224 [2024-11-13 14:26:39,897 INFO L226 Difference]: Without dead ends: 115 [2024-11-13 14:26:39,897 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 14:26:39,898 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:26:39,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:26:39,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-13 14:26:39,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-13 14:26:39,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 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 14:26:39,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2024-11-13 14:26:39,908 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 107 [2024-11-13 14:26:39,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:26:39,909 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2024-11-13 14:26:39,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 14:26:39,909 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2024-11-13 14:26:39,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 14:26:39,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:26:39,911 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] [2024-11-13 14:26:39,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:26:39,912 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:26:39,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:26:39,912 INFO L85 PathProgramCache]: Analyzing trace with hash -96255411, now seen corresponding path program 1 times [2024-11-13 14:26:39,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:26:39,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731952662] [2024-11-13 14:26:39,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:26:39,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:26:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:26:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:26:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:26:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:26:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:26:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:26:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:26:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:26:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:26:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:26:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:26:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:26:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,328 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 14:26:40,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:26:40,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731952662] [2024-11-13 14:26:40,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731952662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:26:40,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:26:40,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:26:40,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45148439] [2024-11-13 14:26:40,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:26:40,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:26:40,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:26:40,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:26:40,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:26:40,332 INFO L87 Difference]: Start difference. First operand 114 states and 163 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 14:26:40,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:26:40,538 INFO L93 Difference]: Finished difference Result 329 states and 472 transitions. [2024-11-13 14:26:40,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:26:40,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 107 [2024-11-13 14:26:40,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:26:40,541 INFO L225 Difference]: With dead ends: 329 [2024-11-13 14:26:40,542 INFO L226 Difference]: Without dead ends: 218 [2024-11-13 14:26:40,542 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 14:26:40,545 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 137 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 558 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.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:26:40,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 558 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:26:40,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-13 14:26:40,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 135. [2024-11-13 14:26:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 121 states have (on average 1.421487603305785) internal successors, (172), 121 states have internal predecessors, (172), 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 14:26:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 196 transitions. [2024-11-13 14:26:40,570 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 196 transitions. Word has length 107 [2024-11-13 14:26:40,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:26:40,570 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 196 transitions. [2024-11-13 14:26:40,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 14:26:40,571 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 196 transitions. [2024-11-13 14:26:40,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 14:26:40,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:26:40,575 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] [2024-11-13 14:26:40,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:26:40,576 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:26:40,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:26:40,576 INFO L85 PathProgramCache]: Analyzing trace with hash -519169701, now seen corresponding path program 1 times [2024-11-13 14:26:40,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:26:40,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763455901] [2024-11-13 14:26:40,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:26:40,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:26:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:26:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:26:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:26:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:26:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:26:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:26:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:26:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:26:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:26:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:40,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:26:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:41,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:26:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:41,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:26:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:41,022 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 14:26:41,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:26:41,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763455901] [2024-11-13 14:26:41,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763455901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:26:41,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:26:41,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:26:41,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925766798] [2024-11-13 14:26:41,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:26:41,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:26:41,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:26:41,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:26:41,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:26:41,024 INFO L87 Difference]: Start difference. First operand 135 states and 196 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 14:26:41,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:26:41,099 INFO L93 Difference]: Finished difference Result 374 states and 542 transitions. [2024-11-13 14:26:41,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:26:41,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 108 [2024-11-13 14:26:41,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:26:41,102 INFO L225 Difference]: With dead ends: 374 [2024-11-13 14:26:41,102 INFO L226 Difference]: Without dead ends: 242 [2024-11-13 14:26:41,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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 14:26:41,104 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 109 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:26:41,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 440 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:26:41,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-13 14:26:41,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 238. [2024-11-13 14:26:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 211 states have (on average 1.4028436018957346) internal successors, (296), 211 states have internal predecessors, (296), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:26:41,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 344 transitions. [2024-11-13 14:26:41,127 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 344 transitions. Word has length 108 [2024-11-13 14:26:41,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:26:41,131 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 344 transitions. [2024-11-13 14:26:41,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 14:26:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 344 transitions. [2024-11-13 14:26:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 14:26:41,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:26:41,133 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] [2024-11-13 14:26:41,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:26:41,133 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:26:41,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:26:41,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1336818151, now seen corresponding path program 1 times [2024-11-13 14:26:41,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:26:41,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678702019] [2024-11-13 14:26:41,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:26:41,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:26:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:41,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:26:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:41,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:26:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:41,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:26:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:41,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:26:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:41,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:26:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:41,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:26:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:41,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:26:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:41,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:26:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:41,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:26:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:41,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:26:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:41,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:26:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:41,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:26:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:41,624 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 14:26:41,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:26:41,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678702019] [2024-11-13 14:26:41,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678702019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:26:41,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:26:41,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:26:41,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652506293] [2024-11-13 14:26:41,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:26:41,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:26:41,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:26:41,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:26:41,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:26:41,628 INFO L87 Difference]: Start difference. First operand 238 states and 344 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 14:26:41,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:26:41,817 INFO L93 Difference]: Finished difference Result 477 states and 689 transitions. [2024-11-13 14:26:41,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:26:41,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 108 [2024-11-13 14:26:41,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:26:41,823 INFO L225 Difference]: With dead ends: 477 [2024-11-13 14:26:41,823 INFO L226 Difference]: Without dead ends: 242 [2024-11-13 14:26:41,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:26:41,825 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 101 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:26:41,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 559 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:26:41,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-13 14:26:41,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 238. [2024-11-13 14:26:41,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 211 states have (on average 1.3981042654028435) internal successors, (295), 211 states have internal predecessors, (295), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:26:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 343 transitions. [2024-11-13 14:26:41,859 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 343 transitions. Word has length 108 [2024-11-13 14:26:41,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:26:41,860 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 343 transitions. [2024-11-13 14:26:41,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 14:26:41,860 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 343 transitions. [2024-11-13 14:26:41,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 14:26:41,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:26:41,862 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] [2024-11-13 14:26:41,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:26:41,863 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:26:41,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:26:41,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1923624165, now seen corresponding path program 1 times [2024-11-13 14:26:41,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:26:41,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620040787] [2024-11-13 14:26:41,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:26:41,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:26:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:43,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:26:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:43,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:26:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:43,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:26:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:43,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:26:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:43,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:26:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:43,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:26:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:43,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:26:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:43,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:26:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:43,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:26:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:43,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:26:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:43,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:26:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:43,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:26:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:43,173 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 14:26:43,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:26:43,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620040787] [2024-11-13 14:26:43,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620040787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:26:43,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:26:43,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:26:43,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214913630] [2024-11-13 14:26:43,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:26:43,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:26:43,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:26:43,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:26:43,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:26:43,175 INFO L87 Difference]: Start difference. First operand 238 states and 343 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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 14:26:43,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:26:43,729 INFO L93 Difference]: Finished difference Result 603 states and 858 transitions. [2024-11-13 14:26:43,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:26:43,730 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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 108 [2024-11-13 14:26:43,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:26:43,733 INFO L225 Difference]: With dead ends: 603 [2024-11-13 14:26:43,736 INFO L226 Difference]: Without dead ends: 368 [2024-11-13 14:26:43,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:26:43,738 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 453 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:26:43,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 784 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:26:43,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-13 14:26:43,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 364. [2024-11-13 14:26:43,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 323 states have (on average 1.3653250773993808) internal successors, (441), 325 states have internal predecessors, (441), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:26:43,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 513 transitions. [2024-11-13 14:26:43,796 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 513 transitions. Word has length 108 [2024-11-13 14:26:43,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:26:43,797 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 513 transitions. [2024-11-13 14:26:43,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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 14:26:43,797 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 513 transitions. [2024-11-13 14:26:43,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 14:26:43,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:26:43,800 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] [2024-11-13 14:26:43,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 14:26:43,800 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:26:43,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:26:43,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1934384634, now seen corresponding path program 1 times [2024-11-13 14:26:43,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:26:43,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941763984] [2024-11-13 14:26:43,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:26:43,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:26:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:44,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:26:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:44,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:26:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:44,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:26:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:44,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:26:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:44,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:26:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:44,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:26:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:44,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:26:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:44,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:26:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:44,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:26:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:44,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:26:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:44,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:26:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:44,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:26:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:44,115 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 14:26:44,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:26:44,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941763984] [2024-11-13 14:26:44,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941763984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:26:44,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:26:44,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:26:44,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886355622] [2024-11-13 14:26:44,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:26:44,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:26:44,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:26:44,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:26:44,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:26:44,118 INFO L87 Difference]: Start difference. First operand 364 states and 513 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 14:26:44,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:26:44,239 INFO L93 Difference]: Finished difference Result 681 states and 964 transitions. [2024-11-13 14:26:44,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:26:44,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 109 [2024-11-13 14:26:44,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:26:44,244 INFO L225 Difference]: With dead ends: 681 [2024-11-13 14:26:44,245 INFO L226 Difference]: Without dead ends: 483 [2024-11-13 14:26:44,245 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 14:26:44,246 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 84 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:26:44,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 785 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:26:44,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-13 14:26:44,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 390. [2024-11-13 14:26:44,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 349 states have (on average 1.3782234957020056) internal successors, (481), 351 states have internal predecessors, (481), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:26:44,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 553 transitions. [2024-11-13 14:26:44,286 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 553 transitions. Word has length 109 [2024-11-13 14:26:44,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:26:44,286 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 553 transitions. [2024-11-13 14:26:44,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 14:26:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 553 transitions. [2024-11-13 14:26:44,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 14:26:44,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:26:44,288 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] [2024-11-13 14:26:44,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 14:26:44,289 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:26:44,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:26:44,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1349465412, now seen corresponding path program 1 times [2024-11-13 14:26:44,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:26:44,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280849370] [2024-11-13 14:26:44,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:26:44,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:26:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:45,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:26:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:45,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:26:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:45,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:26:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:45,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:26:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:45,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:26:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:45,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:26:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:45,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:26:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:45,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:26:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:45,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:26:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:45,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:26:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:45,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:26:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:45,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:26:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:45,165 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 14:26:45,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:26:45,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280849370] [2024-11-13 14:26:45,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280849370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:26:45,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:26:45,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:26:45,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104664240] [2024-11-13 14:26:45,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:26:45,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:26:45,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:26:45,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:26:45,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:26:45,168 INFO L87 Difference]: Start difference. First operand 390 states and 553 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 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 14:26:45,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:26:45,524 INFO L93 Difference]: Finished difference Result 788 states and 1119 transitions. [2024-11-13 14:26:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:26:45,525 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 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 109 [2024-11-13 14:26:45,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:26:45,529 INFO L225 Difference]: With dead ends: 788 [2024-11-13 14:26:45,529 INFO L226 Difference]: Without dead ends: 564 [2024-11-13 14:26:45,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:26:45,531 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 142 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:26:45,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1941 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:26:45,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2024-11-13 14:26:45,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 555. [2024-11-13 14:26:45,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 494 states have (on average 1.3663967611336032) internal successors, (675), 497 states have internal predecessors, (675), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 14:26:45,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 783 transitions. [2024-11-13 14:26:45,600 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 783 transitions. Word has length 109 [2024-11-13 14:26:45,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:26:45,601 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 783 transitions. [2024-11-13 14:26:45,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 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 14:26:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 783 transitions. [2024-11-13 14:26:45,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 14:26:45,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:26:45,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] [2024-11-13 14:26:45,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 14:26:45,603 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:26:45,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:26:45,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1800371128, now seen corresponding path program 1 times [2024-11-13 14:26:45,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:26:45,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207553519] [2024-11-13 14:26:45,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:26:45,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:26:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:46,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:26:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:46,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:26:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:46,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:26:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:46,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:26:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:46,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:26:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:46,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:26:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:46,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:26:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:46,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:26:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:46,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:26:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:46,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:26:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:46,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:26:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:46,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:26:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:46,751 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 14:26:46,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:26:46,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207553519] [2024-11-13 14:26:46,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207553519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:26:46,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:26:46,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 14:26:46,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781945566] [2024-11-13 14:26:46,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:26:46,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:26:46,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:26:46,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:26:46,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:26:46,754 INFO L87 Difference]: Start difference. First operand 555 states and 783 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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 14:26:47,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:26:47,157 INFO L93 Difference]: Finished difference Result 1039 states and 1464 transitions. [2024-11-13 14:26:47,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:26:47,158 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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 109 [2024-11-13 14:26:47,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:26:47,162 INFO L225 Difference]: With dead ends: 1039 [2024-11-13 14:26:47,162 INFO L226 Difference]: Without dead ends: 650 [2024-11-13 14:26:47,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:26:47,165 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 88 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:26:47,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1667 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:26:47,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-11-13 14:26:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 557. [2024-11-13 14:26:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 496 states have (on average 1.3649193548387097) internal successors, (677), 499 states have internal predecessors, (677), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 14:26:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 785 transitions. [2024-11-13 14:26:47,218 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 785 transitions. Word has length 109 [2024-11-13 14:26:47,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:26:47,219 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 785 transitions. [2024-11-13 14:26:47,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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 14:26:47,220 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 785 transitions. [2024-11-13 14:26:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 14:26:47,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:26:47,222 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] [2024-11-13 14:26:47,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 14:26:47,222 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:26:47,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:26:47,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1483478918, now seen corresponding path program 1 times [2024-11-13 14:26:47,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:26:47,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384895616] [2024-11-13 14:26:47,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:26:47,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:26:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:47,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:26:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:47,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:26:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:47,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:26:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:47,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:26:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:47,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:26:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:47,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:26:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:47,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:26:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:47,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:26:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:47,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:26:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:47,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:26:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:47,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:26:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:47,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:26:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:47,523 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 14:26:47,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:26:47,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384895616] [2024-11-13 14:26:47,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384895616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:26:47,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:26:47,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:26:47,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660889375] [2024-11-13 14:26:47,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:26:47,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:26:47,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:26:47,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:26:47,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:26:47,526 INFO L87 Difference]: Start difference. First operand 557 states and 785 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 14:26:47,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:26:47,646 INFO L93 Difference]: Finished difference Result 1027 states and 1448 transitions. [2024-11-13 14:26:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:26:47,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 109 [2024-11-13 14:26:47,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:26:47,651 INFO L225 Difference]: With dead ends: 1027 [2024-11-13 14:26:47,651 INFO L226 Difference]: Without dead ends: 636 [2024-11-13 14:26:47,652 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 14:26:47,653 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 81 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:26:47,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 832 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:26:47,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-13 14:26:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 551. [2024-11-13 14:26:47,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 490 states have (on average 1.3612244897959183) internal successors, (667), 493 states have internal predecessors, (667), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 14:26:47,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 775 transitions. [2024-11-13 14:26:47,710 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 775 transitions. Word has length 109 [2024-11-13 14:26:47,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:26:47,710 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 775 transitions. [2024-11-13 14:26:47,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 14:26:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 775 transitions. [2024-11-13 14:26:47,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 14:26:47,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:26:47,713 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] [2024-11-13 14:26:47,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 14:26:47,713 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:26:47,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:26:47,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1337407117, now seen corresponding path program 1 times [2024-11-13 14:26:47,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:26:47,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036365024] [2024-11-13 14:26:47,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:26:47,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:26:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:48,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:26:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:48,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:26:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:48,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:26:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:48,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:26:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:48,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:26:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:48,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:26:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:48,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:26:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:48,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:26:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:48,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:26:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:48,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:26:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:48,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:26:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:48,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:26:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:48,130 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 14:26:48,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:26:48,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036365024] [2024-11-13 14:26:48,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036365024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:26:48,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:26:48,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:26:48,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355894018] [2024-11-13 14:26:48,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:26:48,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:26:48,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:26:48,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:26:48,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:26:48,133 INFO L87 Difference]: Start difference. First operand 551 states and 775 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (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 14:26:48,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:26:48,265 INFO L93 Difference]: Finished difference Result 621 states and 862 transitions. [2024-11-13 14:26:48,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:26:48,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (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 110 [2024-11-13 14:26:48,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:26:48,271 INFO L225 Difference]: With dead ends: 621 [2024-11-13 14:26:48,271 INFO L226 Difference]: Without dead ends: 619 [2024-11-13 14:26:48,271 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 14:26:48,272 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 125 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:26:48,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 841 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:26:48,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-13 14:26:48,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 618. [2024-11-13 14:26:48,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 543 states have (on average 1.3370165745856353) internal successors, (726), 547 states have internal predecessors, (726), 64 states have call successors, (64), 10 states have call predecessors, (64), 10 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 14:26:48,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 854 transitions. [2024-11-13 14:26:48,353 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 854 transitions. Word has length 110 [2024-11-13 14:26:48,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:26:48,354 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 854 transitions. [2024-11-13 14:26:48,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (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 14:26:48,354 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 854 transitions. [2024-11-13 14:26:48,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 14:26:48,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:26:48,359 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] [2024-11-13 14:26:48,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 14:26:48,359 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:26:48,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:26:48,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1339254159, now seen corresponding path program 1 times [2024-11-13 14:26:48,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:26:48,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96744039] [2024-11-13 14:26:48,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:26:48,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:26:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:26:48,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:26:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:26:48,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:26:48,661 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:26:48,662 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:26:48,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 14:26:48,668 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:26:48,906 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:26:48,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:26:48 BoogieIcfgContainer [2024-11-13 14:26:48,910 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:26:48,913 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:26:48,914 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:26:48,914 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:26:48,915 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:26:36" (3/4) ... [2024-11-13 14:26:48,919 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:26:48,920 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:26:48,921 INFO L158 Benchmark]: Toolchain (without parser) took 13936.70ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 94.3MB in the beginning and 368.1MB in the end (delta: -273.7MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2024-11-13 14:26:48,921 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 167.8MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:26:48,922 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.47ms. Allocated memory is still 117.4MB. Free memory was 94.0MB in the beginning and 80.0MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:26:48,922 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.68ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 76.7MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:26:48,922 INFO L158 Benchmark]: Boogie Preprocessor took 130.36ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 72.3MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:26:48,923 INFO L158 Benchmark]: RCFGBuilder took 1253.57ms. Allocated memory is still 117.4MB. Free memory was 72.3MB in the beginning and 85.6MB in the end (delta: -13.2MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2024-11-13 14:26:48,923 INFO L158 Benchmark]: TraceAbstraction took 12057.79ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 85.0MB in the beginning and 368.1MB in the end (delta: -283.1MB). Peak memory consumption was 250.2MB. Max. memory is 16.1GB. [2024-11-13 14:26:48,924 INFO L158 Benchmark]: Witness Printer took 6.91ms. Allocated memory is still 427.8MB. Free memory was 368.1MB in the beginning and 368.1MB in the end (delta: 56.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:26:48,926 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.43ms. Allocated memory is still 167.8MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.47ms. Allocated memory is still 117.4MB. Free memory was 94.0MB in the beginning and 80.0MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.68ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 76.7MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 130.36ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 72.3MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1253.57ms. Allocated memory is still 117.4MB. Free memory was 72.3MB in the beginning and 85.6MB in the end (delta: -13.2MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12057.79ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 85.0MB in the beginning and 368.1MB in the end (delta: -283.1MB). Peak memory consumption was 250.2MB. Max. memory is 16.1GB. * Witness Printer took 6.91ms. Allocated memory is still 427.8MB. Free memory was 368.1MB in the beginning and 368.1MB in the end (delta: 56.6kB). Peak memory consumption was 8.4MB. 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 someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L22] unsigned char var_1_1 = 16; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_3 = 10; [L24] unsigned char var_1_3 = 10; [L25] unsigned char* var_1_3_Pointer = &(var_1_3); [L26] unsigned char var_1_4 = 0; [L26] unsigned char var_1_4 = 0; [L27] unsigned char* var_1_4_Pointer = &(var_1_4); [L28] unsigned char var_1_6 = 1; [L28] unsigned char var_1_6 = 1; [L29] unsigned char* var_1_6_Pointer = &(var_1_6); [L30] unsigned char var_1_9 = 0; [L30] unsigned char var_1_9 = 0; [L31] unsigned char* var_1_9_Pointer = &(var_1_9); [L32] unsigned char var_1_10 = 0; [L32] unsigned char var_1_10 = 0; [L33] unsigned char* var_1_10_Pointer = &(var_1_10); [L34] double var_1_11 = 9.75; [L34] double var_1_11 = 9.75; [L35] double* var_1_11_Pointer = &(var_1_11); [L36] double var_1_12 = 5.5; [L36] double var_1_12 = 5.5; [L37] double* var_1_12_Pointer = &(var_1_12); [L38] double var_1_13 = 4.1; [L38] double var_1_13 = 4.1; [L39] double* var_1_13_Pointer = &(var_1_13); [L40] float var_1_14 = 9.8; [L40] float var_1_14 = 9.8; [L41] float* var_1_14_Pointer = &(var_1_14); [L42] signed char var_1_15 = 25; [L42] signed char var_1_15 = 25; [L43] signed char* var_1_15_Pointer = &(var_1_15); [L44] signed char var_1_16 = 2; [L44] signed char var_1_16 = 2; [L45] signed char* var_1_16_Pointer = &(var_1_16); VAL [isInitial=0, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] FCALL updateLastVariables() [L112] CALL updateVariables() [L81] var_1_3 = __VERIFIER_nondet_uchar() [L82] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L83] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L83] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L83] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L84] var_1_6 = __VERIFIER_nondet_uchar() [L85] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L85] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L85] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L87] var_1_9 = __VERIFIER_nondet_uchar() [L88] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L89] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L89] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L89] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] var_1_10 = __VERIFIER_nondet_uchar() [L91] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L91] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L91] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L92] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L92] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L92] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L93] var_1_12 = __VERIFIER_nondet_double() [L94] EXPR \read(var_1_12) [L94] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F [L94] EXPR \read(var_1_12) [L94] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] EXPR (var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] EXPR (var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L95] var_1_13 = __VERIFIER_nondet_double() [L96] EXPR \read(var_1_13) [L96] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F [L96] EXPR \read(var_1_13) [L96] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L97] var_1_16 = __VERIFIER_nondet_char() [L98] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L99] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L99] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L99] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L112] RET updateVariables() [L113] CALL step() [L49] EXPR \read(*var_1_12_Pointer) [L49] (*(var_1_14_Pointer)) = (*(var_1_12_Pointer)) [L50] EXPR \read(*var_1_16_Pointer) [L50] (*(var_1_15_Pointer)) = (*(var_1_16_Pointer)) [L51] signed long int stepLocal_0 = -4; [L52] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L52] COND FALSE !(stepLocal_0 >= (*(var_1_15_Pointer))) [L55] EXPR \read(*var_1_3_Pointer) [L55] unsigned char stepLocal_2 = (*(var_1_3_Pointer)); [L56] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L56] COND FALSE !((*(var_1_9_Pointer))) [L65] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L65] EXPR ((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer))) [L65] EXPR \read(*var_1_1_Pointer) [L65] EXPR ((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer))) VAL [isInitial=1, stepLocal_2=254, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L65] signed long int stepLocal_1 = (((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))); [L66] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L66] COND FALSE !((8 * (*(var_1_1_Pointer))) == stepLocal_1) [L77] EXPR \read(*var_1_10_Pointer) [L77] (*(var_1_4_Pointer)) = (*(var_1_10_Pointer)) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR (-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 [L104] EXPR (-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR ((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR ((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) [L104] EXPR \read(*var_1_1_Pointer) [L104] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR ((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer))) [L104] EXPR \read(*var_1_1_Pointer) [L104] EXPR ((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR ((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))) [L104] EXPR \read(*var_1_4_Pointer) [L104] EXPR \read(*var_1_10_Pointer) [L104] EXPR ((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR ((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR (((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR (((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1) [L104] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR (*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1 [L104] EXPR (*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1 VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR (((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR ((((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1)) && ((*(var_1_14_Pointer)) == ((float) (*(var_1_12_Pointer)))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR ((((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1)) && ((*(var_1_14_Pointer)) == ((float) (*(var_1_12_Pointer)))) [L104] EXPR \read(*var_1_14_Pointer) [L104] EXPR \read(*var_1_12_Pointer) [L104] EXPR ((((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1)) && ((*(var_1_14_Pointer)) == ((float) (*(var_1_12_Pointer)))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR (((((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1)) && ((*(var_1_14_Pointer)) == ((float) (*(var_1_12_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR (((((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1)) && ((*(var_1_14_Pointer)) == ((float) (*(var_1_12_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104-L105] return (((((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1)) && ((*(var_1_14_Pointer)) == ((float) (*(var_1_12_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 15, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1322 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1322 mSDsluCounter, 10351 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7844 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 833 IncrementalHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 2507 mSDtfsCounter, 833 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 449 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=618occurred in iteration=14, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 378 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 1616 NumberOfCodeBlocks, 1616 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1492 ConstructedInterpolants, 0 QuantifiedInterpolants, 3130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 3696/3696 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 14:26:48,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-54.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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_d6a561e3-06be-4125-b164-5b61698a011a/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 803841a343f4a7b18ae8961ad2990e50b3678fbcd0340baeebfb73af8679dd6e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:26:51,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:26:51,933 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:26:51,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:26:51,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:26:51,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:26:51,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:26:51,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:26:51,985 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:26:51,986 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:26:51,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:26:51,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:26:51,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:26:51,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:26:51,988 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:26:51,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:26:51,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:26:51,989 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:26:51,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:26:51,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:26:51,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:26:51,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:26:51,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:26:51,991 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:26:51,991 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:26:51,992 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:26:51,992 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:26:51,992 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:26:51,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:26:51,992 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:26:51,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:26:51,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:26:51,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:26:51,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:26:51,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:26:51,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:26:51,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:26:51,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:26:51,994 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:26:51,994 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:26:51,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:26:51,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:26:51,995 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:26:51,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:26:51,995 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_d6a561e3-06be-4125-b164-5b61698a011a/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 -> 803841a343f4a7b18ae8961ad2990e50b3678fbcd0340baeebfb73af8679dd6e [2024-11-13 14:26:52,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:26:52,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:26:52,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:26:52,423 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:26:52,424 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:26:52,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-54.i Unable to find full path for "g++" [2024-11-13 14:26:54,582 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:26:54,932 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:26:54,937 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-54.i [2024-11-13 14:26:54,955 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/data/15b95a4e7/002e82fdcff1440eaf8907faed47fa6d/FLAG503ea963b [2024-11-13 14:26:55,191 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/data/15b95a4e7/002e82fdcff1440eaf8907faed47fa6d [2024-11-13 14:26:55,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:26:55,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:26:55,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:26:55,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:26:55,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:26:55,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:26:55" (1/1) ... [2024-11-13 14:26:55,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1266c688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:55, skipping insertion in model container [2024-11-13 14:26:55,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:26:55" (1/1) ... [2024-11-13 14:26:55,239 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:26:55,415 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_d6a561e3-06be-4125-b164-5b61698a011a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-54.i[916,929] [2024-11-13 14:26:55,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:26:55,509 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:26:55,521 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_d6a561e3-06be-4125-b164-5b61698a011a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-54.i[916,929] [2024-11-13 14:26:55,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:26:55,585 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:26:55,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:55 WrapperNode [2024-11-13 14:26:55,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:26:55,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:26:55,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:26:55,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:26:55,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:55" (1/1) ... [2024-11-13 14:26:55,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:55" (1/1) ... [2024-11-13 14:26:55,671 INFO L138 Inliner]: procedures = 33, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 494 [2024-11-13 14:26:55,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:26:55,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:26:55,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:26:55,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:26:55,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:55" (1/1) ... [2024-11-13 14:26:55,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:55" (1/1) ... [2024-11-13 14:26:55,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:55" (1/1) ... [2024-11-13 14:26:55,744 INFO L175 MemorySlicer]: Split 115 memory accesses to 13 slices as follows [2, 9, 10, 9, 6, 10, 8, 13, 18, 10, 7, 7, 6]. 16 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, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1, 1, 1]. [2024-11-13 14:26:55,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:55" (1/1) ... [2024-11-13 14:26:55,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:55" (1/1) ... [2024-11-13 14:26:55,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:55" (1/1) ... [2024-11-13 14:26:55,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:55" (1/1) ... [2024-11-13 14:26:55,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:55" (1/1) ... [2024-11-13 14:26:55,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:55" (1/1) ... [2024-11-13 14:26:55,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:26:55,847 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:26:55,847 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:26:55,847 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:26:55,853 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:55" (1/1) ... [2024-11-13 14:26:55,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:26:55,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:26:55,893 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:26:55,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:26:55,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:26:55,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-13 14:26:55,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-13 14:26:55,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-13 14:26:55,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-13 14:26:55,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-13 14:26:55,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-13 14:26:55,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-13 14:26:55,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-13 14:26:55,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-11-13 14:26:55,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-11-13 14:26:55,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-11-13 14:26:55,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-11-13 14:26:55,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-11-13 14:26:55,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-13 14:26:55,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-13 14:26:55,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-13 14:26:55,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-13 14:26:55,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-13 14:26:55,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-13 14:26:55,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-13 14:26:55,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-13 14:26:55,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-11-13 14:26:55,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-11-13 14:26:55,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-11-13 14:26:55,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-11-13 14:26:55,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-11-13 14:26:55,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-13 14:26:55,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-13 14:26:55,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-13 14:26:55,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-13 14:26:55,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-13 14:26:55,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-13 14:26:55,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-13 14:26:55,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-13 14:26:55,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-13 14:26:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-13 14:26:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-13 14:26:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-13 14:26:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-13 14:26:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:26:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 14:26:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 14:26:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-13 14:26:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-13 14:26:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-13 14:26:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-13 14:26:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-13 14:26:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-13 14:26:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-13 14:26:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-13 14:26:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-13 14:26:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-13 14:26:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-13 14:26:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-13 14:26:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-13 14:26:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-13 14:26:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-13 14:26:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-13 14:26:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-13 14:26:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-13 14:26:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-13 14:26:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-13 14:26:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-13 14:26:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-11-13 14:26:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-11-13 14:26:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-13 14:26:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-13 14:26:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-13 14:26:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-13 14:26:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-13 14:26:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-13 14:26:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-13 14:26:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-13 14:26:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-11-13 14:26:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-11-13 14:26:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-11-13 14:26:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-11-13 14:26:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-11-13 14:26:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-13 14:26:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-13 14:26:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-13 14:26:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-13 14:26:55,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-13 14:26:55,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-13 14:26:55,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-13 14:26:55,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-13 14:26:55,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-13 14:26:55,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-13 14:26:55,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-13 14:26:55,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-11-13 14:26:55,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-11-13 14:26:55,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-13 14:26:55,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-13 14:26:55,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-13 14:26:55,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-13 14:26:55,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-13 14:26:55,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-13 14:26:55,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-13 14:26:55,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-13 14:26:55,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-13 14:26:55,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-13 14:26:55,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-13 14:26:55,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-11-13 14:26:55,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-11-13 14:26:55,948 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:26:55,948 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:26:55,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:26:55,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:26:55,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-13 14:26:55,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-13 14:26:55,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-13 14:26:55,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-13 14:26:55,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-13 14:26:55,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-13 14:26:55,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-13 14:26:55,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-13 14:26:55,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-13 14:26:55,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-13 14:26:55,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-13 14:26:55,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-13 14:26:55,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-13 14:26:56,296 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:26:56,299 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:26:58,057 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-11-13 14:26:58,057 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:26:58,070 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:26:58,070 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:26:58,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:26:58 BoogieIcfgContainer [2024-11-13 14:26:58,071 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:26:58,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:26:58,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:26:58,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:26:58,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:26:55" (1/3) ... [2024-11-13 14:26:58,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3e09f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:26:58, skipping insertion in model container [2024-11-13 14:26:58,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:26:55" (2/3) ... [2024-11-13 14:26:58,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3e09f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:26:58, skipping insertion in model container [2024-11-13 14:26:58,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:26:58" (3/3) ... [2024-11-13 14:26:58,083 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-54.i [2024-11-13 14:26:58,102 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:26:58,104 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-54.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:26:58,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:26:58,193 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;@78ee45ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:26:58,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:26:58,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 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 14:26:58,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 14:26:58,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:26:58,211 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] [2024-11-13 14:26:58,212 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:26:58,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:26:58,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1225739204, now seen corresponding path program 1 times [2024-11-13 14:26:58,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:26:58,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355143070] [2024-11-13 14:26:58,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:26:58,228 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 14:26:58,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:26:58,230 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:26:58,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:26:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:58,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 14:26:58,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:26:58,984 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 14:26:58,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:26:58,987 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:26:58,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355143070] [2024-11-13 14:26:58,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355143070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:26:58,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:26:58,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:26:58,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889783137] [2024-11-13 14:26:58,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:26:58,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:26:59,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:26:59,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:26:59,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:26:59,033 INFO L87 Difference]: Start difference. First operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 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 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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 14:26:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:26:59,080 INFO L93 Difference]: Finished difference Result 213 states and 330 transitions. [2024-11-13 14:26:59,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:26:59,083 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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 105 [2024-11-13 14:26:59,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:26:59,090 INFO L225 Difference]: With dead ends: 213 [2024-11-13 14:26:59,090 INFO L226 Difference]: Without dead ends: 106 [2024-11-13 14:26:59,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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 14:26:59,097 INFO L432 NwaCegarLoop]: 155 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, 155 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 14:26:59,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:26:59,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-13 14:26:59,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-13 14:26:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 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 14:26:59,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-13 14:26:59,152 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 105 [2024-11-13 14:26:59,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:26:59,153 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-13 14:26:59,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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 14:26:59,154 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-13 14:26:59,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 14:26:59,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:26:59,158 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] [2024-11-13 14:26:59,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:26:59,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:26:59,359 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:26:59,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:26:59,360 INFO L85 PathProgramCache]: Analyzing trace with hash 2000187248, now seen corresponding path program 1 times [2024-11-13 14:26:59,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:26:59,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162778089] [2024-11-13 14:26:59,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:26:59,361 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 14:26:59,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:26:59,365 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:26:59,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:26:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:59,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:26:59,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:27:00,023 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 14:27:00,023 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:27:00,023 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:27:00,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162778089] [2024-11-13 14:27:00,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162778089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:27:00,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:27:00,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:27:00,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430213731] [2024-11-13 14:27:00,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:27:00,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:27:00,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:27:00,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:27:00,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:27:00,031 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 14:27:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:27:00,465 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2024-11-13 14:27:00,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:27:00,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 105 [2024-11-13 14:27:00,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:27:00,478 INFO L225 Difference]: With dead ends: 211 [2024-11-13 14:27:00,480 INFO L226 Difference]: Without dead ends: 108 [2024-11-13 14:27:00,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 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 14:27:00,483 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:27:00,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 14:27:00,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-13 14:27:00,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-13 14:27:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 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 14:27:00,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-13 14:27:00,509 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 105 [2024-11-13 14:27:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:27:00,510 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-13 14:27:00,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 14:27:00,511 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-13 14:27:00,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 14:27:00,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:27:00,518 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] [2024-11-13 14:27:00,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:00,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:00,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:27:00,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:27:00,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1397386770, now seen corresponding path program 1 times [2024-11-13 14:27:00,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:27:00,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379770667] [2024-11-13 14:27:00,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:27:00,721 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 14:27:00,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:27:00,725 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:00,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:01,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:27:01,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:27:01,722 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 17 treesize of output 9 [2024-11-13 14:27:01,744 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 14:27:01,744 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:27:01,744 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:27:01,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379770667] [2024-11-13 14:27:01,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1379770667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:27:01,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:27:01,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:27:01,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073307302] [2024-11-13 14:27:01,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:27:01,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:27:01,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:27:01,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:27:01,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:27:01,749 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 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 14:27:01,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:27:01,919 INFO L93 Difference]: Finished difference Result 318 states and 465 transitions. [2024-11-13 14:27:01,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:27:01,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 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 105 [2024-11-13 14:27:01,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:27:01,923 INFO L225 Difference]: With dead ends: 318 [2024-11-13 14:27:01,924 INFO L226 Difference]: Without dead ends: 213 [2024-11-13 14:27:01,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 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 14:27:01,926 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 99 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:27:01,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 438 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:27:01,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-13 14:27:01,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2024-11-13 14:27:01,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 182 states have (on average 1.4175824175824177) internal successors, (258), 182 states have internal predecessors, (258), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:27:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 306 transitions. [2024-11-13 14:27:01,985 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 306 transitions. Word has length 105 [2024-11-13 14:27:01,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:27:01,986 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 306 transitions. [2024-11-13 14:27:01,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 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 14:27:01,987 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 306 transitions. [2024-11-13 14:27:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 14:27:01,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:27:01,989 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] [2024-11-13 14:27:01,999 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:02,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:02,195 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:27:02,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:27:02,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1309232624, now seen corresponding path program 1 times [2024-11-13 14:27:02,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:27:02,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381313143] [2024-11-13 14:27:02,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:27:02,197 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 14:27:02,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:27:02,200 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:02,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:02,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:27:02,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:27:02,788 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 14:27:02,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:27:02,789 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:27:02,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381313143] [2024-11-13 14:27:02,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381313143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:27:02,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:27:02,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:27:02,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005906150] [2024-11-13 14:27:02,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:27:02,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:27:02,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:27:02,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:27:02,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:27:02,792 INFO L87 Difference]: Start difference. First operand 209 states and 306 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 14:27:02,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:27:02,848 INFO L93 Difference]: Finished difference Result 419 states and 615 transitions. [2024-11-13 14:27:02,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:27:02,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 105 [2024-11-13 14:27:02,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:27:02,852 INFO L225 Difference]: With dead ends: 419 [2024-11-13 14:27:02,852 INFO L226 Difference]: Without dead ends: 213 [2024-11-13 14:27:02,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 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 14:27:02,854 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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 14:27:02,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:27:02,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-13 14:27:02,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-11-13 14:27:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 186 states have (on average 1.4086021505376345) internal successors, (262), 186 states have internal predecessors, (262), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:27:02,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 310 transitions. [2024-11-13 14:27:02,887 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 310 transitions. Word has length 105 [2024-11-13 14:27:02,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:27:02,890 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 310 transitions. [2024-11-13 14:27:02,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 14:27:02,890 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 310 transitions. [2024-11-13 14:27:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 14:27:02,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:27:02,892 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] [2024-11-13 14:27:02,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:03,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:03,101 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:27:03,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:27:03,102 INFO L85 PathProgramCache]: Analyzing trace with hash 732913739, now seen corresponding path program 1 times [2024-11-13 14:27:03,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:27:03,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397765439] [2024-11-13 14:27:03,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:27:03,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 14:27:03,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:27:03,107 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:03,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:03,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 14:27:03,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:27:04,127 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 17 treesize of output 9 [2024-11-13 14:27:04,177 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 14:27:04,402 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 14:27:04,403 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:27:04,403 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:27:04,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397765439] [2024-11-13 14:27:04,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397765439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:27:04,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:27:04,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:27:04,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444654633] [2024-11-13 14:27:04,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:27:04,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:27:04,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:27:04,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:27:04,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:27:04,407 INFO L87 Difference]: Start difference. First operand 213 states and 310 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 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 14:27:05,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:27:05,171 INFO L93 Difference]: Finished difference Result 440 states and 639 transitions. [2024-11-13 14:27:05,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:27:05,175 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 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 107 [2024-11-13 14:27:05,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:27:05,177 INFO L225 Difference]: With dead ends: 440 [2024-11-13 14:27:05,181 INFO L226 Difference]: Without dead ends: 230 [2024-11-13 14:27:05,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:27:05,183 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 103 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:27:05,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1081 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:27:05,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-13 14:27:05,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 224. [2024-11-13 14:27:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 197 states have (on average 1.385786802030457) internal successors, (273), 197 states have internal predecessors, (273), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:27:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 321 transitions. [2024-11-13 14:27:05,204 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 321 transitions. Word has length 107 [2024-11-13 14:27:05,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:27:05,204 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 321 transitions. [2024-11-13 14:27:05,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 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 14:27:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 321 transitions. [2024-11-13 14:27:05,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 14:27:05,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:27:05,206 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] [2024-11-13 14:27:05,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:05,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:05,407 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:27:05,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:27:05,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1787046195, now seen corresponding path program 1 times [2024-11-13 14:27:05,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:27:05,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093686133] [2024-11-13 14:27:05,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:27:05,409 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 14:27:05,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:27:05,411 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:05,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:05,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 14:27:05,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:27:06,269 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 17 treesize of output 9 [2024-11-13 14:27:06,311 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 14:27:06,499 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 14:27:06,500 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:27:06,500 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:27:06,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093686133] [2024-11-13 14:27:06,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093686133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:27:06,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:27:06,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:27:06,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997692163] [2024-11-13 14:27:06,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:27:06,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:27:06,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:27:06,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:27:06,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:27:06,502 INFO L87 Difference]: Start difference. First operand 224 states and 321 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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 14:27:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:27:07,297 INFO L93 Difference]: Finished difference Result 455 states and 651 transitions. [2024-11-13 14:27:07,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 14:27:07,297 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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 107 [2024-11-13 14:27:07,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:27:07,301 INFO L225 Difference]: With dead ends: 455 [2024-11-13 14:27:07,302 INFO L226 Difference]: Without dead ends: 234 [2024-11-13 14:27:07,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:27:07,305 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 105 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:27:07,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1205 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 14:27:07,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-13 14:27:07,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 228. [2024-11-13 14:27:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 201 states have (on average 1.3781094527363185) internal successors, (277), 201 states have internal predecessors, (277), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:27:07,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 325 transitions. [2024-11-13 14:27:07,334 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 325 transitions. Word has length 107 [2024-11-13 14:27:07,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:27:07,334 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 325 transitions. [2024-11-13 14:27:07,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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 14:27:07,334 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 325 transitions. [2024-11-13 14:27:07,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 14:27:07,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:27:07,336 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] [2024-11-13 14:27:07,347 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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)] Ended with exit code 0 [2024-11-13 14:27:07,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:07,537 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:27:07,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:27:07,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1785199153, now seen corresponding path program 1 times [2024-11-13 14:27:07,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:27:07,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747723530] [2024-11-13 14:27:07,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:27:07,538 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 14:27:07,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:27:07,540 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:07,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:07,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:27:07,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:27:08,020 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 14:27:08,392 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 14:27:08,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:27:08,393 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:27:08,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747723530] [2024-11-13 14:27:08,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747723530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:27:08,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:27:08,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:27:08,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983348037] [2024-11-13 14:27:08,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:27:08,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:27:08,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:27:08,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:27:08,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:27:08,397 INFO L87 Difference]: Start difference. First operand 228 states and 325 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 14:27:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:27:09,167 INFO L93 Difference]: Finished difference Result 548 states and 785 transitions. [2024-11-13 14:27:09,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:27:09,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 107 [2024-11-13 14:27:09,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:27:09,173 INFO L225 Difference]: With dead ends: 548 [2024-11-13 14:27:09,173 INFO L226 Difference]: Without dead ends: 323 [2024-11-13 14:27:09,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:27:09,175 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 137 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 561 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.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:27:09,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 561 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 14:27:09,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-13 14:27:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 240. [2024-11-13 14:27:09,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 213 states have (on average 1.3990610328638498) internal successors, (298), 213 states have internal predecessors, (298), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:27:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 346 transitions. [2024-11-13 14:27:09,215 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 346 transitions. Word has length 107 [2024-11-13 14:27:09,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:27:09,217 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 346 transitions. [2024-11-13 14:27:09,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 14:27:09,217 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 346 transitions. [2024-11-13 14:27:09,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 14:27:09,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:27:09,219 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] [2024-11-13 14:27:09,231 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:09,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:09,420 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:27:09,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:27:09,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1336818151, now seen corresponding path program 1 times [2024-11-13 14:27:09,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:27:09,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21730027] [2024-11-13 14:27:09,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:27:09,421 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 14:27:09,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:27:09,424 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:09,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:09,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:27:09,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:27:10,312 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 17 treesize of output 9 [2024-11-13 14:27:10,329 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 14:27:10,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:27:10,329 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:27:10,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21730027] [2024-11-13 14:27:10,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21730027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:27:10,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:27:10,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:27:10,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242672996] [2024-11-13 14:27:10,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:27:10,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:27:10,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:27:10,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:27:10,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:27:10,332 INFO L87 Difference]: Start difference. First operand 240 states and 346 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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 14:27:10,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:27:10,420 INFO L93 Difference]: Finished difference Result 481 states and 693 transitions. [2024-11-13 14:27:10,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:27:10,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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 108 [2024-11-13 14:27:10,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:27:10,423 INFO L225 Difference]: With dead ends: 481 [2024-11-13 14:27:10,423 INFO L226 Difference]: Without dead ends: 244 [2024-11-13 14:27:10,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 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 14:27:10,425 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 86 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:27:10,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 439 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:27:10,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-13 14:27:10,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 240. [2024-11-13 14:27:10,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 213 states have (on average 1.3943661971830985) internal successors, (297), 213 states have internal predecessors, (297), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:27:10,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 345 transitions. [2024-11-13 14:27:10,443 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 345 transitions. Word has length 108 [2024-11-13 14:27:10,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:27:10,443 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 345 transitions. [2024-11-13 14:27:10,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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 14:27:10,444 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 345 transitions. [2024-11-13 14:27:10,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 14:27:10,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:27:10,446 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] [2024-11-13 14:27:10,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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)] Forceful destruction successful, exit code 0 [2024-11-13 14:27:10,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:10,647 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:27:10,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:27:10,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1923624165, now seen corresponding path program 1 times [2024-11-13 14:27:10,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:27:10,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890119066] [2024-11-13 14:27:10,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:27:10,648 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 14:27:10,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:27:10,650 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:10,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:11,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 14:27:11,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:27:12,234 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 14:27:12,397 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 14:27:12,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 39 [2024-11-13 14:27:12,535 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 14:27:12,535 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:27:12,811 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 14:27:12,812 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:27:12,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890119066] [2024-11-13 14:27:12,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890119066] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:27:12,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:27:12,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2024-11-13 14:27:12,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238384431] [2024-11-13 14:27:12,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:27:12,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:27:12,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:27:12,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:27:12,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:27:12,815 INFO L87 Difference]: Start difference. First operand 240 states and 345 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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 14:27:13,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:27:13,847 INFO L93 Difference]: Finished difference Result 609 states and 864 transitions. [2024-11-13 14:27:13,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:27:13,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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 108 [2024-11-13 14:27:13,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:27:13,851 INFO L225 Difference]: With dead ends: 609 [2024-11-13 14:27:13,851 INFO L226 Difference]: Without dead ends: 372 [2024-11-13 14:27:13,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-11-13 14:27:13,853 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 80 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:27:13,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 708 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 14:27:13,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-13 14:27:13,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 368. [2024-11-13 14:27:13,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 327 states have (on average 1.3608562691131498) internal successors, (445), 329 states have internal predecessors, (445), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:27:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 517 transitions. [2024-11-13 14:27:13,879 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 517 transitions. Word has length 108 [2024-11-13 14:27:13,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:27:13,880 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 517 transitions. [2024-11-13 14:27:13,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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 14:27:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 517 transitions. [2024-11-13 14:27:13,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 14:27:13,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:27:13,882 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] [2024-11-13 14:27:13,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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)] Forceful destruction successful, exit code 0 [2024-11-13 14:27:14,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:14,083 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:27:14,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:27:14,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1934384634, now seen corresponding path program 1 times [2024-11-13 14:27:14,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:27:14,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000576134] [2024-11-13 14:27:14,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:27:14,084 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 14:27:14,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:27:14,086 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:14,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:14,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:27:14,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:27:14,554 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 14:27:14,593 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 14:27:14,593 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:27:14,593 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:27:14,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000576134] [2024-11-13 14:27:14,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000576134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:27:14,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:27:14,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:27:14,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024287047] [2024-11-13 14:27:14,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:27:14,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:27:14,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:27:14,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:27:14,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:27:14,596 INFO L87 Difference]: Start difference. First operand 368 states and 517 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 14:27:14,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:27:14,816 INFO L93 Difference]: Finished difference Result 693 states and 976 transitions. [2024-11-13 14:27:14,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:27:14,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 109 [2024-11-13 14:27:14,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:27:14,821 INFO L225 Difference]: With dead ends: 693 [2024-11-13 14:27:14,821 INFO L226 Difference]: Without dead ends: 491 [2024-11-13 14:27:14,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 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 14:27:14,823 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 84 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:27:14,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 785 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:27:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-13 14:27:14,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 394. [2024-11-13 14:27:14,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 353 states have (on average 1.3739376770538243) internal successors, (485), 355 states have internal predecessors, (485), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:27:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 557 transitions. [2024-11-13 14:27:14,848 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 557 transitions. Word has length 109 [2024-11-13 14:27:14,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:27:14,849 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 557 transitions. [2024-11-13 14:27:14,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 14:27:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 557 transitions. [2024-11-13 14:27:14,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 14:27:14,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:27:14,851 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] [2024-11-13 14:27:14,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:15,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:15,052 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:27:15,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:27:15,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1349465412, now seen corresponding path program 1 times [2024-11-13 14:27:15,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:27:15,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880588240] [2024-11-13 14:27:15,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:27:15,053 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 14:27:15,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:27:15,055 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:15,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:15,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:27:15,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:27:15,472 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 14:27:15,521 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 17 treesize of output 9 [2024-11-13 14:27:15,593 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 14:27:15,593 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:27:15,593 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:27:15,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880588240] [2024-11-13 14:27:15,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880588240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:27:15,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:27:15,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:27:15,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516411985] [2024-11-13 14:27:15,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:27:15,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:27:15,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:27:15,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:27:15,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:27:15,595 INFO L87 Difference]: Start difference. First operand 394 states and 557 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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 14:27:16,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:27:16,018 INFO L93 Difference]: Finished difference Result 796 states and 1127 transitions. [2024-11-13 14:27:16,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:27:16,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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 109 [2024-11-13 14:27:16,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:27:16,027 INFO L225 Difference]: With dead ends: 796 [2024-11-13 14:27:16,027 INFO L226 Difference]: Without dead ends: 568 [2024-11-13 14:27:16,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:27:16,028 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 142 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:27:16,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1553 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:27:16,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-13 14:27:16,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 396. [2024-11-13 14:27:16,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 355 states have (on average 1.371830985915493) internal successors, (487), 357 states have internal predecessors, (487), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:27:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 559 transitions. [2024-11-13 14:27:16,059 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 559 transitions. Word has length 109 [2024-11-13 14:27:16,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:27:16,059 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 559 transitions. [2024-11-13 14:27:16,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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 14:27:16,060 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 559 transitions. [2024-11-13 14:27:16,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 14:27:16,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:27:16,062 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] [2024-11-13 14:27:16,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:16,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:16,263 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:27:16,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:27:16,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1800371128, now seen corresponding path program 1 times [2024-11-13 14:27:16,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:27:16,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769300824] [2024-11-13 14:27:16,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:27:16,264 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 14:27:16,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:27:16,268 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:16,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:16,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 14:27:16,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:27:16,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-13 14:27:16,867 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 14:27:16,899 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 19 [2024-11-13 14:27:17,001 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 14:27:17,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:27:17,002 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:27:17,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769300824] [2024-11-13 14:27:17,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769300824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:27:17,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:27:17,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:27:17,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653547112] [2024-11-13 14:27:17,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:27:17,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:27:17,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:27:17,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:27:17,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:27:17,004 INFO L87 Difference]: Start difference. First operand 396 states and 559 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 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 14:27:17,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:27:17,735 INFO L93 Difference]: Finished difference Result 721 states and 1016 transitions. [2024-11-13 14:27:17,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:27:17,736 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 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 109 [2024-11-13 14:27:17,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:27:17,739 INFO L225 Difference]: With dead ends: 721 [2024-11-13 14:27:17,739 INFO L226 Difference]: Without dead ends: 491 [2024-11-13 14:27:17,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:27:17,741 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 88 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:27:17,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1597 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 14:27:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-13 14:27:17,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 396. [2024-11-13 14:27:17,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 355 states have (on average 1.371830985915493) internal successors, (487), 357 states have internal predecessors, (487), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:27:17,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 559 transitions. [2024-11-13 14:27:17,769 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 559 transitions. Word has length 109 [2024-11-13 14:27:17,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:27:17,769 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 559 transitions. [2024-11-13 14:27:17,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 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 14:27:17,770 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 559 transitions. [2024-11-13 14:27:17,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 14:27:17,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:27:17,771 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] [2024-11-13 14:27:17,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:17,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:17,972 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:27:17,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:27:17,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1483478918, now seen corresponding path program 1 times [2024-11-13 14:27:17,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:27:17,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655187427] [2024-11-13 14:27:17,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:27:17,973 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 14:27:17,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:27:17,977 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:17,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:18,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:27:18,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:27:18,521 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 14:27:18,550 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 14:27:18,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:27:18,550 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:27:18,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655187427] [2024-11-13 14:27:18,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655187427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:27:18,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:27:18,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:27:18,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582475849] [2024-11-13 14:27:18,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:27:18,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:27:18,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:27:18,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:27:18,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:27:18,553 INFO L87 Difference]: Start difference. First operand 396 states and 559 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 14:27:18,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:27:18,781 INFO L93 Difference]: Finished difference Result 703 states and 994 transitions. [2024-11-13 14:27:18,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:27:18,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 109 [2024-11-13 14:27:18,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:27:18,785 INFO L225 Difference]: With dead ends: 703 [2024-11-13 14:27:18,785 INFO L226 Difference]: Without dead ends: 473 [2024-11-13 14:27:18,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 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 14:27:18,788 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 81 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:27:18,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 832 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:27:18,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-13 14:27:18,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 386. [2024-11-13 14:27:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 345 states have (on average 1.3710144927536232) internal successors, (473), 347 states have internal predecessors, (473), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:27:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 545 transitions. [2024-11-13 14:27:18,828 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 545 transitions. Word has length 109 [2024-11-13 14:27:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:27:18,828 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 545 transitions. [2024-11-13 14:27:18,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 14:27:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 545 transitions. [2024-11-13 14:27:18,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 14:27:18,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:27:18,830 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] [2024-11-13 14:27:18,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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)] Forceful destruction successful, exit code 0 [2024-11-13 14:27:19,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:19,031 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:27:19,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:27:19,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1337407117, now seen corresponding path program 1 times [2024-11-13 14:27:19,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:27:19,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607826908] [2024-11-13 14:27:19,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:27:19,032 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 14:27:19,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:27:19,034 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:19,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:19,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 14:27:19,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:27:20,122 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 14:27:20,253 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 39 [2024-11-13 14:27:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-13 14:27:20,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:27:20,566 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 14:27:20,566 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:27:20,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607826908] [2024-11-13 14:27:20,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607826908] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:27:20,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:27:20,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2024-11-13 14:27:20,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442052144] [2024-11-13 14:27:20,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:27:20,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:27:20,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:27:20,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:27:20,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:27:20,568 INFO L87 Difference]: Start difference. First operand 386 states and 545 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (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 14:27:20,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:27:20,774 INFO L93 Difference]: Finished difference Result 446 states and 621 transitions. [2024-11-13 14:27:20,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:27:20,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (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 110 [2024-11-13 14:27:20,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:27:20,778 INFO L225 Difference]: With dead ends: 446 [2024-11-13 14:27:20,778 INFO L226 Difference]: Without dead ends: 444 [2024-11-13 14:27:20,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:27:20,779 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 125 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:27:20,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 841 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:27:20,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-13 14:27:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 443. [2024-11-13 14:27:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 389 states have (on average 1.3444730077120823) internal successors, (523), 392 states have internal predecessors, (523), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-13 14:27:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 615 transitions. [2024-11-13 14:27:20,804 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 615 transitions. Word has length 110 [2024-11-13 14:27:20,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:27:20,805 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 615 transitions. [2024-11-13 14:27:20,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (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 14:27:20,805 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 615 transitions. [2024-11-13 14:27:20,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 14:27:20,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:27:20,807 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] [2024-11-13 14:27:20,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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)] Ended with exit code 0 [2024-11-13 14:27:21,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:21,008 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:27:21,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:27:21,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1339254159, now seen corresponding path program 1 times [2024-11-13 14:27:21,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:27:21,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958755033] [2024-11-13 14:27:21,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:27:21,009 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 14:27:21,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:27:21,010 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:21,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:27:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:21,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 14:27:21,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:27:23,637 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 14:27:37,703 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 203 treesize of output 167 [2024-11-13 14:27:37,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:27:37,733 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 267 treesize of output 117 [2024-11-13 14:27:38,551 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 14:27:38,551 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:27:51,506 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:27:51,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958755033] [2024-11-13 14:27:51,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958755033] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:27:51,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797211983] [2024-11-13 14:27:51,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:27:51,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:27:51,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:27:51,519 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:27:51,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-13 14:28:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:28:19,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 14:28:19,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:28:20,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-13 14:28:25,153 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 14:28:51,647 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 185 treesize of output 149 [2024-11-13 14:28:51,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:28:51,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 253 treesize of output 125 [2024-11-13 14:28:52,282 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 14:28:52,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:29:03,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797211983] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:29:03,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:29:03,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-13 14:29:03,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447554280] [2024-11-13 14:29:03,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:29:03,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 14:29:03,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:29:03,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 14:29:03,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:29:03,738 INFO L87 Difference]: Start difference. First operand 443 states and 615 transitions. Second operand has 16 states, 16 states have (on average 6.625) internal successors, (106), 15 states have internal predecessors, (106), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-13 14:29:26,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:29:30,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:29:35,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:29:39,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:29:43,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:29:47,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.89s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:29:53,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:29:58,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:30:02,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:30:07,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:30:12,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:30:16,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:30:20,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:30:24,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:30:25,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:30:25,349 INFO L93 Difference]: Finished difference Result 1271 states and 1755 transitions. [2024-11-13 14:30:25,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:30:25,361 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 15 states have internal predecessors, (106), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 110 [2024-11-13 14:30:25,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:30:25,366 INFO L225 Difference]: With dead ends: 1271 [2024-11-13 14:30:25,366 INFO L226 Difference]: Without dead ends: 868 [2024-11-13 14:30:25,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 260 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-11-13 14:30:25,368 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 811 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 78 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 72.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:30:25,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 814 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 483 Invalid, 12 Unknown, 0 Unchecked, 72.5s Time] [2024-11-13 14:30:25,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2024-11-13 14:30:25,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 864. [2024-11-13 14:30:25,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 762 states have (on average 1.3385826771653544) internal successors, (1020), 770 states have internal predecessors, (1020), 84 states have call successors, (84), 17 states have call predecessors, (84), 17 states have return successors, (84), 76 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-13 14:30:25,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1188 transitions. [2024-11-13 14:30:25,450 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1188 transitions. Word has length 110 [2024-11-13 14:30:25,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:30:25,452 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1188 transitions. [2024-11-13 14:30:25,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 15 states have internal predecessors, (106), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-13 14:30:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1188 transitions. [2024-11-13 14:30:25,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 14:30:25,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:30:25,455 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] [2024-11-13 14:30:25,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:30:25,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-13 14:30:25,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:30:25,856 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:30:25,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:30:25,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1180705775, now seen corresponding path program 1 times [2024-11-13 14:30:25,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:30:25,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260351089] [2024-11-13 14:30:25,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:30:25,857 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 14:30:25,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:30:25,859 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:30:25,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:30:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:26,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:30:26,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:30:26,300 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 14:30:26,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:30:26,301 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:30:26,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260351089] [2024-11-13 14:30:26,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260351089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:30:26,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:30:26,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:30:26,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814469879] [2024-11-13 14:30:26,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:30:26,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:30:26,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:30:26,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:30:26,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:30:26,302 INFO L87 Difference]: Start difference. First operand 864 states and 1188 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 14:30:26,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:30:26,633 INFO L93 Difference]: Finished difference Result 1700 states and 2335 transitions. [2024-11-13 14:30:26,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:30:26,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 110 [2024-11-13 14:30:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:30:26,642 INFO L225 Difference]: With dead ends: 1700 [2024-11-13 14:30:26,642 INFO L226 Difference]: Without dead ends: 888 [2024-11-13 14:30:26,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 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 14:30:26,645 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 588 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.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:30:26,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 588 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:30:26,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2024-11-13 14:30:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2024-11-13 14:30:26,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 786 states have (on average 1.3282442748091603) internal successors, (1044), 794 states have internal predecessors, (1044), 84 states have call successors, (84), 17 states have call predecessors, (84), 17 states have return successors, (84), 76 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-13 14:30:26,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1212 transitions. [2024-11-13 14:30:26,722 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1212 transitions. Word has length 110 [2024-11-13 14:30:26,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:30:26,722 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1212 transitions. [2024-11-13 14:30:26,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 14:30:26,723 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1212 transitions. [2024-11-13 14:30:26,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 14:30:26,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:30:26,725 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] [2024-11-13 14:30:26,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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)] Ended with exit code 0 [2024-11-13 14:30:26,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:30:26,926 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:30:26,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:30:26,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1694795887, now seen corresponding path program 1 times [2024-11-13 14:30:26,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:30:26,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822819638] [2024-11-13 14:30:26,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:30:26,927 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 14:30:26,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:30:26,933 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:30:26,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:30:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:27,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:30:27,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:30:27,358 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 14:30:27,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:30:27,359 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:30:27,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822819638] [2024-11-13 14:30:27,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822819638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:30:27,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:30:27,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:30:27,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928961481] [2024-11-13 14:30:27,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:30:27,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:30:27,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:30:27,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:30:27,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:30:27,360 INFO L87 Difference]: Start difference. First operand 888 states and 1212 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 14:30:27,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:30:27,553 INFO L93 Difference]: Finished difference Result 1734 states and 2366 transitions. [2024-11-13 14:30:27,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:30:27,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 110 [2024-11-13 14:30:27,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:30:27,566 INFO L225 Difference]: With dead ends: 1734 [2024-11-13 14:30:27,567 INFO L226 Difference]: Without dead ends: 888 [2024-11-13 14:30:27,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 107 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 14:30:27,569 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:30:27,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:30:27,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2024-11-13 14:30:27,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2024-11-13 14:30:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 786 states have (on average 1.3244274809160306) internal successors, (1041), 794 states have internal predecessors, (1041), 84 states have call successors, (84), 17 states have call predecessors, (84), 17 states have return successors, (84), 76 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-13 14:30:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1209 transitions. [2024-11-13 14:30:27,679 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1209 transitions. Word has length 110 [2024-11-13 14:30:27,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:30:27,679 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1209 transitions. [2024-11-13 14:30:27,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 14:30:27,680 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1209 transitions. [2024-11-13 14:30:27,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 14:30:27,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:30:27,683 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] [2024-11-13 14:30:27,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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)] Forceful destruction successful, exit code 0 [2024-11-13 14:30:27,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:30:27,883 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:30:27,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:30:27,884 INFO L85 PathProgramCache]: Analyzing trace with hash 618215092, now seen corresponding path program 1 times [2024-11-13 14:30:27,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:30:27,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451495717] [2024-11-13 14:30:27,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:30:27,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:30:27,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:30:27,886 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:30:27,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:30:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:28,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:30:28,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:30:28,697 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 14:30:28,728 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 14:30:28,729 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:30:28,729 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:30:28,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451495717] [2024-11-13 14:30:28,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451495717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:30:28,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:30:28,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:30:28,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015968589] [2024-11-13 14:30:28,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:30:28,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:30:28,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:30:28,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:30:28,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:30:28,731 INFO L87 Difference]: Start difference. First operand 888 states and 1209 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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 14:30:29,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:30:29,058 INFO L93 Difference]: Finished difference Result 1600 states and 2175 transitions. [2024-11-13 14:30:29,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:30:29,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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 111 [2024-11-13 14:30:29,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:30:29,063 INFO L225 Difference]: With dead ends: 1600 [2024-11-13 14:30:29,063 INFO L226 Difference]: Without dead ends: 764 [2024-11-13 14:30:29,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:30:29,065 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 81 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:30:29,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 553 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:30:29,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2024-11-13 14:30:29,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 756. [2024-11-13 14:30:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 667 states have (on average 1.3238380809595203) internal successors, (883), 673 states have internal predecessors, (883), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-13 14:30:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1027 transitions. [2024-11-13 14:30:29,127 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1027 transitions. Word has length 111 [2024-11-13 14:30:29,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:30:29,128 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 1027 transitions. [2024-11-13 14:30:29,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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 14:30:29,128 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1027 transitions. [2024-11-13 14:30:29,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 14:30:29,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:30:29,131 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] [2024-11-13 14:30:29,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:30:29,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:30:29,332 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:30:29,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:30:29,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1788436700, now seen corresponding path program 1 times [2024-11-13 14:30:29,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:30:29,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858585937] [2024-11-13 14:30:29,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:30:29,333 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 14:30:29,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:30:29,336 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:30:29,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:30:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:29,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 14:30:29,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:30:30,383 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 14:30:30,409 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 14:30:30,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:30:30,410 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:30:30,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858585937] [2024-11-13 14:30:30,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858585937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:30:30,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:30:30,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:30:30,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7577207] [2024-11-13 14:30:30,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:30:30,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:30:30,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:30:30,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:30:30,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:30:30,411 INFO L87 Difference]: Start difference. First operand 756 states and 1027 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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 14:30:30,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:30:30,674 INFO L93 Difference]: Finished difference Result 1444 states and 1957 transitions. [2024-11-13 14:30:30,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:30:30,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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 112 [2024-11-13 14:30:30,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:30:30,679 INFO L225 Difference]: With dead ends: 1444 [2024-11-13 14:30:30,679 INFO L226 Difference]: Without dead ends: 740 [2024-11-13 14:30:30,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:30:30,682 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 62 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:30:30,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 562 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:30:30,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2024-11-13 14:30:30,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 732. [2024-11-13 14:30:30,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 643 states have (on average 1.317262830482115) internal successors, (847), 649 states have internal predecessors, (847), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-13 14:30:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 991 transitions. [2024-11-13 14:30:30,742 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 991 transitions. Word has length 112 [2024-11-13 14:30:30,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:30:30,743 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 991 transitions. [2024-11-13 14:30:30,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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 14:30:30,743 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 991 transitions. [2024-11-13 14:30:30,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 14:30:30,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:30:30,745 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] [2024-11-13 14:30:30,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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)] Ended with exit code 0 [2024-11-13 14:30:30,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:30:30,949 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:30:30,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:30:30,950 INFO L85 PathProgramCache]: Analyzing trace with hash 571667189, now seen corresponding path program 1 times [2024-11-13 14:30:30,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:30:30,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104960111] [2024-11-13 14:30:30,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:30:30,951 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 14:30:30,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:30:30,953 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:30:30,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:30:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:31,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 14:30:31,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:30:34,919 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 14:30:51,177 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 203 treesize of output 167 [2024-11-13 14:30:51,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:30:51,204 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 265 treesize of output 115 [2024-11-13 14:30:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 3 proven. 137 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-13 14:30:52,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:31:07,047 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:31:07,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104960111] [2024-11-13 14:31:07,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104960111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:31:07,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619254364] [2024-11-13 14:31:07,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:31:07,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:31:07,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:31:07,050 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:31:07,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-13 14:31:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:08,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-13 14:31:08,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:31:10,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2024-11-13 14:31:21,305 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 14:31:47,645 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 185 treesize of output 149 [2024-11-13 14:31:47,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:31:47,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 119 [2024-11-13 14:31:48,249 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 3 proven. 137 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-13 14:31:48,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:31:59,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619254364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:31:59,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:31:59,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2024-11-13 14:31:59,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74103440] [2024-11-13 14:31:59,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:31:59,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 14:31:59,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:31:59,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 14:31:59,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=499, Unknown=1, NotChecked=0, Total=600 [2024-11-13 14:31:59,159 INFO L87 Difference]: Start difference. First operand 732 states and 991 transitions. Second operand has 23 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 6 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-13 14:32:54,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:32:58,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:33:03,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:33:07,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:33:11,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:33:15,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:33:20,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:33:24,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:33:29,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:33:33,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:33:37,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:33:41,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:33:46,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:33:50,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:33:55,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:33:57,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:34:07,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:34:07,092 INFO L93 Difference]: Finished difference Result 1782 states and 2399 transitions. [2024-11-13 14:34:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 14:34:07,093 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 6 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 112 [2024-11-13 14:34:07,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:34:07,099 INFO L225 Difference]: With dead ends: 1782 [2024-11-13 14:34:07,099 INFO L226 Difference]: Without dead ends: 1102 [2024-11-13 14:34:07,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 45.9s TimeCoverageRelationStatistics Valid=317, Invalid=1242, Unknown=1, NotChecked=0, Total=1560 [2024-11-13 14:34:07,102 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 412 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 90 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 106.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 108.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:34:07,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1928 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1292 Invalid, 15 Unknown, 0 Unchecked, 108.7s Time] [2024-11-13 14:34:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2024-11-13 14:34:07,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1090. [2024-11-13 14:34:07,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 958 states have (on average 1.313152400835073) internal successors, (1258), 968 states have internal predecessors, (1258), 104 states have call successors, (104), 27 states have call predecessors, (104), 27 states have return successors, (104), 94 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-13 14:34:07,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1466 transitions. [2024-11-13 14:34:07,234 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1466 transitions. Word has length 112 [2024-11-13 14:34:07,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:34:07,238 INFO L471 AbstractCegarLoop]: Abstraction has 1090 states and 1466 transitions. [2024-11-13 14:34:07,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 6 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-13 14:34:07,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1466 transitions. [2024-11-13 14:34:07,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 14:34:07,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:34:07,241 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] [2024-11-13 14:34:07,253 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:07,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-13 14:34:07,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:34:07,645 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:34:07,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:34:07,646 INFO L85 PathProgramCache]: Analyzing trace with hash 612341939, now seen corresponding path program 1 times [2024-11-13 14:34:07,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:34:07,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785364409] [2024-11-13 14:34:07,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:34:07,646 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 14:34:07,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:34:07,649 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:07,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:34:08,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:34:08,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:34:08,190 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-13 14:34:08,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:34:08,190 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:34:08,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785364409] [2024-11-13 14:34:08,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785364409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:34:08,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:34:08,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:34:08,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43276234] [2024-11-13 14:34:08,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:34:08,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:34:08,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:34:08,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:34:08,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:34:08,192 INFO L87 Difference]: Start difference. First operand 1090 states and 1466 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 14:34:08,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:34:08,767 INFO L93 Difference]: Finished difference Result 1822 states and 2429 transitions. [2024-11-13 14:34:08,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:34:08,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2024-11-13 14:34:08,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:34:08,783 INFO L225 Difference]: With dead ends: 1822 [2024-11-13 14:34:08,783 INFO L226 Difference]: Without dead ends: 772 [2024-11-13 14:34:08,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:34:08,787 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:34:08,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 664 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:34:08,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-11-13 14:34:08,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 752. [2024-11-13 14:34:08,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 658 states have (on average 1.3009118541033435) internal successors, (856), 664 states have internal predecessors, (856), 72 states have call successors, (72), 21 states have call predecessors, (72), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-13 14:34:08,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1000 transitions. [2024-11-13 14:34:08,875 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1000 transitions. Word has length 112 [2024-11-13 14:34:08,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:34:08,875 INFO L471 AbstractCegarLoop]: Abstraction has 752 states and 1000 transitions. [2024-11-13 14:34:08,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 14:34:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1000 transitions. [2024-11-13 14:34:08,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 14:34:08,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:34:08,878 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] [2024-11-13 14:34:08,889 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:09,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:09,079 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:34:09,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:34:09,079 INFO L85 PathProgramCache]: Analyzing trace with hash -758656407, now seen corresponding path program 1 times [2024-11-13 14:34:09,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:34:09,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277580524] [2024-11-13 14:34:09,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:34:09,080 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 14:34:09,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:34:09,082 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:09,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:34:09,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:34:09,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:34:09,604 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 14:34:09,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:34:09,605 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:34:09,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277580524] [2024-11-13 14:34:09,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277580524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:34:09,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:34:09,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:34:09,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675900598] [2024-11-13 14:34:09,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:34:09,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:34:09,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:34:09,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:34:09,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:34:09,608 INFO L87 Difference]: Start difference. First operand 752 states and 1000 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 14:34:09,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:34:09,827 INFO L93 Difference]: Finished difference Result 1246 states and 1677 transitions. [2024-11-13 14:34:09,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:34:09,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 113 [2024-11-13 14:34:09,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:34:09,833 INFO L225 Difference]: With dead ends: 1246 [2024-11-13 14:34:09,833 INFO L226 Difference]: Without dead ends: 764 [2024-11-13 14:34:09,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 110 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 14:34:09,838 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:34:09,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 449 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:34:09,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2024-11-13 14:34:09,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2024-11-13 14:34:09,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 670 states have (on average 1.2955223880597015) internal successors, (868), 676 states have internal predecessors, (868), 72 states have call successors, (72), 21 states have call predecessors, (72), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-13 14:34:09,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1012 transitions. [2024-11-13 14:34:09,919 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1012 transitions. Word has length 113 [2024-11-13 14:34:09,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:34:09,919 INFO L471 AbstractCegarLoop]: Abstraction has 764 states and 1012 transitions. [2024-11-13 14:34:09,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 14:34:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1012 transitions. [2024-11-13 14:34:09,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 14:34:09,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:34:09,923 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] [2024-11-13 14:34:09,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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)] Ended with exit code 0 [2024-11-13 14:34:10,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:10,124 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:34:10,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:34:10,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1730872555, now seen corresponding path program 1 times [2024-11-13 14:34:10,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:34:10,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187892047] [2024-11-13 14:34:10,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:34:10,125 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 14:34:10,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:34:10,128 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:10,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:34:10,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:34:10,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:34:10,580 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 14:34:10,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 17 treesize of output 9 [2024-11-13 14:34:10,652 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 14:34:10,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:34:10,652 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:34:10,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187892047] [2024-11-13 14:34:10,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187892047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:34:10,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:34:10,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:34:10,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851865955] [2024-11-13 14:34:10,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:34:10,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:34:10,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:34:10,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:34:10,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:34:10,654 INFO L87 Difference]: Start difference. First operand 764 states and 1012 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 14:34:11,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:34:11,288 INFO L93 Difference]: Finished difference Result 1486 states and 1969 transitions. [2024-11-13 14:34:11,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:34:11,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 113 [2024-11-13 14:34:11,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:34:11,292 INFO L225 Difference]: With dead ends: 1486 [2024-11-13 14:34:11,292 INFO L226 Difference]: Without dead ends: 992 [2024-11-13 14:34:11,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:34:11,293 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 135 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 927 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.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:34:11,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 927 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:34:11,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2024-11-13 14:34:11,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 984. [2024-11-13 14:34:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 857 states have (on average 1.2753792298716453) internal successors, (1093), 864 states have internal predecessors, (1093), 96 states have call successors, (96), 30 states have call predecessors, (96), 30 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-13 14:34:11,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1285 transitions. [2024-11-13 14:34:11,404 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1285 transitions. Word has length 113 [2024-11-13 14:34:11,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:34:11,405 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1285 transitions. [2024-11-13 14:34:11,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 14:34:11,405 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1285 transitions. [2024-11-13 14:34:11,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 14:34:11,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:34:11,408 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] [2024-11-13 14:34:11,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:11,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:11,608 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:34:11,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:34:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2054621651, now seen corresponding path program 1 times [2024-11-13 14:34:11,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:34:11,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948749782] [2024-11-13 14:34:11,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:34:11,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 14:34:11,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:34:11,611 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:11,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:34:12,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:34:12,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:34:12,068 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 14:34:12,106 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 11 [2024-11-13 14:34:12,194 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 14:34:12,241 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 14:34:12,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:34:12,241 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:34:12,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948749782] [2024-11-13 14:34:12,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948749782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:34:12,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:34:12,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:34:12,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168586174] [2024-11-13 14:34:12,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:34:12,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:34:12,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:34:12,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:34:12,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:34:12,243 INFO L87 Difference]: Start difference. First operand 984 states and 1285 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 14:34:13,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:34:13,130 INFO L93 Difference]: Finished difference Result 1548 states and 2017 transitions. [2024-11-13 14:34:13,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:34:13,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 113 [2024-11-13 14:34:13,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:34:13,136 INFO L225 Difference]: With dead ends: 1548 [2024-11-13 14:34:13,136 INFO L226 Difference]: Without dead ends: 834 [2024-11-13 14:34:13,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:34:13,139 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 135 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:34:13,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1177 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 14:34:13,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-11-13 14:34:13,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 586. [2024-11-13 14:34:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 505 states have (on average 1.2534653465346535) internal successors, (633), 509 states have internal predecessors, (633), 60 states have call successors, (60), 20 states have call predecessors, (60), 20 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-13 14:34:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 753 transitions. [2024-11-13 14:34:13,211 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 753 transitions. Word has length 113 [2024-11-13 14:34:13,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:34:13,211 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 753 transitions. [2024-11-13 14:34:13,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 14:34:13,212 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 753 transitions. [2024-11-13 14:34:13,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-13 14:34:13,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:34:13,214 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] [2024-11-13 14:34:13,224 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:13,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:13,415 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:34:13,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:34:13,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1798979217, now seen corresponding path program 1 times [2024-11-13 14:34:13,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:34:13,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896423756] [2024-11-13 14:34:13,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:34:13,417 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 14:34:13,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:34:13,418 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:13,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:34:13,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:34:13,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:34:14,745 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 14:34:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 158 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 14:34:14,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:34:15,349 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-13 14:34:15,349 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 20 treesize of output 19 [2024-11-13 14:34:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-13 14:34:15,587 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:34:15,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896423756] [2024-11-13 14:34:15,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896423756] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:34:15,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:34:15,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-11-13 14:34:15,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735297409] [2024-11-13 14:34:15,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:34:15,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 14:34:15,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:34:15,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 14:34:15,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:34:15,589 INFO L87 Difference]: Start difference. First operand 586 states and 753 transitions. Second operand has 12 states, 10 states have (on average 7.2) internal successors, (72), 12 states have internal predecessors, (72), 4 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-13 14:34:16,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:34:16,694 INFO L93 Difference]: Finished difference Result 1098 states and 1381 transitions. [2024-11-13 14:34:16,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 14:34:16,695 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 7.2) internal successors, (72), 12 states have internal predecessors, (72), 4 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) Word has length 114 [2024-11-13 14:34:16,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:34:16,698 INFO L225 Difference]: With dead ends: 1098 [2024-11-13 14:34:16,699 INFO L226 Difference]: Without dead ends: 568 [2024-11-13 14:34:16,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2024-11-13 14:34:16,700 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 297 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:34:16,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 487 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 14:34:16,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-13 14:34:16,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 552. [2024-11-13 14:34:16,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 464 states have (on average 1.2112068965517242) internal successors, (562), 468 states have internal predecessors, (562), 60 states have call successors, (60), 27 states have call predecessors, (60), 27 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-13 14:34:16,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 682 transitions. [2024-11-13 14:34:16,802 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 682 transitions. Word has length 114 [2024-11-13 14:34:16,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:34:16,803 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 682 transitions. [2024-11-13 14:34:16,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 7.2) internal successors, (72), 12 states have internal predecessors, (72), 4 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-13 14:34:16,804 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 682 transitions. [2024-11-13 14:34:16,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-13 14:34:16,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:34:16,805 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] [2024-11-13 14:34:16,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:17,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:17,006 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:34:17,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:34:17,007 INFO L85 PathProgramCache]: Analyzing trace with hash -944549557, now seen corresponding path program 1 times [2024-11-13 14:34:17,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:34:17,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057001709] [2024-11-13 14:34:17,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:34:17,008 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 14:34:17,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:34:17,010 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:17,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:34:17,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 14:34:17,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:34:17,509 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 14:34:17,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:34:17,510 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:34:17,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057001709] [2024-11-13 14:34:17,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057001709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:34:17,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:34:17,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:34:17,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97936949] [2024-11-13 14:34:17,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:34:17,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:34:17,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:34:17,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:34:17,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:34:17,512 INFO L87 Difference]: Start difference. First operand 552 states and 682 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 14:34:17,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:34:17,620 INFO L93 Difference]: Finished difference Result 856 states and 1067 transitions. [2024-11-13 14:34:17,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:34:17,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 114 [2024-11-13 14:34:17,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:34:17,625 INFO L225 Difference]: With dead ends: 856 [2024-11-13 14:34:17,625 INFO L226 Difference]: Without dead ends: 554 [2024-11-13 14:34:17,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 112 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 14:34:17,626 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:34:17,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 247 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:34:17,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-13 14:34:17,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2024-11-13 14:34:17,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 466 states have (on average 1.2103004291845494) internal successors, (564), 470 states have internal predecessors, (564), 60 states have call successors, (60), 27 states have call predecessors, (60), 27 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-13 14:34:17,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 684 transitions. [2024-11-13 14:34:17,729 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 684 transitions. Word has length 114 [2024-11-13 14:34:17,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:34:17,730 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 684 transitions. [2024-11-13 14:34:17,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 14:34:17,730 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 684 transitions. [2024-11-13 14:34:17,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-13 14:34:17,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:34:17,732 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] [2024-11-13 14:34:17,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:17,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:17,933 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:34:17,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:34:17,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1762069837, now seen corresponding path program 1 times [2024-11-13 14:34:17,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:34:17,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840324087] [2024-11-13 14:34:17,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:34:17,935 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 14:34:17,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:34:17,938 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:17,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:34:18,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:34:18,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:34:18,474 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 14:34:18,546 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 17 treesize of output 9 [2024-11-13 14:34:18,572 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 14:34:18,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:34:18,573 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:34:18,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840324087] [2024-11-13 14:34:18,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840324087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:34:18,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:34:18,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:34:18,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066130692] [2024-11-13 14:34:18,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:34:18,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:34:18,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:34:18,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:34:18,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:34:18,574 INFO L87 Difference]: Start difference. First operand 554 states and 684 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 14:34:19,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:34:19,126 INFO L93 Difference]: Finished difference Result 1056 states and 1303 transitions. [2024-11-13 14:34:19,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:34:19,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 114 [2024-11-13 14:34:19,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:34:19,131 INFO L225 Difference]: With dead ends: 1056 [2024-11-13 14:34:19,131 INFO L226 Difference]: Without dead ends: 752 [2024-11-13 14:34:19,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:34:19,133 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 94 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 759 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.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:34:19,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 759 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 14:34:19,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-11-13 14:34:19,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 746. [2024-11-13 14:34:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 622 states have (on average 1.1929260450160772) internal successors, (742), 627 states have internal predecessors, (742), 84 states have call successors, (84), 39 states have call predecessors, (84), 39 states have return successors, (84), 79 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-13 14:34:19,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 910 transitions. [2024-11-13 14:34:19,267 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 910 transitions. Word has length 114 [2024-11-13 14:34:19,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:34:19,268 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 910 transitions. [2024-11-13 14:34:19,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 14:34:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 910 transitions. [2024-11-13 14:34:19,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-13 14:34:19,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:34:19,270 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] [2024-11-13 14:34:19,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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)] Forceful destruction successful, exit code 0 [2024-11-13 14:34:19,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:19,471 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:34:19,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:34:19,471 INFO L85 PathProgramCache]: Analyzing trace with hash 375866443, now seen corresponding path program 1 times [2024-11-13 14:34:19,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:34:19,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104784877] [2024-11-13 14:34:19,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:34:19,472 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 14:34:19,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:34:19,475 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:19,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:34:20,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:34:20,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:34:20,090 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 14:34:20,127 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 11 [2024-11-13 14:34:20,276 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 14:34:20,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 14:34:20,320 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:34:20,320 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:34:20,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104784877] [2024-11-13 14:34:20,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1104784877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:34:20,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:34:20,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:34:20,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586657078] [2024-11-13 14:34:20,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:34:20,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:34:20,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:34:20,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:34:20,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:34:20,322 INFO L87 Difference]: Start difference. First operand 746 states and 910 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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 14:34:20,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:34:20,963 INFO L93 Difference]: Finished difference Result 1210 states and 1476 transitions. [2024-11-13 14:34:20,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:34:20,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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 114 [2024-11-13 14:34:20,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:34:20,966 INFO L225 Difference]: With dead ends: 1210 [2024-11-13 14:34:20,966 INFO L226 Difference]: Without dead ends: 0 [2024-11-13 14:34:20,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:34:20,969 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 94 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:34:20,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 881 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 14:34:20,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-13 14:34:20,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-13 14:34:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:34:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-13 14:34:20,971 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 114 [2024-11-13 14:34:20,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:34:20,971 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 14:34:20,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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 14:34:20,972 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-13 14:34:20,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 14:34:20,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:34:20,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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)] Ended with exit code 0 [2024-11-13 14:34:21,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6a561e3-06be-4125-b164-5b61698a011a/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 14:34:21,180 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] [2024-11-13 14:34:21,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-13 14:35:52,618 WARN L286 SmtUtils]: Spent 1.50m on a formula simplification. DAG size of input: 148 DAG size of output: 126 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-13 14:37:18,287 WARN L286 SmtUtils]: Spent 1.43m on a formula simplification. DAG size of input: 139 DAG size of output: 117 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-13 14:38:47,878 WARN L286 SmtUtils]: Spent 1.49m on a formula simplification. DAG size of input: 154 DAG size of output: 132 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-13 14:40:16,961 WARN L286 SmtUtils]: Spent 1.48m on a formula simplification. DAG size of input: 166 DAG size of output: 132 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter)