./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme --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 e1928f1269d04d8b5de337525ff72bdfae3247245ae6db35e73e266008ad3a3d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:57:55,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:57:55,770 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:57:55,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:57:55,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:57:55,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:57:55,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:57:55,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:57:55,806 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:57:55,806 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:57:55,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:57:55,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:57:55,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:57:55,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:57:55,809 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:57:55,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:57:55,811 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:57:55,811 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:57:55,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:57:55,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:57:55,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:57:55,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:57:55,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:57:55,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:57:55,815 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:57:55,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:57:55,816 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:57:55,816 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:57:55,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:57:55,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:57:55,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:57:55,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:57:55,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:57:55,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:57:55,819 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:57:55,819 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:57:55,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:57:55,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:57:55,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:57:55,820 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:57:55,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:57:55,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:57:55,821 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme 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 -> e1928f1269d04d8b5de337525ff72bdfae3247245ae6db35e73e266008ad3a3d [2023-11-26 11:57:56,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:57:56,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:57:56,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:57:56,134 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:57:56,134 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:57:56,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i [2023-11-26 11:57:59,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:57:59,591 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:57:59,592 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i [2023-11-26 11:57:59,609 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/data/9fb6f638b/4b9e94f1c8d245ba9b37a2876ec7cdcd/FLAG0169c8e17 [2023-11-26 11:57:59,625 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/data/9fb6f638b/4b9e94f1c8d245ba9b37a2876ec7cdcd [2023-11-26 11:57:59,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:57:59,636 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:57:59,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:57:59,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:57:59,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:57:59,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:57:59" (1/1) ... [2023-11-26 11:57:59,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f4b06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:59, skipping insertion in model container [2023-11-26 11:57:59,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:57:59" (1/1) ... [2023-11-26 11:57:59,682 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:57:59,833 WARN L240 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_c405e70a-caad-4ffd-b1aa-c23f6e310795/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i[916,929] [2023-11-26 11:57:59,916 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:57:59,928 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:57:59,940 WARN L240 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_c405e70a-caad-4ffd-b1aa-c23f6e310795/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i[916,929] [2023-11-26 11:57:59,984 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:58:00,006 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:58:00,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:00 WrapperNode [2023-11-26 11:58:00,006 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:58:00,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:58:00,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:58:00,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:58:00,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:00" (1/1) ... [2023-11-26 11:58:00,031 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:00" (1/1) ... [2023-11-26 11:58:00,093 INFO L138 Inliner]: procedures = 29, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 447 [2023-11-26 11:58:00,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:58:00,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:58:00,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:58:00,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:58:00,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:00" (1/1) ... [2023-11-26 11:58:00,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:00" (1/1) ... [2023-11-26 11:58:00,127 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:00" (1/1) ... [2023-11-26 11:58:00,154 INFO L175 MemorySlicer]: Split 142 memory accesses to 8 slices as follows [2, 11, 36, 3, 48, 13, 11, 18]. 34 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 2, 4, 1, 5, 2, 2, 2]. The 22 writes are split as follows [0, 2, 6, 1, 6, 3, 2, 2]. [2023-11-26 11:58:00,154 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:00" (1/1) ... [2023-11-26 11:58:00,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:00" (1/1) ... [2023-11-26 11:58:00,183 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:00" (1/1) ... [2023-11-26 11:58:00,188 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:00" (1/1) ... [2023-11-26 11:58:00,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:00" (1/1) ... [2023-11-26 11:58:00,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:00" (1/1) ... [2023-11-26 11:58:00,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:58:00,206 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:58:00,206 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:58:00,206 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:58:00,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:00" (1/1) ... [2023-11-26 11:58:00,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:58:00,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:58:00,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:58:00,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:58:00,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:58:00,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-11-26 11:58:00,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-11-26 11:58:00,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-11-26 11:58:00,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-11-26 11:58:00,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-11-26 11:58:00,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-11-26 11:58:00,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-11-26 11:58:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-11-26 11:58:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:58:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:58:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 11:58:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 11:58:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-26 11:58:00,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-26 11:58:00,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-26 11:58:00,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-11-26 11:58:00,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-11-26 11:58:00,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-11-26 11:58:00,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-11-26 11:58:00,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-11-26 11:58:00,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-11-26 11:58:00,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-11-26 11:58:00,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-11-26 11:58:00,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-11-26 11:58:00,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 11:58:00,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 11:58:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-26 11:58:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-26 11:58:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-26 11:58:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-26 11:58:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-26 11:58:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-11-26 11:58:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-11-26 11:58:00,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-11-26 11:58:00,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-11-26 11:58:00,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-11-26 11:58:00,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-11-26 11:58:00,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-11-26 11:58:00,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-11-26 11:58:00,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-11-26 11:58:00,306 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 11:58:00,306 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 11:58:00,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:58:00,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:58:00,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 11:58:00,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 11:58:00,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-26 11:58:00,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-26 11:58:00,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-26 11:58:00,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-11-26 11:58:00,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:58:00,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:58:00,477 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:58:00,479 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:58:01,142 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:58:01,204 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:58:01,204 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:58:01,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:01 BoogieIcfgContainer [2023-11-26 11:58:01,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:58:01,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:58:01,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:58:01,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:58:01,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:57:59" (1/3) ... [2023-11-26 11:58:01,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7365d4e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:58:01, skipping insertion in model container [2023-11-26 11:58:01,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:00" (2/3) ... [2023-11-26 11:58:01,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7365d4e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:58:01, skipping insertion in model container [2023-11-26 11:58:01,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:01" (3/3) ... [2023-11-26 11:58:01,218 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-10.i [2023-11-26 11:58:01,235 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:58:01,235 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:58:01,290 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:58:01,296 INFO L357 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, mHoare=true, 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;@75f0303d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:58:01,297 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:58:01,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 83 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-26 11:58:01,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-26 11:58:01,316 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:01,317 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:01,317 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:01,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:01,323 INFO L85 PathProgramCache]: Analyzing trace with hash 842837506, now seen corresponding path program 1 times [2023-11-26 11:58:01,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:01,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743340850] [2023-11-26 11:58:01,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:01,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:01,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:58:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:01,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:58:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:01,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 11:58:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:01,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:58:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:01,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:58:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:01,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 11:58:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:01,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-26 11:58:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:01,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-26 11:58:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:01,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-26 11:58:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:01,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-26 11:58:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:01,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-26 11:58:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:01,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:58:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:01,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-26 11:58:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:01,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-26 11:58:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:01,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:58:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:01,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-26 11:58:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:01,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-26 11:58:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:01,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-26 11:58:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:01,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-26 11:58:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:01,979 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 11:58:01,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:01,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743340850] [2023-11-26 11:58:01,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743340850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:01,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:01,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:01,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954183269] [2023-11-26 11:58:01,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:01,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:58:01,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:02,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:58:02,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:58:02,059 INFO L87 Difference]: Start difference. First operand has 104 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 83 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 11:58:02,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:58:02,120 INFO L93 Difference]: Finished difference Result 205 states and 325 transitions. [2023-11-26 11:58:02,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:58:02,123 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2023-11-26 11:58:02,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:58:02,138 INFO L225 Difference]: With dead ends: 205 [2023-11-26 11:58:02,138 INFO L226 Difference]: Without dead ends: 102 [2023-11-26 11:58:02,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:58:02,159 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:58:02,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:58:02,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-26 11:58:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-26 11:58:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.345679012345679) internal successors, (109), 81 states have internal predecessors, (109), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-26 11:58:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 147 transitions. [2023-11-26 11:58:02,221 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 147 transitions. Word has length 147 [2023-11-26 11:58:02,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:58:02,221 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 147 transitions. [2023-11-26 11:58:02,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 11:58:02,222 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 147 transitions. [2023-11-26 11:58:02,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-26 11:58:02,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:02,242 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:02,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:58:02,243 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:02,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:02,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1622074856, now seen corresponding path program 1 times [2023-11-26 11:58:02,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:02,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214743426] [2023-11-26 11:58:02,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:02,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:02,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:58:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:02,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:58:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:02,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 11:58:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:02,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:58:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:02,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:58:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:02,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 11:58:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:02,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-26 11:58:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:02,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-26 11:58:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:02,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-26 11:58:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:02,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-26 11:58:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:02,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-26 11:58:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:02,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:58:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:02,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-26 11:58:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:02,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-26 11:58:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:02,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:58:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:02,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-26 11:58:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:02,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-26 11:58:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:02,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-26 11:58:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:02,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-26 11:58:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 11:58:02,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:02,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214743426] [2023-11-26 11:58:02,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214743426] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:02,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:02,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:58:02,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011529515] [2023-11-26 11:58:02,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:02,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:58:02,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:02,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:58:02,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:58:02,687 INFO L87 Difference]: Start difference. First operand 102 states and 147 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 11:58:02,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:58:02,797 INFO L93 Difference]: Finished difference Result 209 states and 302 transitions. [2023-11-26 11:58:02,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:58:02,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2023-11-26 11:58:02,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:58:02,802 INFO L225 Difference]: With dead ends: 209 [2023-11-26 11:58:02,805 INFO L226 Difference]: Without dead ends: 108 [2023-11-26 11:58:02,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:58:02,811 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 10 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:58:02,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 418 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:58:02,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-26 11:58:02,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2023-11-26 11:58:02,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-26 11:58:02,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2023-11-26 11:58:02,843 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 147 [2023-11-26 11:58:02,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:58:02,845 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 149 transitions. [2023-11-26 11:58:02,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 11:58:02,846 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 149 transitions. [2023-11-26 11:58:02,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-26 11:58:02,850 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:02,850 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:02,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:58:02,851 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:02,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:02,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1258608358, now seen corresponding path program 1 times [2023-11-26 11:58:02,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:02,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064400021] [2023-11-26 11:58:02,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:02,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:58:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:58:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 11:58:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:58:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:58:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 11:58:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-26 11:58:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-26 11:58:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-26 11:58:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-26 11:58:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-26 11:58:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:58:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-26 11:58:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-26 11:58:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:58:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-26 11:58:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-26 11:58:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-26 11:58:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-26 11:58:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 11:58:03,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:03,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064400021] [2023-11-26 11:58:03,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064400021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:03,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:03,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:58:03,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077623240] [2023-11-26 11:58:03,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:03,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:58:03,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:03,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:58:03,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:58:03,174 INFO L87 Difference]: Start difference. First operand 104 states and 149 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 11:58:03,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:58:03,230 INFO L93 Difference]: Finished difference Result 219 states and 314 transitions. [2023-11-26 11:58:03,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:58:03,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-11-26 11:58:03,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:58:03,234 INFO L225 Difference]: With dead ends: 219 [2023-11-26 11:58:03,234 INFO L226 Difference]: Without dead ends: 116 [2023-11-26 11:58:03,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:58:03,236 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 21 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:58:03,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 420 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:58:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-26 11:58:03,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2023-11-26 11:58:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 85 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-26 11:58:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2023-11-26 11:58:03,251 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 147 [2023-11-26 11:58:03,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:58:03,252 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2023-11-26 11:58:03,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 11:58:03,253 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2023-11-26 11:58:03,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-26 11:58:03,255 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:03,255 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:03,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:58:03,256 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:03,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:03,256 INFO L85 PathProgramCache]: Analyzing trace with hash 449261732, now seen corresponding path program 1 times [2023-11-26 11:58:03,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:03,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170288864] [2023-11-26 11:58:03,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:03,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:58:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:58:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 11:58:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:58:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:58:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 11:58:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-26 11:58:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-26 11:58:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-26 11:58:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-26 11:58:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-26 11:58:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:58:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-26 11:58:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-26 11:58:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:58:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-26 11:58:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-26 11:58:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-26 11:58:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-26 11:58:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,524 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 11:58:03,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:03,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170288864] [2023-11-26 11:58:03,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170288864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:03,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:03,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:58:03,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025205339] [2023-11-26 11:58:03,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:03,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:58:03,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:03,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:58:03,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:58:03,529 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 11:58:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:58:03,584 INFO L93 Difference]: Finished difference Result 219 states and 312 transitions. [2023-11-26 11:58:03,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:58:03,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-11-26 11:58:03,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:58:03,590 INFO L225 Difference]: With dead ends: 219 [2023-11-26 11:58:03,591 INFO L226 Difference]: Without dead ends: 114 [2023-11-26 11:58:03,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:58:03,603 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 12 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:58:03,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 418 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:58:03,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-26 11:58:03,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2023-11-26 11:58:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 87 states have internal predecessors, (115), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-26 11:58:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2023-11-26 11:58:03,631 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 147 [2023-11-26 11:58:03,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:58:03,632 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2023-11-26 11:58:03,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 11:58:03,633 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2023-11-26 11:58:03,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-26 11:58:03,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:03,637 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:03,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:58:03,640 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:03,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:03,640 INFO L85 PathProgramCache]: Analyzing trace with hash 506520034, now seen corresponding path program 1 times [2023-11-26 11:58:03,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:03,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988587654] [2023-11-26 11:58:03,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:03,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:58:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:58:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 11:58:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:58:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:58:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 11:58:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-26 11:58:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-26 11:58:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-26 11:58:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-26 11:58:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-26 11:58:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:58:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-26 11:58:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-26 11:58:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:58:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-26 11:58:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-26 11:58:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-26 11:58:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-26 11:58:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:03,898 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 11:58:03,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:03,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988587654] [2023-11-26 11:58:03,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988587654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:03,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:03,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:58:03,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480094723] [2023-11-26 11:58:03,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:03,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:58:03,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:03,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:58:03,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:58:03,901 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 11:58:03,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:58:03,952 INFO L93 Difference]: Finished difference Result 219 states and 310 transitions. [2023-11-26 11:58:03,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:58:03,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-11-26 11:58:03,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:58:03,957 INFO L225 Difference]: With dead ends: 219 [2023-11-26 11:58:03,957 INFO L226 Difference]: Without dead ends: 112 [2023-11-26 11:58:03,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:58:03,963 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 3 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:58:03,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 418 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:58:03,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-26 11:58:03,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2023-11-26 11:58:03,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 89 states have internal predecessors, (117), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-26 11:58:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 155 transitions. [2023-11-26 11:58:03,998 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 155 transitions. Word has length 147 [2023-11-26 11:58:03,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:58:04,000 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 155 transitions. [2023-11-26 11:58:04,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 11:58:04,000 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 155 transitions. [2023-11-26 11:58:04,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-26 11:58:04,003 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:04,004 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:04,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:58:04,004 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:04,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:04,005 INFO L85 PathProgramCache]: Analyzing trace with hash 506579616, now seen corresponding path program 1 times [2023-11-26 11:58:04,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:04,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697591151] [2023-11-26 11:58:04,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:04,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:05,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:58:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:05,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:58:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:05,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 11:58:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:05,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:58:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:05,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:58:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:05,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 11:58:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:05,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-26 11:58:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:05,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-26 11:58:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:05,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-26 11:58:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:05,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-26 11:58:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:05,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-26 11:58:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:05,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:58:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:05,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-26 11:58:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:05,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-26 11:58:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:05,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:58:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:05,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-26 11:58:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:05,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-26 11:58:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:05,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-26 11:58:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:05,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-26 11:58:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:05,373 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 11:58:05,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:05,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697591151] [2023-11-26 11:58:05,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697591151] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:05,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:05,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:58:05,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360204830] [2023-11-26 11:58:05,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:05,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:58:05,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:05,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:58:05,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:58:05,378 INFO L87 Difference]: Start difference. First operand 110 states and 155 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 11:58:05,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:58:05,624 INFO L93 Difference]: Finished difference Result 267 states and 378 transitions. [2023-11-26 11:58:05,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:58:05,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2023-11-26 11:58:05,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:58:05,632 INFO L225 Difference]: With dead ends: 267 [2023-11-26 11:58:05,632 INFO L226 Difference]: Without dead ends: 158 [2023-11-26 11:58:05,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:58:05,634 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 125 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:58:05,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 819 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 11:58:05,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-26 11:58:05,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2023-11-26 11:58:05,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 122 states have (on average 1.2950819672131149) internal successors, (158), 123 states have internal predecessors, (158), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-26 11:58:05,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 222 transitions. [2023-11-26 11:58:05,670 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 222 transitions. Word has length 147 [2023-11-26 11:58:05,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:58:05,671 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 222 transitions. [2023-11-26 11:58:05,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 11:58:05,672 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 222 transitions. [2023-11-26 11:58:05,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-26 11:58:05,675 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:05,675 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:05,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:58:05,676 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:05,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:05,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2143186299, now seen corresponding path program 1 times [2023-11-26 11:58:05,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:05,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475958409] [2023-11-26 11:58:05,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:05,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:58:05,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:58:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:58:06,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:58:06,267 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:58:06,268 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 11:58:06,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:58:06,275 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:06,282 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:58:06,372 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated [2023-11-26 11:58:06,376 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated [2023-11-26 11:58:06,382 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated [2023-11-26 11:58:06,383 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated [2023-11-26 11:58:06,384 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem42 could not be translated [2023-11-26 11:58:06,385 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated [2023-11-26 11:58:06,386 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short47 could not be translated [2023-11-26 11:58:06,386 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem42 could not be translated [2023-11-26 11:58:06,387 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short43 could not be translated [2023-11-26 11:58:06,390 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short43 could not be translated [2023-11-26 11:58:06,391 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated [2023-11-26 11:58:06,391 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem42 could not be translated [2023-11-26 11:58:06,392 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short47 could not be translated [2023-11-26 11:58:06,393 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated [2023-11-26 11:58:06,397 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated [2023-11-26 11:58:06,398 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated [2023-11-26 11:58:06,398 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated [2023-11-26 11:58:06,399 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short51 could not be translated [2023-11-26 11:58:06,399 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short55 could not be translated [2023-11-26 11:58:06,399 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated [2023-11-26 11:58:06,400 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated [2023-11-26 11:58:06,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short51 could not be translated [2023-11-26 11:58:06,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short55 could not be translated [2023-11-26 11:58:06,402 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated [2023-11-26 11:58:06,403 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated [2023-11-26 11:58:06,403 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem58 could not be translated [2023-11-26 11:58:06,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated [2023-11-26 11:58:06,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short63 could not be translated [2023-11-26 11:58:06,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short59 could not be translated [2023-11-26 11:58:06,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated [2023-11-26 11:58:06,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem58 could not be translated [2023-11-26 11:58:06,410 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated [2023-11-26 11:58:06,410 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem58 could not be translated [2023-11-26 11:58:06,410 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short63 could not be translated [2023-11-26 11:58:06,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short59 could not be translated [2023-11-26 11:58:06,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated [2023-11-26 11:58:06,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem66 could not be translated [2023-11-26 11:58:06,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated [2023-11-26 11:58:06,414 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem69 could not be translated [2023-11-26 11:58:06,415 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated [2023-11-26 11:58:06,416 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated [2023-11-26 11:58:06,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated [2023-11-26 11:58:06,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem75 could not be translated [2023-11-26 11:58:06,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem77 could not be translated [2023-11-26 11:58:06,419 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem78 could not be translated [2023-11-26 11:58:06,419 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem80 could not be translated [2023-11-26 11:58:06,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem81 could not be translated [2023-11-26 11:58:06,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-26 11:58:06,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-11-26 11:58:06,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem19 could not be translated [2023-11-26 11:58:06,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated [2023-11-26 11:58:06,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated [2023-11-26 11:58:06,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite21 could not be translated [2023-11-26 11:58:06,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated [2023-11-26 11:58:06,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short99 could not be translated [2023-11-26 11:58:06,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated [2023-11-26 11:58:06,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated [2023-11-26 11:58:06,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated [2023-11-26 11:58:06,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated [2023-11-26 11:58:06,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated [2023-11-26 11:58:06,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-26 11:58:06,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short99 could not be translated [2023-11-26 11:58:06,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite98 could not be translated [2023-11-26 11:58:06,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-26 11:58:06,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated [2023-11-26 11:58:06,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated [2023-11-26 11:58:06,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short99 could not be translated [2023-11-26 11:58:06,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated [2023-11-26 11:58:06,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated [2023-11-26 11:58:06,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite98 could not be translated [2023-11-26 11:58:06,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated [2023-11-26 11:58:06,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-26 11:58:06,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated [2023-11-26 11:58:06,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite98 could not be translated [2023-11-26 11:58:06,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated [2023-11-26 11:58:06,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short99 could not be translated [2023-11-26 11:58:06,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short117 could not be translated [2023-11-26 11:58:06,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated [2023-11-26 11:58:06,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated [2023-11-26 11:58:06,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short117 could not be translated [2023-11-26 11:58:06,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short130 could not be translated [2023-11-26 11:58:06,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short99 could not be translated [2023-11-26 11:58:06,429 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-26 11:58:06,429 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated [2023-11-26 11:58:06,429 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated [2023-11-26 11:58:06,429 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated [2023-11-26 11:58:06,429 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite98 could not be translated [2023-11-26 11:58:06,430 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short130 could not be translated [2023-11-26 11:58:06,430 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-26 11:58:06,430 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated [2023-11-26 11:58:06,430 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated [2023-11-26 11:58:06,430 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated [2023-11-26 11:58:06,430 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short117 could not be translated [2023-11-26 11:58:06,431 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated [2023-11-26 11:58:06,431 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite98 could not be translated [2023-11-26 11:58:06,431 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short133 could not be translated [2023-11-26 11:58:06,431 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short99 could not be translated [2023-11-26 11:58:06,431 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short136 could not be translated [2023-11-26 11:58:06,432 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short99 could not be translated [2023-11-26 11:58:06,432 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short133 could not be translated [2023-11-26 11:58:06,432 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated [2023-11-26 11:58:06,432 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite98 could not be translated [2023-11-26 11:58:06,432 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated [2023-11-26 11:58:06,433 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short130 could not be translated [2023-11-26 11:58:06,433 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short117 could not be translated [2023-11-26 11:58:06,433 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-26 11:58:06,433 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated [2023-11-26 11:58:06,433 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated [2023-11-26 11:58:06,434 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short130 could not be translated [2023-11-26 11:58:06,434 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated [2023-11-26 11:58:06,434 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated [2023-11-26 11:58:06,434 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite98 could not be translated [2023-11-26 11:58:06,434 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short99 could not be translated [2023-11-26 11:58:06,435 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated [2023-11-26 11:58:06,435 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated [2023-11-26 11:58:06,435 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short139 could not be translated [2023-11-26 11:58:06,435 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short117 could not be translated [2023-11-26 11:58:06,435 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short133 could not be translated [2023-11-26 11:58:06,435 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-26 11:58:06,435 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short136 could not be translated [2023-11-26 11:58:06,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:58:06 BoogieIcfgContainer [2023-11-26 11:58:06,472 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:58:06,473 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:58:06,473 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:58:06,473 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:58:06,474 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:01" (3/4) ... [2023-11-26 11:58:06,476 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 11:58:06,477 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:58:06,478 INFO L158 Benchmark]: Toolchain (without parser) took 6842.60ms. Allocated memory was 140.5MB in the beginning and 239.1MB in the end (delta: 98.6MB). Free memory was 101.6MB in the beginning and 80.0MB in the end (delta: 21.5MB). Peak memory consumption was 121.2MB. Max. memory is 16.1GB. [2023-11-26 11:58:06,478 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 140.5MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:58:06,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.62ms. Allocated memory is still 140.5MB. Free memory was 101.6MB in the beginning and 86.4MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-26 11:58:06,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.13ms. Allocated memory is still 140.5MB. Free memory was 86.4MB in the beginning and 82.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:58:06,480 INFO L158 Benchmark]: Boogie Preprocessor took 110.45ms. Allocated memory is still 140.5MB. Free memory was 82.3MB in the beginning and 77.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-26 11:58:06,480 INFO L158 Benchmark]: RCFGBuilder took 999.95ms. Allocated memory was 140.5MB in the beginning and 199.2MB in the end (delta: 58.7MB). Free memory was 77.1MB in the beginning and 152.0MB in the end (delta: -74.9MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2023-11-26 11:58:06,481 INFO L158 Benchmark]: TraceAbstraction took 5262.84ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 152.0MB in the beginning and 80.0MB in the end (delta: 72.0MB). Peak memory consumption was 110.8MB. Max. memory is 16.1GB. [2023-11-26 11:58:06,481 INFO L158 Benchmark]: Witness Printer took 4.98ms. Allocated memory is still 239.1MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:58:06,483 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.24ms. Allocated memory is still 140.5MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.62ms. Allocated memory is still 140.5MB. Free memory was 101.6MB in the beginning and 86.4MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.13ms. Allocated memory is still 140.5MB. Free memory was 86.4MB in the beginning and 82.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.45ms. Allocated memory is still 140.5MB. Free memory was 82.3MB in the beginning and 77.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 999.95ms. Allocated memory was 140.5MB in the beginning and 199.2MB in the end (delta: 58.7MB). Free memory was 77.1MB in the beginning and 152.0MB in the end (delta: -74.9MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5262.84ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 152.0MB in the beginning and 80.0MB in the end (delta: 72.0MB). Peak memory consumption was 110.8MB. Max. memory is 16.1GB. * Witness Printer took 4.98ms. Allocated memory is still 239.1MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem42 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem42 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short43 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short43 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem42 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short55 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short55 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem58 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short63 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short59 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem58 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem58 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short63 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short59 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem66 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem69 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem75 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem77 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem78 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem80 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short99 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short99 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite98 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short99 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite98 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite98 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short99 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short117 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short117 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short130 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short99 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite98 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short130 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short117 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite98 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short133 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short99 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short136 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short99 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short133 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite98 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short130 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short117 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short130 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite98 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short99 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short139 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short117 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short133 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short136 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someUnaryDOUBLEoperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2][2] = { {-0.8, 1000000.875}, {49.25, 9.15} }; [L25-L27] double double_Array_0[2][2] = { {-0.8, 1000000.875}, {49.25, 9.15} }; [L25-L27] double double_Array_0[2][2] = { {-0.8, 1000000.875}, {49.25, 9.15} }; [L25-L27] double double_Array_0[2][2] = { {-0.8, 1000000.875}, {49.25, 9.15} }; [L25-L27] double double_Array_0[2][2] = { {-0.8, 1000000.875}, {49.25, 9.15} }; [L28-L30] float float_Array_0[1] = { -0.5 }; [L28-L30] float float_Array_0[1] = { -0.5 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L34-L36] signed long int signed_long_int_Array_0[2] = { 1000000000, 32 }; [L34-L36] signed long int signed_long_int_Array_0[2] = { 1000000000, 32 }; [L34-L36] signed long int signed_long_int_Array_0[2] = { 1000000000, 32 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 8, 5 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 8, 5 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 8, 5 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[2] = { 58996, 32 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[2] = { 58996, 32 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[2] = { 58996, 32 }; [L43] double last_1_double_Array_0_1__1_ = 9.15; [L113] isInitial = 1 [L114] FCALL initially() [L115] COND TRUE 1 [L116] CALL updateLastVariables() [L106] EXPR double_Array_0[1][1] [L106] last_1_double_Array_0_1__1_ = double_Array_0[1][1] [L116] RET updateLastVariables() [L117] CALL updateVariables() [L74] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L76] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L77] double_Array_0[0][0] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[0][0] [L78] EXPR double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] EXPR double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F [L78] EXPR double_Array_0[0][0] [L78] EXPR double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] EXPR (double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] EXPR (double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] CALL assume_abort_if_not((double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] RET assume_abort_if_not((double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L79] double_Array_0[1][0] = __VERIFIER_nondet_double() [L80] EXPR double_Array_0[1][0] [L80] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F [L80] EXPR double_Array_0[1][0] [L80] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] CALL assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] RET assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L81] double_Array_0[0][1] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[0][1] [L82] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F [L82] EXPR double_Array_0[0][1] [L82] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] EXPR (double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] EXPR (double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] CALL assume_abort_if_not((double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] RET assume_abort_if_not((double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L83] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L84] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L86] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L87] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L88] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] signed_char_Array_0[3] = __VERIFIER_nondet_char() [L90] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] CALL assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] RET assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L92] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L93] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L93] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L93] RET assume_abort_if_not(signed_long_int_Array_0[0] >= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L94] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L94] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L94] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L95] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L96] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L96] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L96] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L98] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L99] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L99] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L99] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L100] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L100] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L100] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L101] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L102] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L102] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L102] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L103] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L103] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L103] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L117] RET updateVariables() [L118] CALL step() [L47] EXPR unsigned_long_int_Array_0[0] [L47] unsigned_long_int_Array_0[1] = unsigned_long_int_Array_0[0] [L48] EXPR double_Array_0[0][0] [L48] float_Array_0[0] = double_Array_0[0][0] [L49] EXPR signed_char_Array_0[0] [L49] signed_char_Array_0[4] = signed_char_Array_0[0] [L50] EXPR BOOL_unsigned_char_Array_0[1] [L50] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L51] EXPR signed_char_Array_0[4] [L51] signed char stepLocal_1 = signed_char_Array_0[4]; [L52] EXPR unsigned_short_int_Array_0[0] [L52] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L52] COND FALSE !((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= stepLocal_1) [L55] EXPR signed_char_Array_0[0] [L55] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L55] EXPR ((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]) [L55] EXPR signed_char_Array_0[0] [L55] EXPR ((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_1=-1, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L55] signed_char_Array_0[1] = ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))) [L57] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L57] COND TRUE BOOL_unsigned_char_Array_0[0] [L58] EXPR signed_char_Array_0[0] [L58] EXPR signed_char_Array_0[3] [L58] signed_long_int_Array_0[1] = (signed_char_Array_0[0] - signed_char_Array_0[3]) [L62] EXPR signed_long_int_Array_0[1] [L62] signed long int stepLocal_0 = signed_long_int_Array_0[1]; [L63] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L63] COND TRUE stepLocal_0 < unsigned_long_int_Array_0[1] [L64] double_Array_0[1][1] = -0.5 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L118] RET step() [L119] CALL, EXPR property() [L109] EXPR unsigned_long_int_Array_0[1] [L109] EXPR unsigned_long_int_Array_0[0] [L109] EXPR (unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0])))) [L109] EXPR signed_long_int_Array_0[1] [L109] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))) [L109] EXPR double_Array_0[1][1] [L109] EXPR (signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1])))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1])))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0]))) && (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0]))) && (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0]))) && (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0]))) && (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109-L110] return ((((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0]))) && (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) ; [L119] RET, EXPR property() [L119] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 7, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 2636 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1728 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 205 IncrementalHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 908 mSDtfsCounter, 205 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=6, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1031 NumberOfCodeBlocks, 1031 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 876 ConstructedInterpolants, 0 QuantifiedInterpolants, 990 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 4104/4104 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 [2023-11-26 11:58:06,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme --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 e1928f1269d04d8b5de337525ff72bdfae3247245ae6db35e73e266008ad3a3d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:58:09,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:58:09,214 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-26 11:58:09,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:58:09,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:58:09,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:58:09,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:58:09,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:58:09,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:58:09,251 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:58:09,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:58:09,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:58:09,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:58:09,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:58:09,255 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:58:09,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:58:09,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:58:09,257 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:58:09,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:58:09,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:58:09,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:58:09,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:58:09,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:58:09,260 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:58:09,260 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 11:58:09,261 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 11:58:09,261 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:58:09,262 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:58:09,262 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:58:09,262 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:58:09,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:58:09,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:58:09,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:58:09,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:58:09,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:58:09,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:58:09,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:58:09,267 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 11:58:09,267 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 11:58:09,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:58:09,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:58:09,268 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:58:09,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:58:09,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:58:09,269 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 11:58:09,269 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme 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 -> e1928f1269d04d8b5de337525ff72bdfae3247245ae6db35e73e266008ad3a3d [2023-11-26 11:58:09,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:58:09,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:58:09,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:58:09,773 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:58:09,775 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:58:09,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i [2023-11-26 11:58:13,209 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:58:13,541 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:58:13,541 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i [2023-11-26 11:58:13,554 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/data/fd9754bcb/4876e0c6bd284e77b2d22cc1ad2fed49/FLAG17e601464 [2023-11-26 11:58:13,578 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/data/fd9754bcb/4876e0c6bd284e77b2d22cc1ad2fed49 [2023-11-26 11:58:13,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:58:13,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:58:13,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:58:13,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:58:13,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:58:13,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:58:13" (1/1) ... [2023-11-26 11:58:13,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ffd5de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:13, skipping insertion in model container [2023-11-26 11:58:13,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:58:13" (1/1) ... [2023-11-26 11:58:13,642 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:58:13,845 WARN L240 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_c405e70a-caad-4ffd-b1aa-c23f6e310795/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i[916,929] [2023-11-26 11:58:13,967 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:58:13,994 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:58:14,012 WARN L240 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_c405e70a-caad-4ffd-b1aa-c23f6e310795/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i[916,929] [2023-11-26 11:58:14,172 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:58:14,223 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:58:14,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:14 WrapperNode [2023-11-26 11:58:14,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:58:14,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:58:14,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:58:14,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:58:14,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:14" (1/1) ... [2023-11-26 11:58:14,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:14" (1/1) ... [2023-11-26 11:58:14,335 INFO L138 Inliner]: procedures = 39, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 443 [2023-11-26 11:58:14,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:58:14,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:58:14,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:58:14,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:58:14,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:14" (1/1) ... [2023-11-26 11:58:14,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:14" (1/1) ... [2023-11-26 11:58:14,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:14" (1/1) ... [2023-11-26 11:58:14,417 INFO L175 MemorySlicer]: Split 142 memory accesses to 8 slices as follows [2, 11, 36, 3, 48, 13, 11, 18]. 34 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 2, 4, 1, 5, 2, 2, 2]. The 22 writes are split as follows [0, 2, 6, 1, 6, 3, 2, 2]. [2023-11-26 11:58:14,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:14" (1/1) ... [2023-11-26 11:58:14,418 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:14" (1/1) ... [2023-11-26 11:58:14,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:14" (1/1) ... [2023-11-26 11:58:14,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:14" (1/1) ... [2023-11-26 11:58:14,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:14" (1/1) ... [2023-11-26 11:58:14,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:14" (1/1) ... [2023-11-26 11:58:14,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:58:14,550 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:58:14,550 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:58:14,550 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:58:14,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:14" (1/1) ... [2023-11-26 11:58:14,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:58:14,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:58:14,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:58:14,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:58:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:58:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-11-26 11:58:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-11-26 11:58:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2023-11-26 11:58:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2023-11-26 11:58:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2023-11-26 11:58:14,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2023-11-26 11:58:14,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2023-11-26 11:58:14,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2023-11-26 11:58:14,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-11-26 11:58:14,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-11-26 11:58:14,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2023-11-26 11:58:14,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2023-11-26 11:58:14,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2023-11-26 11:58:14,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2023-11-26 11:58:14,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2023-11-26 11:58:14,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2023-11-26 11:58:14,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-26 11:58:14,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-26 11:58:14,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-26 11:58:14,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-26 11:58:14,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-11-26 11:58:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-11-26 11:58:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2023-11-26 11:58:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2023-11-26 11:58:14,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-11-26 11:58:14,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-11-26 11:58:14,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2023-11-26 11:58:14,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2023-11-26 11:58:14,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2023-11-26 11:58:14,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2023-11-26 11:58:14,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2023-11-26 11:58:14,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2023-11-26 11:58:14,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 11:58:14,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-26 11:58:14,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-26 11:58:14,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-26 11:58:14,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-26 11:58:14,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-11-26 11:58:14,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2023-11-26 11:58:14,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2023-11-26 11:58:14,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-11-26 11:58:14,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-11-26 11:58:14,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-11-26 11:58:14,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-11-26 11:58:14,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-11-26 11:58:14,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-11-26 11:58:14,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2023-11-26 11:58:14,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2023-11-26 11:58:14,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2023-11-26 11:58:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2023-11-26 11:58:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2023-11-26 11:58:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2023-11-26 11:58:14,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2023-11-26 11:58:14,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2023-11-26 11:58:14,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2023-11-26 11:58:14,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2023-11-26 11:58:14,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-11-26 11:58:14,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-11-26 11:58:14,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2023-11-26 11:58:14,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2023-11-26 11:58:14,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2023-11-26 11:58:14,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2023-11-26 11:58:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2023-11-26 11:58:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2023-11-26 11:58:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-26 11:58:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-26 11:58:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-26 11:58:14,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-26 11:58:14,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-11-26 11:58:14,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-11-26 11:58:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2023-11-26 11:58:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2023-11-26 11:58:14,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-11-26 11:58:14,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-11-26 11:58:14,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2023-11-26 11:58:14,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2023-11-26 11:58:14,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2023-11-26 11:58:14,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2023-11-26 11:58:14,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2023-11-26 11:58:14,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2023-11-26 11:58:14,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2023-11-26 11:58:14,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2023-11-26 11:58:14,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2023-11-26 11:58:14,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2023-11-26 11:58:14,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2023-11-26 11:58:14,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2023-11-26 11:58:14,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2023-11-26 11:58:14,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2023-11-26 11:58:14,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2023-11-26 11:58:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2023-11-26 11:58:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2023-11-26 11:58:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2023-11-26 11:58:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2023-11-26 11:58:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2023-11-26 11:58:14,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2023-11-26 11:58:14,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2023-11-26 11:58:14,679 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 11:58:14,679 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 11:58:14,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:58:14,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:58:14,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-11-26 11:58:14,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-11-26 11:58:14,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-11-26 11:58:14,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-11-26 11:58:14,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-11-26 11:58:14,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-11-26 11:58:14,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2023-11-26 11:58:14,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2023-11-26 11:58:14,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-11-26 11:58:14,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-11-26 11:58:14,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2023-11-26 11:58:14,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2023-11-26 11:58:14,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2023-11-26 11:58:14,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2023-11-26 11:58:14,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2023-11-26 11:58:14,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2023-11-26 11:58:14,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-26 11:58:14,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-26 11:58:14,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-26 11:58:14,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-26 11:58:14,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-26 11:58:14,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-11-26 11:58:14,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2023-11-26 11:58:14,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2023-11-26 11:58:14,961 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:58:14,964 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:58:16,512 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:58:16,622 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:58:16,622 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:58:16,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:16 BoogieIcfgContainer [2023-11-26 11:58:16,624 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:58:16,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:58:16,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:58:16,630 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:58:16,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:58:13" (1/3) ... [2023-11-26 11:58:16,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fcbd683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:58:16, skipping insertion in model container [2023-11-26 11:58:16,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:14" (2/3) ... [2023-11-26 11:58:16,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fcbd683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:58:16, skipping insertion in model container [2023-11-26 11:58:16,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:16" (3/3) ... [2023-11-26 11:58:16,635 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-10.i [2023-11-26 11:58:16,655 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:58:16,655 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:58:16,724 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:58:16,731 INFO L357 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, mHoare=true, 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;@3fc89e31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:58:16,731 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:58:16,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 83 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-26 11:58:16,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-26 11:58:16,754 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:16,754 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:16,755 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:16,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:16,761 INFO L85 PathProgramCache]: Analyzing trace with hash 842837506, now seen corresponding path program 1 times [2023-11-26 11:58:16,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:58:16,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180361303] [2023-11-26 11:58:16,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:16,789 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 [2023-11-26 11:58:16,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:58:16,791 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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) [2023-11-26 11:58:16,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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 [2023-11-26 11:58:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:17,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-26 11:58:17,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:58:17,466 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2023-11-26 11:58:17,467 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:58:17,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:58:17,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180361303] [2023-11-26 11:58:17,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180361303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:17,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:17,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:17,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240819243] [2023-11-26 11:58:17,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:17,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:58:17,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:58:17,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:58:17,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:58:17,517 INFO L87 Difference]: Start difference. First operand has 104 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 83 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 11:58:17,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:58:17,787 INFO L93 Difference]: Finished difference Result 205 states and 325 transitions. [2023-11-26 11:58:17,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:58:17,789 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2023-11-26 11:58:17,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:58:17,797 INFO L225 Difference]: With dead ends: 205 [2023-11-26 11:58:17,797 INFO L226 Difference]: Without dead ends: 102 [2023-11-26 11:58:17,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:58:17,806 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:58:17,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 11:58:17,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-26 11:58:17,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-26 11:58:17,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.345679012345679) internal successors, (109), 81 states have internal predecessors, (109), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-26 11:58:17,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 147 transitions. [2023-11-26 11:58:17,859 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 147 transitions. Word has length 147 [2023-11-26 11:58:17,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:58:17,860 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 147 transitions. [2023-11-26 11:58:17,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 11:58:17,861 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 147 transitions. [2023-11-26 11:58:17,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-26 11:58:17,865 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:17,865 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:17,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-26 11:58:18,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:58:18,082 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:18,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1622074856, now seen corresponding path program 1 times [2023-11-26 11:58:18,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:58:18,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612778415] [2023-11-26 11:58:18,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:18,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 [2023-11-26 11:58:18,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:58:18,087 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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) [2023-11-26 11:58:18,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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 [2023-11-26 11:58:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:18,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:58:18,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:58:18,788 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2023-11-26 11:58:18,791 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:58:18,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:58:18,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612778415] [2023-11-26 11:58:18,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612778415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:18,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:18,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:58:18,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364737535] [2023-11-26 11:58:18,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:18,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:58:18,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:58:18,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:58:18,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:58:18,804 INFO L87 Difference]: Start difference. First operand 102 states and 147 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 11:58:19,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:58:19,205 INFO L93 Difference]: Finished difference Result 209 states and 302 transitions. [2023-11-26 11:58:19,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:58:19,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2023-11-26 11:58:19,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:58:19,208 INFO L225 Difference]: With dead ends: 209 [2023-11-26 11:58:19,209 INFO L226 Difference]: Without dead ends: 108 [2023-11-26 11:58:19,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:58:19,216 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 10 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:58:19,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 421 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 11:58:19,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-26 11:58:19,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2023-11-26 11:58:19,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-26 11:58:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2023-11-26 11:58:19,237 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 147 [2023-11-26 11:58:19,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:58:19,238 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 149 transitions. [2023-11-26 11:58:19,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 11:58:19,239 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 149 transitions. [2023-11-26 11:58:19,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-26 11:58:19,244 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:19,245 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:19,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-26 11:58:19,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:58:19,446 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:19,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:19,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1258608358, now seen corresponding path program 1 times [2023-11-26 11:58:19,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:58:19,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166791869] [2023-11-26 11:58:19,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:19,452 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 [2023-11-26 11:58:19,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:58:19,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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) [2023-11-26 11:58:19,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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 [2023-11-26 11:58:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:19,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 11:58:20,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:58:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 11:58:20,054 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:58:20,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:58:20,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166791869] [2023-11-26 11:58:20,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166791869] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:20,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:20,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:58:20,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692452907] [2023-11-26 11:58:20,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:20,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:58:20,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:58:20,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:58:20,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:58:20,059 INFO L87 Difference]: Start difference. First operand 104 states and 149 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 11:58:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:58:20,703 INFO L93 Difference]: Finished difference Result 239 states and 343 transitions. [2023-11-26 11:58:20,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-26 11:58:20,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-11-26 11:58:20,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:58:20,708 INFO L225 Difference]: With dead ends: 239 [2023-11-26 11:58:20,708 INFO L226 Difference]: Without dead ends: 136 [2023-11-26 11:58:20,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-26 11:58:20,717 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 83 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 11:58:20,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 677 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 11:58:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-26 11:58:20,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 110. [2023-11-26 11:58:20,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 89 states have internal predecessors, (117), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-26 11:58:20,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 155 transitions. [2023-11-26 11:58:20,735 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 155 transitions. Word has length 147 [2023-11-26 11:58:20,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:58:20,736 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 155 transitions. [2023-11-26 11:58:20,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 11:58:20,737 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 155 transitions. [2023-11-26 11:58:20,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-26 11:58:20,740 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:20,740 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:20,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-26 11:58:20,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:58:20,951 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:20,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:20,951 INFO L85 PathProgramCache]: Analyzing trace with hash 449261732, now seen corresponding path program 1 times [2023-11-26 11:58:20,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:58:20,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112353789] [2023-11-26 11:58:20,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:20,953 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 [2023-11-26 11:58:20,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:58:20,954 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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) [2023-11-26 11:58:20,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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 [2023-11-26 11:58:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:21,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-26 11:58:21,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:58:21,474 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 11:58:21,474 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:58:21,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:58:21,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112353789] [2023-11-26 11:58:21,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112353789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:21,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:21,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 11:58:21,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777988352] [2023-11-26 11:58:21,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:21,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:58:21,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:58:21,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:58:21,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:58:21,487 INFO L87 Difference]: Start difference. First operand 110 states and 155 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 11:58:22,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:58:22,253 INFO L93 Difference]: Finished difference Result 248 states and 347 transitions. [2023-11-26 11:58:22,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-26 11:58:22,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-11-26 11:58:22,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:58:22,256 INFO L225 Difference]: With dead ends: 248 [2023-11-26 11:58:22,256 INFO L226 Difference]: Without dead ends: 139 [2023-11-26 11:58:22,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-11-26 11:58:22,259 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 85 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 11:58:22,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 804 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 11:58:22,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-26 11:58:22,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 112. [2023-11-26 11:58:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 states have internal predecessors, (119), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-26 11:58:22,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2023-11-26 11:58:22,274 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 147 [2023-11-26 11:58:22,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:58:22,275 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2023-11-26 11:58:22,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 11:58:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2023-11-26 11:58:22,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-26 11:58:22,277 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:22,278 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:22,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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 [2023-11-26 11:58:22,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:58:22,492 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:22,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:22,493 INFO L85 PathProgramCache]: Analyzing trace with hash 506520034, now seen corresponding path program 1 times [2023-11-26 11:58:22,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:58:22,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300990294] [2023-11-26 11:58:22,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:22,494 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 [2023-11-26 11:58:22,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:58:22,495 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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) [2023-11-26 11:58:22,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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 [2023-11-26 11:58:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:22,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-26 11:58:22,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:58:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 11:58:23,060 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:58:23,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:58:23,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300990294] [2023-11-26 11:58:23,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300990294] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:23,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:23,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 11:58:23,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704519574] [2023-11-26 11:58:23,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:23,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 11:58:23,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:58:23,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 11:58:23,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:58:23,064 INFO L87 Difference]: Start difference. First operand 112 states and 157 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 11:58:23,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:58:23,886 INFO L93 Difference]: Finished difference Result 251 states and 346 transitions. [2023-11-26 11:58:23,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-26 11:58:23,887 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-11-26 11:58:23,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:58:23,889 INFO L225 Difference]: With dead ends: 251 [2023-11-26 11:58:23,890 INFO L226 Difference]: Without dead ends: 140 [2023-11-26 11:58:23,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2023-11-26 11:58:23,892 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 71 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 11:58:23,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 926 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 11:58:23,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-26 11:58:23,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 114. [2023-11-26 11:58:23,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3010752688172043) internal successors, (121), 93 states have internal predecessors, (121), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-26 11:58:23,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2023-11-26 11:58:23,906 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 147 [2023-11-26 11:58:23,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:58:23,907 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2023-11-26 11:58:23,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 11:58:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2023-11-26 11:58:23,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-26 11:58:23,910 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:23,910 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:23,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-26 11:58:24,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:58:24,120 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:24,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:24,121 INFO L85 PathProgramCache]: Analyzing trace with hash 506579616, now seen corresponding path program 1 times [2023-11-26 11:58:24,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:58:24,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197896447] [2023-11-26 11:58:24,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:24,122 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 [2023-11-26 11:58:24,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:58:24,123 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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) [2023-11-26 11:58:24,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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 [2023-11-26 11:58:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:24,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-26 11:58:24,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:58:24,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:58:24,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2023-11-26 11:58:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2023-11-26 11:58:24,810 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:58:24,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:58:24,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197896447] [2023-11-26 11:58:24,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197896447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:24,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:24,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:58:24,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727745655] [2023-11-26 11:58:24,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:24,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:58:24,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:58:24,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:58:24,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:58:24,814 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 11:58:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:58:26,439 INFO L93 Difference]: Finished difference Result 233 states and 326 transitions. [2023-11-26 11:58:26,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:58:26,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2023-11-26 11:58:26,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:58:26,446 INFO L225 Difference]: With dead ends: 233 [2023-11-26 11:58:26,446 INFO L226 Difference]: Without dead ends: 120 [2023-11-26 11:58:26,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-11-26 11:58:26,448 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 142 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-26 11:58:26,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 442 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-26 11:58:26,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-26 11:58:26,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2023-11-26 11:58:26,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-26 11:58:26,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 158 transitions. [2023-11-26 11:58:26,459 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 158 transitions. Word has length 147 [2023-11-26 11:58:26,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:58:26,459 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 158 transitions. [2023-11-26 11:58:26,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 11:58:26,460 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 158 transitions. [2023-11-26 11:58:26,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-26 11:58:26,462 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:26,462 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:26,475 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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 [2023-11-26 11:58:26,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:58:26,671 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:26,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:26,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1182800666, now seen corresponding path program 1 times [2023-11-26 11:58:26,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:58:26,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158045174] [2023-11-26 11:58:26,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:26,673 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 [2023-11-26 11:58:26,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:58:26,674 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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) [2023-11-26 11:58:26,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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 [2023-11-26 11:58:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:27,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-26 11:58:27,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:58:27,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:58:27,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2023-11-26 11:58:27,384 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2023-11-26 11:58:27,384 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:58:27,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:58:27,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158045174] [2023-11-26 11:58:27,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158045174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:27,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:27,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:58:27,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604865818] [2023-11-26 11:58:27,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:27,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:58:27,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:58:27,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:58:27,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:58:27,387 INFO L87 Difference]: Start difference. First operand 114 states and 158 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 11:58:29,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:58:29,486 INFO L93 Difference]: Finished difference Result 233 states and 324 transitions. [2023-11-26 11:58:29,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:58:29,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2023-11-26 11:58:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:58:29,496 INFO L225 Difference]: With dead ends: 233 [2023-11-26 11:58:29,496 INFO L226 Difference]: Without dead ends: 120 [2023-11-26 11:58:29,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-11-26 11:58:29,497 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 133 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:58:29,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 436 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-26 11:58:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-26 11:58:29,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2023-11-26 11:58:29,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.2795698924731183) internal successors, (119), 93 states have internal predecessors, (119), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-26 11:58:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 157 transitions. [2023-11-26 11:58:29,521 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 157 transitions. Word has length 149 [2023-11-26 11:58:29,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:58:29,522 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 157 transitions. [2023-11-26 11:58:29,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 11:58:29,522 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 157 transitions. [2023-11-26 11:58:29,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-26 11:58:29,524 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:29,525 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:29,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-26 11:58:29,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:58:29,740 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:29,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:29,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2140759328, now seen corresponding path program 1 times [2023-11-26 11:58:29,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:58:29,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259097568] [2023-11-26 11:58:29,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:29,742 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 [2023-11-26 11:58:29,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:58:29,743 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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) [2023-11-26 11:58:29,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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 [2023-11-26 11:58:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:30,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-26 11:58:30,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:58:30,337 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 8 treesize of output 1 [2023-11-26 11:58:30,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-11-26 11:58:30,438 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 11:58:30,438 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:58:30,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:58:30,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259097568] [2023-11-26 11:58:30,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259097568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:30,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:30,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:58:30,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796085889] [2023-11-26 11:58:30,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:30,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:58:30,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:58:30,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:58:30,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:58:30,443 INFO L87 Difference]: Start difference. First operand 114 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 11:58:30,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:58:30,615 INFO L93 Difference]: Finished difference Result 273 states and 378 transitions. [2023-11-26 11:58:30,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:58:30,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2023-11-26 11:58:30,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:58:30,618 INFO L225 Difference]: With dead ends: 273 [2023-11-26 11:58:30,618 INFO L226 Difference]: Without dead ends: 160 [2023-11-26 11:58:30,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:58:30,619 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 123 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 472 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 [2023-11-26 11:58:30,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 472 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:58:30,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-26 11:58:30,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2023-11-26 11:58:30,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 124 states have (on average 1.2580645161290323) internal successors, (156), 125 states have internal predecessors, (156), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-26 11:58:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 220 transitions. [2023-11-26 11:58:30,636 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 220 transitions. Word has length 151 [2023-11-26 11:58:30,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:58:30,637 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 220 transitions. [2023-11-26 11:58:30,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 11:58:30,638 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 220 transitions. [2023-11-26 11:58:30,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-26 11:58:30,640 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:30,640 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:30,652 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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 [2023-11-26 11:58:30,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:58:30,853 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:30,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:30,853 INFO L85 PathProgramCache]: Analyzing trace with hash 679695045, now seen corresponding path program 1 times [2023-11-26 11:58:30,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:58:30,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138641069] [2023-11-26 11:58:30,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:30,854 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 [2023-11-26 11:58:30,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:58:30,857 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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) [2023-11-26 11:58:30,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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 [2023-11-26 11:58:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:31,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-26 11:58:31,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:58:31,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:58:31,425 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 20 treesize of output 21 [2023-11-26 11:58:31,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:58:31,566 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 139 treesize of output 55 [2023-11-26 11:58:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 11:58:31,621 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:58:31,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:58:31,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138641069] [2023-11-26 11:58:31,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138641069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:31,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:31,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:58:31,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003552468] [2023-11-26 11:58:31,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:31,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:58:31,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:58:31,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:58:31,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:58:31,624 INFO L87 Difference]: Start difference. First operand 159 states and 220 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 11:58:35,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:58:35,355 INFO L93 Difference]: Finished difference Result 417 states and 569 transitions. [2023-11-26 11:58:35,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:58:35,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2023-11-26 11:58:35,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:58:35,366 INFO L225 Difference]: With dead ends: 417 [2023-11-26 11:58:35,366 INFO L226 Difference]: Without dead ends: 302 [2023-11-26 11:58:35,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-26 11:58:35,368 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 240 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-26 11:58:35,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1069 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2023-11-26 11:58:35,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-11-26 11:58:35,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 262. [2023-11-26 11:58:35,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 206 states have (on average 1.2475728155339805) internal successors, (257), 208 states have internal predecessors, (257), 51 states have call successors, (51), 4 states have call predecessors, (51), 4 states have return successors, (51), 49 states have call predecessors, (51), 51 states have call successors, (51) [2023-11-26 11:58:35,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 359 transitions. [2023-11-26 11:58:35,404 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 359 transitions. Word has length 153 [2023-11-26 11:58:35,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:58:35,405 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 359 transitions. [2023-11-26 11:58:35,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 11:58:35,405 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 359 transitions. [2023-11-26 11:58:35,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-26 11:58:35,407 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:35,407 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:35,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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 [2023-11-26 11:58:35,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:58:35,618 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:35,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:35,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1991939947, now seen corresponding path program 1 times [2023-11-26 11:58:35,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:58:35,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32905850] [2023-11-26 11:58:35,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:35,619 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 [2023-11-26 11:58:35,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:58:35,623 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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) [2023-11-26 11:58:35,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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 [2023-11-26 11:58:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:36,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-26 11:58:36,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:58:36,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:58:36,253 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 30 treesize of output 20 [2023-11-26 11:58:36,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-11-26 11:58:36,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2023-11-26 11:58:36,516 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 8 [2023-11-26 11:58:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 11:58:36,566 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:58:36,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:58:36,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32905850] [2023-11-26 11:58:36,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32905850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:36,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:36,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:58:36,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264129734] [2023-11-26 11:58:36,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:36,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:58:36,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:58:36,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:58:36,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:58:36,569 INFO L87 Difference]: Start difference. First operand 262 states and 359 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 11:58:38,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:58:38,876 INFO L93 Difference]: Finished difference Result 701 states and 951 transitions. [2023-11-26 11:58:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:58:38,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2023-11-26 11:58:38,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:58:38,881 INFO L225 Difference]: With dead ends: 701 [2023-11-26 11:58:38,881 INFO L226 Difference]: Without dead ends: 483 [2023-11-26 11:58:38,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:58:38,883 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 292 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:58:38,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 633 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-26 11:58:38,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2023-11-26 11:58:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 268. [2023-11-26 11:58:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 212 states have (on average 1.25) internal successors, (265), 214 states have internal predecessors, (265), 51 states have call successors, (51), 4 states have call predecessors, (51), 4 states have return successors, (51), 49 states have call predecessors, (51), 51 states have call successors, (51) [2023-11-26 11:58:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 367 transitions. [2023-11-26 11:58:38,961 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 367 transitions. Word has length 154 [2023-11-26 11:58:38,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:58:38,965 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 367 transitions. [2023-11-26 11:58:38,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 11:58:38,965 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 367 transitions. [2023-11-26 11:58:38,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-26 11:58:38,968 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:38,968 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:38,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-26 11:58:39,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:58:39,172 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:39,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:39,172 INFO L85 PathProgramCache]: Analyzing trace with hash -703674261, now seen corresponding path program 1 times [2023-11-26 11:58:39,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:58:39,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564975008] [2023-11-26 11:58:39,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:39,173 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 [2023-11-26 11:58:39,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:58:39,174 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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) [2023-11-26 11:58:39,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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 [2023-11-26 11:58:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:39,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-26 11:58:39,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:58:39,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:58:39,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 20 [2023-11-26 11:58:39,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-11-26 11:58:39,992 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 41 treesize of output 23 [2023-11-26 11:58:40,000 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 [2023-11-26 11:58:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 11:58:40,103 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:58:40,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:58:40,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564975008] [2023-11-26 11:58:40,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564975008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:40,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:40,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:58:40,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205081365] [2023-11-26 11:58:40,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:40,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:58:40,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:58:40,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:58:40,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:58:40,106 INFO L87 Difference]: Start difference. First operand 268 states and 367 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 11:58:43,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:58:43,076 INFO L93 Difference]: Finished difference Result 603 states and 817 transitions. [2023-11-26 11:58:43,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:58:43,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2023-11-26 11:58:43,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:58:43,089 INFO L225 Difference]: With dead ends: 603 [2023-11-26 11:58:43,089 INFO L226 Difference]: Without dead ends: 379 [2023-11-26 11:58:43,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:58:43,090 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 283 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-26 11:58:43,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 821 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-26 11:58:43,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2023-11-26 11:58:43,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 271. [2023-11-26 11:58:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 215 states have (on average 1.2465116279069768) internal successors, (268), 217 states have internal predecessors, (268), 51 states have call successors, (51), 4 states have call predecessors, (51), 4 states have return successors, (51), 49 states have call predecessors, (51), 51 states have call successors, (51) [2023-11-26 11:58:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 370 transitions. [2023-11-26 11:58:43,136 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 370 transitions. Word has length 155 [2023-11-26 11:58:43,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:58:43,136 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 370 transitions. [2023-11-26 11:58:43,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 11:58:43,137 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 370 transitions. [2023-11-26 11:58:43,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-26 11:58:43,138 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:43,138 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:43,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-26 11:58:43,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:58:43,346 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:43,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1938258833, now seen corresponding path program 1 times [2023-11-26 11:58:43,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:58:43,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876021653] [2023-11-26 11:58:43,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:43,347 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 [2023-11-26 11:58:43,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:58:43,348 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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) [2023-11-26 11:58:43,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c405e70a-caad-4ffd-b1aa-c23f6e310795/bin/uautomizer-verify-VRDe98Ueme/mathsat -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 [2023-11-26 11:58:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:44,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-26 11:58:44,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:58:44,472 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 26 treesize of output 1 [2023-11-26 11:58:44,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:58:44,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 77 [2023-11-26 11:58:49,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:58:49,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 83