./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-69.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-69.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX --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 5c15f73011971e7f9bd48b99f89b794b5729611ad3fcb074d96fa69f3502bd77 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:51:20,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:51:20,498 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:51:20,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:51:20,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:51:20,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:51:20,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:51:20,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:51:20,556 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:51:20,559 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:51:20,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:51:20,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:51:20,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:51:20,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:51:20,566 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:51:20,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:51:20,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:51:20,567 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:51:20,567 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:51:20,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:51:20,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:51:20,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:51:20,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:51:20,572 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:51:20,573 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:51:20,573 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:51:20,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:51:20,574 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:51:20,594 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:51:20,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:51:20,595 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:51:20,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:51:20,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:51:20,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:51:20,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:51:20,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:51:20,600 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:51:20,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:51:20,601 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:51:20,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:51:20,602 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:51:20,602 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:51:20,602 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_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/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_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX 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 -> 5c15f73011971e7f9bd48b99f89b794b5729611ad3fcb074d96fa69f3502bd77 [2024-11-08 16:51:20,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:51:20,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:51:20,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:51:20,976 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:51:20,977 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:51:20,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-69.i Unable to find full path for "g++" [2024-11-08 16:51:23,086 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:51:23,295 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:51:23,295 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-69.i [2024-11-08 16:51:23,304 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/data/98f8733d8/748fb1f907de4f879be6e663bdccae15/FLAGd84ff0ab6 [2024-11-08 16:51:23,320 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/data/98f8733d8/748fb1f907de4f879be6e663bdccae15 [2024-11-08 16:51:23,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:51:23,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:51:23,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:51:23,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:51:23,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:51:23,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:51:23" (1/1) ... [2024-11-08 16:51:23,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e07453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:23, skipping insertion in model container [2024-11-08 16:51:23,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:51:23" (1/1) ... [2024-11-08 16:51:23,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:51:23,578 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-69.i[916,929] [2024-11-08 16:51:23,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:51:23,660 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:51:23,674 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-69.i[916,929] [2024-11-08 16:51:23,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:51:23,753 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:51:23,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:23 WrapperNode [2024-11-08 16:51:23,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:51:23,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:51:23,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:51:23,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:51:23,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:23" (1/1) ... [2024-11-08 16:51:23,773 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:23" (1/1) ... [2024-11-08 16:51:23,811 INFO L138 Inliner]: procedures = 29, calls = 168, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 499 [2024-11-08 16:51:23,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:51:23,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:51:23,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:51:23,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:51:23,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:23" (1/1) ... [2024-11-08 16:51:23,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:23" (1/1) ... [2024-11-08 16:51:23,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:23" (1/1) ... [2024-11-08 16:51:23,866 INFO L175 MemorySlicer]: Split 131 memory accesses to 12 slices as follows [2, 7, 10, 14, 16, 12, 17, 14, 8, 8, 9, 14]. 13 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 2, 1, 1, 1, 1, 4, 1, 1, 1, 4, 1]. [2024-11-08 16:51:23,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:23" (1/1) ... [2024-11-08 16:51:23,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:23" (1/1) ... [2024-11-08 16:51:23,884 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:23" (1/1) ... [2024-11-08 16:51:23,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:23" (1/1) ... [2024-11-08 16:51:23,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:23" (1/1) ... [2024-11-08 16:51:23,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:23" (1/1) ... [2024-11-08 16:51:23,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:51:23,903 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:51:23,903 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:51:23,903 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:51:23,904 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:23" (1/1) ... [2024-11-08 16:51:23,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:51:23,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:23,940 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:51:23,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:51:23,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:51:23,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-08 16:51:23,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-08 16:51:23,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-08 16:51:23,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-08 16:51:23,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-08 16:51:23,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-08 16:51:23,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-08 16:51:23,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-08 16:51:23,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-08 16:51:23,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-08 16:51:23,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-08 16:51:23,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-08 16:51:23,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 16:51:23,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 16:51:23,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 16:51:23,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 16:51:23,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 16:51:23,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-08 16:51:23,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-08 16:51:23,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-08 16:51:23,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-08 16:51:23,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-08 16:51:23,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-08 16:51:23,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-08 16:51:23,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-08 16:51:23,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-08 16:51:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-08 16:51:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-08 16:51:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-08 16:51:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-08 16:51:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-08 16:51:23,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-08 16:51:23,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-08 16:51:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-08 16:51:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-08 16:51:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-08 16:51:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 16:51:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 16:51:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 16:51:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 16:51:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 16:51:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-08 16:51:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-08 16:51:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-08 16:51:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-08 16:51:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-08 16:51:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-08 16:51:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-08 16:51:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-08 16:51:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-08 16:51:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-08 16:51:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-08 16:51:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-08 16:51:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-08 16:51:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-08 16:51:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-08 16:51:24,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-08 16:51:24,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-08 16:51:24,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-08 16:51:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-08 16:51:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:51:24,004 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:51:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:51:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 16:51:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 16:51:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 16:51:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 16:51:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-08 16:51:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-08 16:51:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-08 16:51:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-08 16:51:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-08 16:51:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-08 16:51:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-08 16:51:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:51:24,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:51:24,280 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:51:24,283 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:51:25,034 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-08 16:51:25,034 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:51:25,053 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:51:25,053 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:51:25,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:51:25 BoogieIcfgContainer [2024-11-08 16:51:25,054 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:51:25,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:51:25,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:51:25,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:51:25,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:51:23" (1/3) ... [2024-11-08 16:51:25,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c364056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:51:25, skipping insertion in model container [2024-11-08 16:51:25,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:23" (2/3) ... [2024-11-08 16:51:25,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c364056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:51:25, skipping insertion in model container [2024-11-08 16:51:25,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:51:25" (3/3) ... [2024-11-08 16:51:25,069 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-69.i [2024-11-08 16:51:25,092 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:51:25,092 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:51:25,193 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:51:25,205 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@a61825d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:51:25,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:51:25,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:51:25,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 16:51:25,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:51:25,232 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:25,233 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:51:25,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:25,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1301228568, now seen corresponding path program 1 times [2024-11-08 16:51:25,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:25,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441942980] [2024-11-08 16:51:25,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:25,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:25,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:51:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:25,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:51:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:25,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:51:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:25,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:51:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:25,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:51:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:25,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:51:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:25,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:51:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:25,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:51:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:25,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:51:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:25,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:51:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:25,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:51:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:25,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:51:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:25,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:51:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:25,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:51:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:25,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:51:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:51:25,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:25,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441942980] [2024-11-08 16:51:25,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441942980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:51:25,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:51:25,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:51:25,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376787622] [2024-11-08 16:51:25,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:51:25,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:51:25,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:26,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:51:26,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:51:26,010 INFO L87 Difference]: Start difference. First operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 16:51:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:51:26,063 INFO L93 Difference]: Finished difference Result 181 states and 287 transitions. [2024-11-08 16:51:26,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:51:26,068 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2024-11-08 16:51:26,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:51:26,079 INFO L225 Difference]: With dead ends: 181 [2024-11-08 16:51:26,080 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 16:51:26,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:51:26,092 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:51:26,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:51:26,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 16:51:26,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-08 16:51:26,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 73 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:51:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-11-08 16:51:26,181 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 119 [2024-11-08 16:51:26,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:51:26,184 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-11-08 16:51:26,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 16:51:26,184 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-11-08 16:51:26,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 16:51:26,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:51:26,191 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:26,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:51:26,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:51:26,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:26,194 INFO L85 PathProgramCache]: Analyzing trace with hash -2093250050, now seen corresponding path program 1 times [2024-11-08 16:51:26,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:26,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574052153] [2024-11-08 16:51:26,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:26,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:26,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:51:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:26,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:51:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:26,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:51:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:26,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:51:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:26,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:51:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:26,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:51:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:26,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:51:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:26,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:51:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:26,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:51:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:26,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:51:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:26,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:51:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:26,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:51:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:26,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:51:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:26,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:51:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:26,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:51:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:51:26,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:26,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574052153] [2024-11-08 16:51:26,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574052153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:51:26,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:51:26,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:51:26,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515823687] [2024-11-08 16:51:26,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:51:26,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:51:26,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:26,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:51:26,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:51:26,939 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:51:26,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:51:26,994 INFO L93 Difference]: Finished difference Result 179 states and 264 transitions. [2024-11-08 16:51:26,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:51:26,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-11-08 16:51:27,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:51:27,001 INFO L225 Difference]: With dead ends: 179 [2024-11-08 16:51:27,002 INFO L226 Difference]: Without dead ends: 92 [2024-11-08 16:51:27,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:51:27,004 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:51:27,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 379 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:51:27,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-08 16:51:27,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-08 16:51:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:51:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-08 16:51:27,032 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 119 [2024-11-08 16:51:27,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:51:27,036 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-08 16:51:27,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:51:27,038 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-08 16:51:27,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:51:27,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:51:27,045 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:27,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:51:27,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:51:27,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:27,046 INFO L85 PathProgramCache]: Analyzing trace with hash -185680999, now seen corresponding path program 1 times [2024-11-08 16:51:27,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:27,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84533060] [2024-11-08 16:51:27,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:27,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 16:51:27,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1865836431] [2024-11-08 16:51:27,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:27,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:51:27,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:27,321 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:51:27,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 16:51:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:28,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-08 16:51:28,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:51:28,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 16:51:29,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 16:51:29,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 16:51:29,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 16:51:29,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-08 16:51:29,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-08 16:51:30,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-08 16:51:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-08 16:51:30,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:51:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:51:31,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:31,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84533060] [2024-11-08 16:51:31,560 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 16:51:31,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865836431] [2024-11-08 16:51:31,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865836431] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:51:31,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:51:31,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 16 [2024-11-08 16:51:31,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576252830] [2024-11-08 16:51:31,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:51:31,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:51:31,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:31,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:51:31,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:51:31,573 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:51:33,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:51:33,097 INFO L93 Difference]: Finished difference Result 224 states and 327 transitions. [2024-11-08 16:51:33,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:51:33,098 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 16:51:33,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:51:33,100 INFO L225 Difference]: With dead ends: 224 [2024-11-08 16:51:33,100 INFO L226 Difference]: Without dead ends: 135 [2024-11-08 16:51:33,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 223 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-11-08 16:51:33,102 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 166 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:51:33,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 780 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 16:51:33,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-08 16:51:33,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 102. [2024-11-08 16:51:33,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.4) internal successors, (119), 85 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:51:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2024-11-08 16:51:33,131 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 121 [2024-11-08 16:51:33,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:51:33,132 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2024-11-08 16:51:33,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:51:33,132 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2024-11-08 16:51:33,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:51:33,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:51:33,139 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:33,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 16:51:33,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-08 16:51:33,348 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:51:33,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:33,348 INFO L85 PathProgramCache]: Analyzing trace with hash -772487013, now seen corresponding path program 1 times [2024-11-08 16:51:33,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:33,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382502057] [2024-11-08 16:51:33,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:33,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:34,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:51:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:34,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:51:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:34,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:51:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:34,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:51:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:34,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:51:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:34,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:51:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:34,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:51:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:34,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:51:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:34,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:51:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:34,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:51:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:34,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:51:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:34,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:51:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:34,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:51:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:34,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:51:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:34,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:51:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:34,345 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:51:34,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:34,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382502057] [2024-11-08 16:51:34,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382502057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:51:34,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:51:34,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:51:34,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762563020] [2024-11-08 16:51:34,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:51:34,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:51:34,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:34,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:51:34,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:51:34,353 INFO L87 Difference]: Start difference. First operand 102 states and 149 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:51:34,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:51:34,736 INFO L93 Difference]: Finished difference Result 305 states and 443 transitions. [2024-11-08 16:51:34,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:51:34,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 16:51:34,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:51:34,741 INFO L225 Difference]: With dead ends: 305 [2024-11-08 16:51:34,741 INFO L226 Difference]: Without dead ends: 206 [2024-11-08 16:51:34,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:51:34,747 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 175 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:51:34,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 718 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:51:34,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-08 16:51:34,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 162. [2024-11-08 16:51:34,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 142 states have (on average 1.4366197183098592) internal successors, (204), 143 states have internal predecessors, (204), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 16:51:34,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 238 transitions. [2024-11-08 16:51:34,774 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 238 transitions. Word has length 121 [2024-11-08 16:51:34,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:51:34,775 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 238 transitions. [2024-11-08 16:51:34,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:51:34,775 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2024-11-08 16:51:34,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:51:34,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:51:34,778 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:34,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:51:34,778 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:51:34,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:34,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1874624741, now seen corresponding path program 1 times [2024-11-08 16:51:34,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:34,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054312367] [2024-11-08 16:51:34,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:34,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:35,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:51:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:35,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:51:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:35,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:51:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:35,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:51:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:35,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:51:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:35,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:51:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:35,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:51:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:35,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:51:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:35,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:51:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:35,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:51:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:35,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:51:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:35,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:51:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:35,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:51:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:35,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:51:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:35,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:51:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:51:35,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:35,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054312367] [2024-11-08 16:51:35,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054312367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:51:35,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:51:35,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:51:35,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201443768] [2024-11-08 16:51:35,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:51:35,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:51:35,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:35,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:51:35,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:51:35,520 INFO L87 Difference]: Start difference. First operand 162 states and 238 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:51:35,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:51:35,781 INFO L93 Difference]: Finished difference Result 366 states and 531 transitions. [2024-11-08 16:51:35,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:51:35,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 16:51:35,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:51:35,788 INFO L225 Difference]: With dead ends: 366 [2024-11-08 16:51:35,788 INFO L226 Difference]: Without dead ends: 207 [2024-11-08 16:51:35,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:51:35,793 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 62 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:51:35,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 709 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:51:35,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-08 16:51:35,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 113. [2024-11-08 16:51:35,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:51:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-11-08 16:51:35,822 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 121 [2024-11-08 16:51:35,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:51:35,826 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-11-08 16:51:35,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:51:35,827 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-11-08 16:51:35,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:51:35,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:51:35,833 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:35,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:51:35,834 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:51:35,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:35,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1833536541, now seen corresponding path program 1 times [2024-11-08 16:51:35,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:35,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649102762] [2024-11-08 16:51:35,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:35,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 16:51:35,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1889280367] [2024-11-08 16:51:35,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:35,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:51:35,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:35,933 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:51:35,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 16:51:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:36,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 16:51:36,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:51:36,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 16:51:36,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-08 16:51:37,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-08 16:51:37,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-08 16:51:37,371 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:51:37,371 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:51:37,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:37,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649102762] [2024-11-08 16:51:37,372 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 16:51:37,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889280367] [2024-11-08 16:51:37,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889280367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:51:37,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:51:37,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:51:37,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279205790] [2024-11-08 16:51:37,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:51:37,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:51:37,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:37,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:51:37,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:51:37,376 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:51:38,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:51:38,920 INFO L93 Difference]: Finished difference Result 258 states and 368 transitions. [2024-11-08 16:51:38,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:51:38,921 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 16:51:38,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:51:38,922 INFO L225 Difference]: With dead ends: 258 [2024-11-08 16:51:38,923 INFO L226 Difference]: Without dead ends: 148 [2024-11-08 16:51:38,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:51:38,925 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 178 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:51:38,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 925 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 16:51:38,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-08 16:51:38,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 119. [2024-11-08 16:51:38,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:51:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 170 transitions. [2024-11-08 16:51:38,940 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 170 transitions. Word has length 121 [2024-11-08 16:51:38,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:51:38,941 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 170 transitions. [2024-11-08 16:51:38,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:51:38,941 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 170 transitions. [2024-11-08 16:51:38,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 16:51:38,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:51:38,944 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:38,956 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 16:51:39,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 16:51:39,145 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:51:39,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:39,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1035775661, now seen corresponding path program 1 times [2024-11-08 16:51:39,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:39,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652979120] [2024-11-08 16:51:39,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:39,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:39,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:51:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:39,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:51:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:39,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:51:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:39,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:51:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:39,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:51:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:39,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:51:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:39,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:51:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:39,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:51:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:39,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:51:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:39,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:51:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:39,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:51:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:39,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:51:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:39,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:51:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:39,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:51:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:39,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:51:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:39,684 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:51:39,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:39,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652979120] [2024-11-08 16:51:39,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652979120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:51:39,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:51:39,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:51:39,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290974203] [2024-11-08 16:51:39,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:51:39,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:51:39,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:39,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:51:39,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:51:39,687 INFO L87 Difference]: Start difference. First operand 119 states and 170 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:51:39,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:51:39,876 INFO L93 Difference]: Finished difference Result 311 states and 444 transitions. [2024-11-08 16:51:39,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:51:39,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-11-08 16:51:39,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:51:39,879 INFO L225 Difference]: With dead ends: 311 [2024-11-08 16:51:39,879 INFO L226 Difference]: Without dead ends: 195 [2024-11-08 16:51:39,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:51:39,881 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 110 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:51:39,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1003 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:51:39,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-08 16:51:39,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 117. [2024-11-08 16:51:39,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:51:39,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 167 transitions. [2024-11-08 16:51:39,898 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 167 transitions. Word has length 122 [2024-11-08 16:51:39,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:51:39,899 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 167 transitions. [2024-11-08 16:51:39,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:51:39,899 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2024-11-08 16:51:39,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 16:51:39,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:51:39,901 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:39,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:51:39,902 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:51:39,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:39,902 INFO L85 PathProgramCache]: Analyzing trace with hash 632954350, now seen corresponding path program 1 times [2024-11-08 16:51:39,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:39,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312163317] [2024-11-08 16:51:39,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:39,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:40,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:51:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:40,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:51:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:40,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:51:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:40,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:51:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:40,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:51:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:40,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:51:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:40,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:51:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:40,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:51:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:40,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:51:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:40,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:51:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:40,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:51:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:40,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:51:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:40,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:51:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:40,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:51:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:40,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:51:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:51:40,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:40,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312163317] [2024-11-08 16:51:40,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312163317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:51:40,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:51:40,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:51:40,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822784279] [2024-11-08 16:51:40,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:51:40,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:51:40,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:40,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:51:40,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:51:40,438 INFO L87 Difference]: Start difference. First operand 117 states and 167 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:51:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:51:40,625 INFO L93 Difference]: Finished difference Result 323 states and 459 transitions. [2024-11-08 16:51:40,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:51:40,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-11-08 16:51:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:51:40,632 INFO L225 Difference]: With dead ends: 323 [2024-11-08 16:51:40,632 INFO L226 Difference]: Without dead ends: 209 [2024-11-08 16:51:40,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:51:40,634 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 77 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:51:40,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 678 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:51:40,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-08 16:51:40,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2024-11-08 16:51:40,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 178 states have (on average 1.3820224719101124) internal successors, (246), 179 states have internal predecessors, (246), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:51:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 292 transitions. [2024-11-08 16:51:40,659 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 292 transitions. Word has length 122 [2024-11-08 16:51:40,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:51:40,660 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 292 transitions. [2024-11-08 16:51:40,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:51:40,660 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 292 transitions. [2024-11-08 16:51:40,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 16:51:40,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:51:40,663 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:40,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:51:40,663 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:51:40,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:40,664 INFO L85 PathProgramCache]: Analyzing trace with hash 33650091, now seen corresponding path program 1 times [2024-11-08 16:51:40,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:40,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275183514] [2024-11-08 16:51:40,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:40,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:41,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:51:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:41,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:51:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:41,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:51:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:41,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:51:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:41,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:51:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:41,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:51:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:41,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:51:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:41,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:51:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:41,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:51:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:41,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:51:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:41,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:51:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:41,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:51:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:41,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:51:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:41,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:51:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:41,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:51:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:41,287 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:51:41,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:41,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275183514] [2024-11-08 16:51:41,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275183514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:51:41,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:51:41,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:51:41,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495189838] [2024-11-08 16:51:41,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:51:41,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:51:41,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:41,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:51:41,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:51:41,291 INFO L87 Difference]: Start difference. First operand 206 states and 292 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:51:41,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:51:41,553 INFO L93 Difference]: Finished difference Result 416 states and 588 transitions. [2024-11-08 16:51:41,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:51:41,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-08 16:51:41,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:51:41,556 INFO L225 Difference]: With dead ends: 416 [2024-11-08 16:51:41,557 INFO L226 Difference]: Without dead ends: 213 [2024-11-08 16:51:41,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:51:41,559 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 76 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:51:41,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 819 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:51:41,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-08 16:51:41,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 207. [2024-11-08 16:51:41,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 179 states have (on average 1.3798882681564246) internal successors, (247), 180 states have internal predecessors, (247), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:51:41,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 293 transitions. [2024-11-08 16:51:41,592 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 293 transitions. Word has length 125 [2024-11-08 16:51:41,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:51:41,593 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 293 transitions. [2024-11-08 16:51:41,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:51:41,593 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 293 transitions. [2024-11-08 16:51:41,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 16:51:41,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:51:41,596 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:41,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:51:41,596 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:51:41,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:41,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1177863350, now seen corresponding path program 1 times [2024-11-08 16:51:41,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:41,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487075669] [2024-11-08 16:51:41,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:41,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 16:51:41,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1591727190] [2024-11-08 16:51:41,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:41,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:51:41,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:41,745 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:51:41,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 16:51:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:43,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:51:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:49,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:51:49,729 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:51:49,730 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:51:49,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 16:51:49,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 16:51:49,937 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:50,146 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:51:50,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:51:50 BoogieIcfgContainer [2024-11-08 16:51:50,152 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:51:50,152 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:51:50,152 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:51:50,153 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:51:50,153 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:51:25" (3/4) ... [2024-11-08 16:51:50,157 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:51:50,158 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:51:50,159 INFO L158 Benchmark]: Toolchain (without parser) took 26832.32ms. Allocated memory was 148.9MB in the beginning and 295.7MB in the end (delta: 146.8MB). Free memory was 112.6MB in the beginning and 116.8MB in the end (delta: -4.2MB). Peak memory consumption was 145.6MB. Max. memory is 16.1GB. [2024-11-08 16:51:50,159 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 148.9MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:51:50,160 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.88ms. Allocated memory is still 148.9MB. Free memory was 112.4MB in the beginning and 96.6MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 16:51:50,160 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.70ms. Allocated memory is still 148.9MB. Free memory was 96.6MB in the beginning and 93.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:51:50,160 INFO L158 Benchmark]: Boogie Preprocessor took 89.88ms. Allocated memory is still 148.9MB. Free memory was 93.1MB in the beginning and 88.4MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:51:50,161 INFO L158 Benchmark]: RCFGBuilder took 1151.40ms. Allocated memory was 148.9MB in the beginning and 203.4MB in the end (delta: 54.5MB). Free memory was 88.4MB in the beginning and 167.2MB in the end (delta: -78.8MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. [2024-11-08 16:51:50,161 INFO L158 Benchmark]: TraceAbstraction took 25094.40ms. Allocated memory was 203.4MB in the beginning and 295.7MB in the end (delta: 92.3MB). Free memory was 167.2MB in the beginning and 116.8MB in the end (delta: 50.4MB). Peak memory consumption was 142.7MB. Max. memory is 16.1GB. [2024-11-08 16:51:50,162 INFO L158 Benchmark]: Witness Printer took 5.86ms. Allocated memory is still 295.7MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:51:50,164 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43ms. Allocated memory is still 148.9MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 422.88ms. Allocated memory is still 148.9MB. Free memory was 112.4MB in the beginning and 96.6MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.70ms. Allocated memory is still 148.9MB. Free memory was 96.6MB in the beginning and 93.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.88ms. Allocated memory is still 148.9MB. Free memory was 93.1MB in the beginning and 88.4MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1151.40ms. Allocated memory was 148.9MB in the beginning and 203.4MB in the end (delta: 54.5MB). Free memory was 88.4MB in the beginning and 167.2MB in the end (delta: -78.8MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. * TraceAbstraction took 25094.40ms. Allocated memory was 203.4MB in the beginning and 295.7MB in the end (delta: 92.3MB). Free memory was 167.2MB in the beginning and 116.8MB in the end (delta: 50.4MB). Peak memory consumption was 142.7MB. Max. memory is 16.1GB. * Witness Printer took 5.86ms. Allocated memory is still 295.7MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 113. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -100; [L22] signed short int var_1_1 = -100; [L23] signed short int* var_1_1_Pointer = &(var_1_1); [L24] unsigned long int var_1_2 = 0; [L24] unsigned long int var_1_2 = 0; [L25] unsigned long int* var_1_2_Pointer = &(var_1_2); [L26] unsigned long int var_1_3 = 8; [L26] unsigned long int var_1_3 = 8; [L27] unsigned long int* var_1_3_Pointer = &(var_1_3); [L28] unsigned long int var_1_4 = 256; [L28] unsigned long int var_1_4 = 256; [L29] unsigned long int* var_1_4_Pointer = &(var_1_4); [L30] unsigned long int var_1_5 = 500; [L30] unsigned long int var_1_5 = 500; [L31] unsigned long int* var_1_5_Pointer = &(var_1_5); [L32] signed char var_1_7 = -64; [L32] signed char var_1_7 = -64; [L33] signed char* var_1_7_Pointer = &(var_1_7); [L34] signed char var_1_8 = -8; [L34] signed char var_1_8 = -8; [L35] signed char* var_1_8_Pointer = &(var_1_8); [L36] unsigned char var_1_9 = 0; [L36] unsigned char var_1_9 = 0; [L37] unsigned char* var_1_9_Pointer = &(var_1_9); [L38] unsigned char var_1_10 = 0; [L38] unsigned char var_1_10 = 0; [L39] unsigned char* var_1_10_Pointer = &(var_1_10); [L40] double var_1_11 = 4.625; [L40] double var_1_11 = 4.625; [L41] double* var_1_11_Pointer = &(var_1_11); [L42] double var_1_13 = 15.5; [L42] double var_1_13 = 15.5; [L43] double* var_1_13_Pointer = &(var_1_13); VAL [isInitial=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L117] isInitial = 1 [L118] FCALL initially() [L119] COND TRUE 1 [L120] FCALL updateLastVariables() [L121] CALL updateVariables() [L86] var_1_2 = __VERIFIER_nondet_ulong() [L87] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] var_1_3 = __VERIFIER_nondet_ulong() [L90] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L90] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L90] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L92] var_1_4 = __VERIFIER_nondet_ulong() [L93] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] CALL assume_abort_if_not(var_1_4 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] RET assume_abort_if_not(var_1_4 <= 4294967295) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] var_1_5 = __VERIFIER_nondet_ulong() [L96] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L96] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L96] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] CALL assume_abort_if_not(var_1_5 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] RET assume_abort_if_not(var_1_5 <= 4294967295) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L98] var_1_8 = __VERIFIER_nondet_char() [L99] EXPR \read(var_1_8) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L99] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L99] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] EXPR \read(var_1_8) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L101] var_1_9 = __VERIFIER_nondet_uchar() [L102] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L104] var_1_10 = __VERIFIER_nondet_uchar() [L105] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L107] var_1_13 = __VERIFIER_nondet_double() [L108] EXPR \read(var_1_13) [L108] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F [L108] EXPR \read(var_1_13) [L108] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] RET updateVariables() [L122] CALL step() [L47] EXPR \read(*var_1_2_Pointer) [L47] EXPR \read(*var_1_4_Pointer) [L47] EXPR \read(*var_1_5_Pointer) [L47] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L47] EXPR ((((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) > ((*(var_1_3_Pointer)))) ? (((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) : ((*(var_1_3_Pointer))) [L47] EXPR \read(*var_1_4_Pointer) [L47] EXPR \read(*var_1_5_Pointer) [L47] EXPR ((((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) > ((*(var_1_3_Pointer)))) ? (((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) : ((*(var_1_3_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L47] COND TRUE (*(var_1_2_Pointer)) < ((((((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) > ((*(var_1_3_Pointer)))) ? (((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) : ((*(var_1_3_Pointer))))) [L48] EXPR \read(*var_1_8_Pointer) [L48] (*(var_1_7_Pointer)) = (*(var_1_8_Pointer)) [L60] EXPR \read(*var_1_5_Pointer) [L60] unsigned long int stepLocal_1 = (*(var_1_5_Pointer)); [L61] EXPR \read(*var_1_2_Pointer) [L61] EXPR \read(*var_1_3_Pointer) [L61] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L61] EXPR (((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))) [L61] EXPR \read(*var_1_3_Pointer) [L61] EXPR (((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))) VAL [isInitial=1, stepLocal_1=-4973120027, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L61] unsigned long int stepLocal_0 = (*(var_1_2_Pointer)) * (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))); [L62] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L62] COND FALSE !(stepLocal_0 < (*(var_1_5_Pointer))) [L69] EXPR \read(*var_1_9_Pointer) [L69] unsigned char stepLocal_3 = (*(var_1_9_Pointer)); [L70] EXPR \read(*var_1_1_Pointer) [L70] EXPR \read(*var_1_7_Pointer) [L70] signed long int stepLocal_2 = (*(var_1_1_Pointer)) + (*(var_1_7_Pointer)); [L71] EXPR \read(*var_1_7_Pointer) [L71] EXPR \read(*var_1_8_Pointer) [L71] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L71] COND FALSE !((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) == (*(var_1_4_Pointer))) && stepLocal_3) [L82] EXPR \read(*var_1_13_Pointer) [L82] (*(var_1_11_Pointer)) = (*(var_1_13_Pointer)) [L122] RET step() [L123] CALL, EXPR property() [L113] EXPR \read(*var_1_2_Pointer) [L113] EXPR \read(*var_1_3_Pointer) [L113] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L113] EXPR (((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))) [L113] EXPR \read(*var_1_3_Pointer) [L113] EXPR (((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L113] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L113] EXPR (((*(var_1_2_Pointer)) * (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer)))))) < (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) > (*(var_1_2_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_7_Pointer))))) : 1 [L113] EXPR (((*(var_1_2_Pointer)) * (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer)))))) < (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) > (*(var_1_2_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_7_Pointer))))) : 1 VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L113] EXPR ((((*(var_1_2_Pointer)) * (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer)))))) < (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) > (*(var_1_2_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_7_Pointer))))) : 1) && (((*(var_1_2_Pointer)) < ((((((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) > ((*(var_1_3_Pointer)))) ? (((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) : ((*(var_1_3_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : (((*(var_1_9_Pointer)) || (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : (((*(var_1_3_Pointer)) < (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((signed char) -4))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L113] EXPR ((((*(var_1_2_Pointer)) * (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer)))))) < (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) > (*(var_1_2_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_7_Pointer))))) : 1) && (((*(var_1_2_Pointer)) < ((((((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) > ((*(var_1_3_Pointer)))) ? (((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) : ((*(var_1_3_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : (((*(var_1_9_Pointer)) || (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : (((*(var_1_3_Pointer)) < (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((signed char) -4))))) [L113] EXPR \read(*var_1_2_Pointer) [L113] EXPR \read(*var_1_4_Pointer) [L113] EXPR \read(*var_1_5_Pointer) [L113] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L113] EXPR ((((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) > ((*(var_1_3_Pointer)))) ? (((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) : ((*(var_1_3_Pointer))) [L113] EXPR \read(*var_1_4_Pointer) [L113] EXPR \read(*var_1_5_Pointer) [L113] EXPR ((((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) > ((*(var_1_3_Pointer)))) ? (((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) : ((*(var_1_3_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L113] EXPR ((*(var_1_2_Pointer)) < ((((((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) > ((*(var_1_3_Pointer)))) ? (((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) : ((*(var_1_3_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : (((*(var_1_9_Pointer)) || (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : (((*(var_1_3_Pointer)) < (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((signed char) -4)))) [L113] EXPR \read(*var_1_7_Pointer) [L113] EXPR \read(*var_1_8_Pointer) [L113] EXPR ((*(var_1_2_Pointer)) < ((((((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) > ((*(var_1_3_Pointer)))) ? (((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) : ((*(var_1_3_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : (((*(var_1_9_Pointer)) || (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : (((*(var_1_3_Pointer)) < (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((signed char) -4)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L113] EXPR ((((*(var_1_2_Pointer)) * (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer)))))) < (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) > (*(var_1_2_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_7_Pointer))))) : 1) && (((*(var_1_2_Pointer)) < ((((((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) > ((*(var_1_3_Pointer)))) ? (((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) : ((*(var_1_3_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : (((*(var_1_9_Pointer)) || (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : (((*(var_1_3_Pointer)) < (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((signed char) -4))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L113] EXPR (((((*(var_1_2_Pointer)) * (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer)))))) < (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) > (*(var_1_2_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_7_Pointer))))) : 1) && (((*(var_1_2_Pointer)) < ((((((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) > ((*(var_1_3_Pointer)))) ? (((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) : ((*(var_1_3_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : (((*(var_1_9_Pointer)) || (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : (((*(var_1_3_Pointer)) < (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((signed char) -4)))))) && (((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) == (*(var_1_4_Pointer))) && (*(var_1_9_Pointer))) ? ((! (*(var_1_10_Pointer))) ? ((((*(var_1_1_Pointer)) + (*(var_1_7_Pointer))) != (*(var_1_8_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer)))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L113] EXPR (((((*(var_1_2_Pointer)) * (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer)))))) < (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) > (*(var_1_2_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_7_Pointer))))) : 1) && (((*(var_1_2_Pointer)) < ((((((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) > ((*(var_1_3_Pointer)))) ? (((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) : ((*(var_1_3_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : (((*(var_1_9_Pointer)) || (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : (((*(var_1_3_Pointer)) < (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((signed char) -4)))))) && (((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) == (*(var_1_4_Pointer))) && (*(var_1_9_Pointer))) ? ((! (*(var_1_10_Pointer))) ? ((((*(var_1_1_Pointer)) + (*(var_1_7_Pointer))) != (*(var_1_8_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer)))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer))))) [L113] EXPR \read(*var_1_7_Pointer) [L113] EXPR \read(*var_1_8_Pointer) [L113] EXPR \read(*var_1_4_Pointer) [L113] EXPR (((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) == (*(var_1_4_Pointer))) && (*(var_1_9_Pointer)) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L113] EXPR (((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) == (*(var_1_4_Pointer))) && (*(var_1_9_Pointer)) [L113] EXPR \read(*var_1_9_Pointer) [L113] EXPR (((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) == (*(var_1_4_Pointer))) && (*(var_1_9_Pointer)) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L113] EXPR ((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) == (*(var_1_4_Pointer))) && (*(var_1_9_Pointer))) ? ((! (*(var_1_10_Pointer))) ? ((((*(var_1_1_Pointer)) + (*(var_1_7_Pointer))) != (*(var_1_8_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer)))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer)))) [L113] EXPR \read(*var_1_11_Pointer) [L113] EXPR \read(*var_1_13_Pointer) [L113] EXPR ((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) == (*(var_1_4_Pointer))) && (*(var_1_9_Pointer))) ? ((! (*(var_1_10_Pointer))) ? ((((*(var_1_1_Pointer)) + (*(var_1_7_Pointer))) != (*(var_1_8_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer)))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L113] EXPR (((((*(var_1_2_Pointer)) * (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer)))))) < (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) > (*(var_1_2_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_7_Pointer))))) : 1) && (((*(var_1_2_Pointer)) < ((((((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) > ((*(var_1_3_Pointer)))) ? (((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) : ((*(var_1_3_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : (((*(var_1_9_Pointer)) || (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : (((*(var_1_3_Pointer)) < (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((signed char) -4)))))) && (((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) == (*(var_1_4_Pointer))) && (*(var_1_9_Pointer))) ? ((! (*(var_1_10_Pointer))) ? ((((*(var_1_1_Pointer)) + (*(var_1_7_Pointer))) != (*(var_1_8_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer)))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L113-L114] return (((((*(var_1_2_Pointer)) * (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer)))))) < (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) > (*(var_1_2_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_7_Pointer))))) : 1) && (((*(var_1_2_Pointer)) < ((((((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) > ((*(var_1_3_Pointer)))) ? (((*(var_1_4_Pointer)) * (*(var_1_5_Pointer)))) : ((*(var_1_3_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : (((*(var_1_9_Pointer)) || (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : (((*(var_1_3_Pointer)) < (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((signed char) -4)))))) && (((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) == (*(var_1_4_Pointer))) && (*(var_1_9_Pointer))) ? ((! (*(var_1_10_Pointer))) ? ((((*(var_1_1_Pointer)) + (*(var_1_7_Pointer))) != (*(var_1_8_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer)))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_13_Pointer))))) ; [L123] RET, EXPR property() [L123] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.8s, OverallIterations: 10, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 844 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 844 mSDsluCounter, 6143 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4780 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1002 IncrementalHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 1363 mSDtfsCounter, 1002 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 649 GetRequests, 576 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=9, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 287 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 1583 NumberOfCodeBlocks, 1583 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1202 ConstructedInterpolants, 0 QuantifiedInterpolants, 2905 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1046 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 3936/4200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 16:51:50,197 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-69.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX --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 5c15f73011971e7f9bd48b99f89b794b5729611ad3fcb074d96fa69f3502bd77 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:51:53,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:51:53,354 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:51:53,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:51:53,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:51:53,401 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:51:53,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:51:53,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:51:53,404 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:51:53,405 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:51:53,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:51:53,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:51:53,407 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:51:53,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:51:53,408 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:51:53,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:51:53,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:51:53,410 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:51:53,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:51:53,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:51:53,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:51:53,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:51:53,413 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:51:53,414 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:51:53,414 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:51:53,414 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:51:53,415 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:51:53,415 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:51:53,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:51:53,421 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:51:53,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:51:53,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:51:53,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:51:53,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:51:53,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:51:53,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:51:53,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:51:53,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:51:53,427 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 16:51:53,428 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:51:53,428 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:51:53,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:51:53,429 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:51:53,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:51:53,430 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_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/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_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX 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 -> 5c15f73011971e7f9bd48b99f89b794b5729611ad3fcb074d96fa69f3502bd77 [2024-11-08 16:51:53,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:51:53,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:51:53,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:51:53,997 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:51:53,998 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:51:54,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-69.i Unable to find full path for "g++" [2024-11-08 16:51:56,524 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:51:56,902 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:51:56,903 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-69.i [2024-11-08 16:51:56,917 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/data/e4bdb33b0/f82e66f1aa154e42a9ce958370873f1a/FLAGaf258ad90 [2024-11-08 16:51:57,155 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/data/e4bdb33b0/f82e66f1aa154e42a9ce958370873f1a [2024-11-08 16:51:57,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:51:57,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:51:57,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:51:57,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:51:57,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:51:57,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:51:57" (1/1) ... [2024-11-08 16:51:57,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63935787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:57, skipping insertion in model container [2024-11-08 16:51:57,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:51:57" (1/1) ... [2024-11-08 16:51:57,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:51:57,548 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-69.i[916,929] [2024-11-08 16:51:57,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:51:57,767 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:51:57,792 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-69.i[916,929] [2024-11-08 16:51:57,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:51:57,914 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:51:57,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:57 WrapperNode [2024-11-08 16:51:57,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:51:57,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:51:57,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:51:57,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:51:57,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:57" (1/1) ... [2024-11-08 16:51:57,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:57" (1/1) ... [2024-11-08 16:51:58,019 INFO L138 Inliner]: procedures = 36, calls = 168, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 498 [2024-11-08 16:51:58,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:51:58,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:51:58,021 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:51:58,021 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:51:58,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:57" (1/1) ... [2024-11-08 16:51:58,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:57" (1/1) ... [2024-11-08 16:51:58,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:57" (1/1) ... [2024-11-08 16:51:58,110 INFO L175 MemorySlicer]: Split 131 memory accesses to 12 slices as follows [2, 7, 10, 14, 16, 12, 17, 14, 8, 8, 9, 14]. 13 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 2, 1, 1, 1, 1, 4, 1, 1, 1, 4, 1]. [2024-11-08 16:51:58,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:57" (1/1) ... [2024-11-08 16:51:58,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:57" (1/1) ... [2024-11-08 16:51:58,161 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:57" (1/1) ... [2024-11-08 16:51:58,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:57" (1/1) ... [2024-11-08 16:51:58,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:57" (1/1) ... [2024-11-08 16:51:58,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:57" (1/1) ... [2024-11-08 16:51:58,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:51:58,198 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:51:58,198 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:51:58,199 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:51:58,200 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:57" (1/1) ... [2024-11-08 16:51:58,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:51:58,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:58,249 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:51:58,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:51:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:51:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-08 16:51:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-08 16:51:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-08 16:51:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-08 16:51:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-08 16:51:58,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-08 16:51:58,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-08 16:51:58,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-08 16:51:58,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-11-08 16:51:58,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-11-08 16:51:58,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-11-08 16:51:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-11-08 16:51:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-08 16:51:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-08 16:51:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-08 16:51:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-08 16:51:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-08 16:51:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-08 16:51:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-08 16:51:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-08 16:51:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-11-08 16:51:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-11-08 16:51:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-11-08 16:51:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-11-08 16:51:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 16:51:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 16:51:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-08 16:51:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-08 16:51:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-08 16:51:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-08 16:51:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-08 16:51:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-08 16:51:58,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-08 16:51:58,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-08 16:51:58,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-08 16:51:58,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-08 16:51:58,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-08 16:51:58,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-08 16:51:58,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-08 16:51:58,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-08 16:51:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-08 16:51:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-08 16:51:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-08 16:51:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-08 16:51:58,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-08 16:51:58,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-08 16:51:58,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-08 16:51:58,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-08 16:51:58,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:51:58,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 16:51:58,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 16:51:58,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-08 16:51:58,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-08 16:51:58,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-08 16:51:58,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-08 16:51:58,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-08 16:51:58,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-08 16:51:58,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-08 16:51:58,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-08 16:51:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-08 16:51:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-08 16:51:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-08 16:51:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-08 16:51:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-08 16:51:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-08 16:51:58,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-08 16:51:58,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-08 16:51:58,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-08 16:51:58,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-08 16:51:58,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-08 16:51:58,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-08 16:51:58,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-08 16:51:58,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-08 16:51:58,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-08 16:51:58,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-08 16:51:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-08 16:51:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-08 16:51:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-08 16:51:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-08 16:51:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-08 16:51:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-11-08 16:51:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-11-08 16:51:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-11-08 16:51:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-11-08 16:51:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 16:51:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 16:51:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-08 16:51:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-08 16:51:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-08 16:51:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-08 16:51:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-08 16:51:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-08 16:51:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-08 16:51:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-08 16:51:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-08 16:51:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-08 16:51:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 16:51:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 16:51:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-08 16:51:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-08 16:51:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-08 16:51:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-08 16:51:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-08 16:51:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-08 16:51:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-08 16:51:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-08 16:51:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-08 16:51:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-11-08 16:51:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:51:58,321 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:51:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:51:58,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:51:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 16:51:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 16:51:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-08 16:51:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-08 16:51:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-08 16:51:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-08 16:51:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-08 16:51:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-08 16:51:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-08 16:51:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-08 16:51:58,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-08 16:51:58,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-08 16:51:58,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 16:51:58,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 16:51:58,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-08 16:51:58,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-08 16:51:58,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-08 16:51:58,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-08 16:51:58,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-08 16:51:58,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-08 16:51:58,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-08 16:51:58,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-08 16:51:58,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-08 16:51:58,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-11-08 16:51:58,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 16:51:58,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 16:51:58,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-08 16:51:58,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-08 16:51:58,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-08 16:51:58,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-08 16:51:58,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-08 16:51:58,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-08 16:51:58,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-08 16:51:58,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-08 16:51:58,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-08 16:51:58,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-08 16:51:58,641 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:51:58,644 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:51:59,672 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-08 16:51:59,672 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:51:59,699 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:51:59,699 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:51:59,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:51:59 BoogieIcfgContainer [2024-11-08 16:51:59,700 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:51:59,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:51:59,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:51:59,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:51:59,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:51:57" (1/3) ... [2024-11-08 16:51:59,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202f33e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:51:59, skipping insertion in model container [2024-11-08 16:51:59,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:57" (2/3) ... [2024-11-08 16:51:59,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202f33e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:51:59, skipping insertion in model container [2024-11-08 16:51:59,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:51:59" (3/3) ... [2024-11-08 16:51:59,711 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-69.i [2024-11-08 16:51:59,758 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:51:59,759 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:51:59,844 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:51:59,852 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1e6ba1d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:51:59,853 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:51:59,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:51:59,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 16:51:59,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:51:59,876 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:59,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:51:59,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:59,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1301228568, now seen corresponding path program 1 times [2024-11-08 16:51:59,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:51:59,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766387234] [2024-11-08 16:51:59,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:59,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:51:59,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:51:59,924 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:51:59,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 16:52:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:00,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 16:52:00,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:00,599 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-08 16:52:00,600 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:52:00,601 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:52:00,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766387234] [2024-11-08 16:52:00,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766387234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:00,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:00,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:52:00,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860227410] [2024-11-08 16:52:00,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:00,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:52:00,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:52:00,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:52:00,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:52:00,662 INFO L87 Difference]: Start difference. First operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 16:52:00,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:00,717 INFO L93 Difference]: Finished difference Result 181 states and 287 transitions. [2024-11-08 16:52:00,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:52:00,720 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2024-11-08 16:52:00,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:00,731 INFO L225 Difference]: With dead ends: 181 [2024-11-08 16:52:00,732 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 16:52:00,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:52:00,741 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:00,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:52:00,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 16:52:00,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-08 16:52:00,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 73 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:52:00,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-11-08 16:52:00,804 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 119 [2024-11-08 16:52:00,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:00,804 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-11-08 16:52:00,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 16:52:00,805 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-11-08 16:52:00,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 16:52:00,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:00,814 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:00,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 16:52:01,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:01,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:01,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:01,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2093250050, now seen corresponding path program 1 times [2024-11-08 16:52:01,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:52:01,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52050401] [2024-11-08 16:52:01,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:01,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:01,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:52:01,023 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:52:01,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 16:52:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:01,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:52:01,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:01,728 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:52:01,731 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:52:01,732 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:52:01,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52050401] [2024-11-08 16:52:01,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52050401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:01,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:01,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:52:01,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235006167] [2024-11-08 16:52:01,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:01,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:52:01,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:52:01,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:52:01,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:52:01,740 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:01,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:01,848 INFO L93 Difference]: Finished difference Result 179 states and 264 transitions. [2024-11-08 16:52:01,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:52:01,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-11-08 16:52:01,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:01,853 INFO L225 Difference]: With dead ends: 179 [2024-11-08 16:52:01,856 INFO L226 Difference]: Without dead ends: 92 [2024-11-08 16:52:01,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:52:01,859 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:01,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 379 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:52:01,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-08 16:52:01,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-08 16:52:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:52:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-08 16:52:01,884 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 119 [2024-11-08 16:52:01,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:01,886 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-08 16:52:01,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:01,888 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-08 16:52:01,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:52:01,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:01,915 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:01,928 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 16:52:02,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:02,117 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:02,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:02,118 INFO L85 PathProgramCache]: Analyzing trace with hash -185680999, now seen corresponding path program 1 times [2024-11-08 16:52:02,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:52:02,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401723261] [2024-11-08 16:52:02,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:02,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:02,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:52:02,125 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:52:02,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 16:52:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:02,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 16:52:02,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:03,502 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 18 [2024-11-08 16:52:03,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2024-11-08 16:52:04,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-08 16:52:04,442 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:52:04,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:52:04,442 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:52:04,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401723261] [2024-11-08 16:52:04,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401723261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:04,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:04,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:52:04,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893422983] [2024-11-08 16:52:04,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:04,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:52:04,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:52:04,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:52:04,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:52:04,450 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:07,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:07,654 INFO L93 Difference]: Finished difference Result 224 states and 327 transitions. [2024-11-08 16:52:07,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:52:07,660 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 16:52:07,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:07,662 INFO L225 Difference]: With dead ends: 224 [2024-11-08 16:52:07,662 INFO L226 Difference]: Without dead ends: 135 [2024-11-08 16:52:07,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:52:07,665 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 59 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:07,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 790 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 16:52:07,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-08 16:52:07,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 102. [2024-11-08 16:52:07,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.4) internal successors, (119), 85 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:52:07,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2024-11-08 16:52:07,687 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 121 [2024-11-08 16:52:07,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:07,692 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2024-11-08 16:52:07,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:07,693 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2024-11-08 16:52:07,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:52:07,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:07,696 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:07,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 16:52:07,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:07,901 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:07,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:07,902 INFO L85 PathProgramCache]: Analyzing trace with hash -772487013, now seen corresponding path program 1 times [2024-11-08 16:52:07,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:52:07,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567530183] [2024-11-08 16:52:07,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:07,904 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:07,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:52:07,912 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:52:07,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 16:52:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:08,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 16:52:08,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:08,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 16:52:08,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 16:52:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:52:08,672 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:52:08,672 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:52:08,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567530183] [2024-11-08 16:52:08,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567530183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:08,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:08,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:52:08,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113353022] [2024-11-08 16:52:08,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:08,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:52:08,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:52:08,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:52:08,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:52:08,679 INFO L87 Difference]: Start difference. First operand 102 states and 149 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:09,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:09,171 INFO L93 Difference]: Finished difference Result 249 states and 362 transitions. [2024-11-08 16:52:09,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:52:09,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 16:52:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:09,175 INFO L225 Difference]: With dead ends: 249 [2024-11-08 16:52:09,175 INFO L226 Difference]: Without dead ends: 150 [2024-11-08 16:52:09,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:52:09,177 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 64 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:09,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 526 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:52:09,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-08 16:52:09,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2024-11-08 16:52:09,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 127 states have (on average 1.4015748031496063) internal successors, (178), 128 states have internal predecessors, (178), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 16:52:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 212 transitions. [2024-11-08 16:52:09,197 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 212 transitions. Word has length 121 [2024-11-08 16:52:09,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:09,198 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 212 transitions. [2024-11-08 16:52:09,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 212 transitions. [2024-11-08 16:52:09,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:52:09,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:09,201 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:09,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 16:52:09,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:09,402 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:09,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:09,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1874624741, now seen corresponding path program 1 times [2024-11-08 16:52:09,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:52:09,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538957992] [2024-11-08 16:52:09,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:09,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:09,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:52:09,409 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:52:09,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 16:52:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:09,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 16:52:10,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:10,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-08 16:52:10,140 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 16 treesize of output 8 [2024-11-08 16:52:10,172 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:52:10,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:52:10,173 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:52:10,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538957992] [2024-11-08 16:52:10,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538957992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:10,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:10,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:52:10,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957734543] [2024-11-08 16:52:10,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:10,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:52:10,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:52:10,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:52:10,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:52:10,176 INFO L87 Difference]: Start difference. First operand 147 states and 212 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:10,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:10,666 INFO L93 Difference]: Finished difference Result 298 states and 426 transitions. [2024-11-08 16:52:10,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:52:10,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 16:52:10,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:10,669 INFO L225 Difference]: With dead ends: 298 [2024-11-08 16:52:10,669 INFO L226 Difference]: Without dead ends: 154 [2024-11-08 16:52:10,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:52:10,672 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 62 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:10,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 570 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:52:10,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-08 16:52:10,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 113. [2024-11-08 16:52:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:52:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-11-08 16:52:10,688 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 121 [2024-11-08 16:52:10,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:10,689 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-11-08 16:52:10,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-11-08 16:52:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:52:10,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:10,692 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:10,706 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-08 16:52:10,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:10,893 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:10,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:10,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1833536541, now seen corresponding path program 1 times [2024-11-08 16:52:10,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:52:10,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158436235] [2024-11-08 16:52:10,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:10,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:10,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:52:10,896 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:52:10,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 16:52:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:11,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 16:52:11,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:11,888 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 18 [2024-11-08 16:52:12,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2024-11-08 16:52:12,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-08 16:52:12,895 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:52:12,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:52:12,895 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:52:12,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158436235] [2024-11-08 16:52:12,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158436235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:12,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:12,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:52:12,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224329227] [2024-11-08 16:52:12,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:12,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:52:12,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:52:12,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:52:12,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:52:12,898 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:16,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:16,435 INFO L93 Difference]: Finished difference Result 258 states and 368 transitions. [2024-11-08 16:52:16,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:52:16,441 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 16:52:16,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:16,444 INFO L225 Difference]: With dead ends: 258 [2024-11-08 16:52:16,444 INFO L226 Difference]: Without dead ends: 148 [2024-11-08 16:52:16,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:52:16,446 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 49 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:16,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1035 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 16:52:16,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-08 16:52:16,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 119. [2024-11-08 16:52:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:52:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 170 transitions. [2024-11-08 16:52:16,467 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 170 transitions. Word has length 121 [2024-11-08 16:52:16,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:16,467 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 170 transitions. [2024-11-08 16:52:16,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:16,468 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 170 transitions. [2024-11-08 16:52:16,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 16:52:16,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:16,472 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:16,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-08 16:52:16,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:16,673 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:16,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:16,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1035775661, now seen corresponding path program 1 times [2024-11-08 16:52:16,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:52:16,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654044985] [2024-11-08 16:52:16,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:16,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:16,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:52:16,677 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:52:16,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-08 16:52:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:17,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:52:17,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:17,168 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 18 treesize of output 14 [2024-11-08 16:52:17,264 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 57 treesize of output 45 [2024-11-08 16:52:17,273 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 45 treesize of output 33 [2024-11-08 16:52:17,351 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:52:17,351 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:52:17,351 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:52:17,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654044985] [2024-11-08 16:52:17,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654044985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:17,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:17,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:52:17,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738379806] [2024-11-08 16:52:17,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:17,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:52:17,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:52:17,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:52:17,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:52:17,357 INFO L87 Difference]: Start difference. First operand 119 states and 170 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:17,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:17,787 INFO L93 Difference]: Finished difference Result 311 states and 444 transitions. [2024-11-08 16:52:17,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:52:17,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-11-08 16:52:17,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:17,790 INFO L225 Difference]: With dead ends: 311 [2024-11-08 16:52:17,791 INFO L226 Difference]: Without dead ends: 195 [2024-11-08 16:52:17,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:52:17,793 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 110 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:17,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1003 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:52:17,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-08 16:52:17,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 117. [2024-11-08 16:52:17,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:52:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 167 transitions. [2024-11-08 16:52:17,809 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 167 transitions. Word has length 122 [2024-11-08 16:52:17,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:17,810 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 167 transitions. [2024-11-08 16:52:17,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:17,811 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2024-11-08 16:52:17,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 16:52:17,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:17,813 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:17,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-08 16:52:18,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:18,015 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:18,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:18,015 INFO L85 PathProgramCache]: Analyzing trace with hash 632954350, now seen corresponding path program 1 times [2024-11-08 16:52:18,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:52:18,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348852344] [2024-11-08 16:52:18,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:18,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:18,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:52:18,018 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:52:18,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-08 16:52:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:18,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 16:52:18,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:18,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-08 16:52:18,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2024-11-08 16:52:18,854 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 30 [2024-11-08 16:52:18,939 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:52:18,940 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:52:18,940 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:52:18,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348852344] [2024-11-08 16:52:18,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348852344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:18,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:18,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:52:18,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890350387] [2024-11-08 16:52:18,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:18,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:52:18,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:52:18,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:52:18,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:52:18,943 INFO L87 Difference]: Start difference. First operand 117 states and 167 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:19,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:19,393 INFO L93 Difference]: Finished difference Result 323 states and 459 transitions. [2024-11-08 16:52:19,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:52:19,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-11-08 16:52:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:19,398 INFO L225 Difference]: With dead ends: 323 [2024-11-08 16:52:19,398 INFO L226 Difference]: Without dead ends: 209 [2024-11-08 16:52:19,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:52:19,404 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 77 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:19,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 678 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:52:19,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-08 16:52:19,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2024-11-08 16:52:19,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 178 states have (on average 1.3820224719101124) internal successors, (246), 179 states have internal predecessors, (246), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:52:19,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 292 transitions. [2024-11-08 16:52:19,426 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 292 transitions. Word has length 122 [2024-11-08 16:52:19,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:19,427 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 292 transitions. [2024-11-08 16:52:19,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:19,428 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 292 transitions. [2024-11-08 16:52:19,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 16:52:19,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:19,431 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:19,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-08 16:52:19,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:19,632 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:19,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:19,632 INFO L85 PathProgramCache]: Analyzing trace with hash 33650091, now seen corresponding path program 1 times [2024-11-08 16:52:19,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:52:19,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126421467] [2024-11-08 16:52:19,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:19,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:19,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:52:19,635 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:52:19,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-08 16:52:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:20,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 16:52:20,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:21,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-08 16:52:21,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-08 16:52:21,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 16:52:21,693 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:52:21,693 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:52:21,693 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:52:21,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126421467] [2024-11-08 16:52:21,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126421467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:21,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:21,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:52:21,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143018784] [2024-11-08 16:52:21,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:21,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:52:21,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:52:21,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:52:21,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:52:21,697 INFO L87 Difference]: Start difference. First operand 206 states and 292 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:24,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:24,379 INFO L93 Difference]: Finished difference Result 481 states and 684 transitions. [2024-11-08 16:52:24,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:52:24,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-08 16:52:24,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:24,387 INFO L225 Difference]: With dead ends: 481 [2024-11-08 16:52:24,387 INFO L226 Difference]: Without dead ends: 278 [2024-11-08 16:52:24,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:52:24,389 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 55 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:24,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 641 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 16:52:24,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-08 16:52:24,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 249. [2024-11-08 16:52:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 221 states have (on average 1.4027149321266967) internal successors, (310), 222 states have internal predecessors, (310), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:52:24,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 356 transitions. [2024-11-08 16:52:24,420 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 356 transitions. Word has length 125 [2024-11-08 16:52:24,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:24,423 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 356 transitions. [2024-11-08 16:52:24,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:24,423 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 356 transitions. [2024-11-08 16:52:24,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 16:52:24,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:24,426 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:24,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-08 16:52:24,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:24,627 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:24,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:24,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1177863350, now seen corresponding path program 1 times [2024-11-08 16:52:24,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:52:24,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871161548] [2024-11-08 16:52:24,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:24,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:24,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:52:24,630 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:52:24,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-08 16:52:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:25,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 16:52:25,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:28,026 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 18 treesize of output 19 [2024-11-08 16:52:28,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:52:28,975 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 203 treesize of output 133 [2024-11-08 16:52:28,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:52:28,987 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 288 treesize of output 138 [2024-11-08 16:52:29,256 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 16:52:29,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:52:29,991 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:52:29,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871161548] [2024-11-08 16:52:29,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871161548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:52:29,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015788913] [2024-11-08 16:52:29,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:29,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:29,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:52:29,998 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:52:29,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 16:52:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:30,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-08 16:52:30,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:33,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2024-11-08 16:52:35,109 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 18 treesize of output 19 [2024-11-08 16:52:36,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:52:36,298 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 191 treesize of output 121 [2024-11-08 16:52:36,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:52:36,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 142 [2024-11-08 16:52:36,365 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-08 16:52:36,365 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:52:36,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015788913] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:52:36,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:52:36,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 19 [2024-11-08 16:52:36,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693467164] [2024-11-08 16:52:36,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:52:36,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 16:52:36,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:52:36,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 16:52:36,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2024-11-08 16:52:36,829 INFO L87 Difference]: Start difference. First operand 249 states and 356 transitions. Second operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 4 states have call successors, (30), 4 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-11-08 16:52:44,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:44,260 INFO L93 Difference]: Finished difference Result 510 states and 722 transitions. [2024-11-08 16:52:44,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 16:52:44,263 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 4 states have call successors, (30), 4 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 125 [2024-11-08 16:52:44,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:44,266 INFO L225 Difference]: With dead ends: 510 [2024-11-08 16:52:44,266 INFO L226 Difference]: Without dead ends: 508 [2024-11-08 16:52:44,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=248, Invalid=1312, Unknown=0, NotChecked=0, Total=1560 [2024-11-08 16:52:44,268 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 356 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:44,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1285 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-08 16:52:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-08 16:52:44,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 501. [2024-11-08 16:52:44,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 445 states have (on average 1.395505617977528) internal successors, (621), 448 states have internal predecessors, (621), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 16:52:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 713 transitions. [2024-11-08 16:52:44,315 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 713 transitions. Word has length 125 [2024-11-08 16:52:44,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:44,316 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 713 transitions. [2024-11-08 16:52:44,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 4 states have call successors, (30), 4 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-11-08 16:52:44,317 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 713 transitions. [2024-11-08 16:52:44,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 16:52:44,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:44,321 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:44,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-08 16:52:44,543 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-08 16:52:44,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:44,722 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:44,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:44,723 INFO L85 PathProgramCache]: Analyzing trace with hash 291815529, now seen corresponding path program 1 times [2024-11-08 16:52:44,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:52:44,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562069115] [2024-11-08 16:52:44,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:44,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:44,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:52:44,725 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:52:44,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-08 16:52:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:45,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 16:52:45,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:45,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-08 16:52:45,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-08 16:52:45,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-08 16:52:46,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-08 16:52:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:52:46,310 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:52:46,310 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:52:46,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [562069115] [2024-11-08 16:52:46,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [562069115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:46,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:46,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:52:46,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790697724] [2024-11-08 16:52:46,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:46,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:52:46,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:52:46,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:52:46,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:52:46,313 INFO L87 Difference]: Start difference. First operand 501 states and 713 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:48,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:48,718 INFO L93 Difference]: Finished difference Result 1041 states and 1476 transitions. [2024-11-08 16:52:48,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:52:48,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-08 16:52:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:48,729 INFO L225 Difference]: With dead ends: 1041 [2024-11-08 16:52:48,729 INFO L226 Difference]: Without dead ends: 543 [2024-11-08 16:52:48,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:52:48,735 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 42 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:48,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 550 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 16:52:48,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-08 16:52:48,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 501. [2024-11-08 16:52:48,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 445 states have (on average 1.395505617977528) internal successors, (621), 448 states have internal predecessors, (621), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 16:52:48,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 713 transitions. [2024-11-08 16:52:48,805 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 713 transitions. Word has length 125 [2024-11-08 16:52:48,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:48,806 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 713 transitions. [2024-11-08 16:52:48,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:48,807 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 713 transitions. [2024-11-08 16:52:48,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 16:52:48,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:48,809 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:48,821 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-08 16:52:49,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:49,010 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:49,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:49,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1659955455, now seen corresponding path program 1 times [2024-11-08 16:52:49,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:52:49,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849640121] [2024-11-08 16:52:49,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:49,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:49,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:52:49,013 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:52:49,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-08 16:52:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:49,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 16:52:49,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:49,462 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:52:49,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:52:49,463 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:52:49,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1849640121] [2024-11-08 16:52:49,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1849640121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:49,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:49,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:52:49,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336332716] [2024-11-08 16:52:49,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:49,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:52:49,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:52:49,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:52:49,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:49,465 INFO L87 Difference]: Start difference. First operand 501 states and 713 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:49,524 INFO L93 Difference]: Finished difference Result 1001 states and 1427 transitions. [2024-11-08 16:52:49,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:52:49,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-08 16:52:49,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:49,529 INFO L225 Difference]: With dead ends: 1001 [2024-11-08 16:52:49,529 INFO L226 Difference]: Without dead ends: 503 [2024-11-08 16:52:49,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:49,531 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:49,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 254 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:52:49,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-08 16:52:49,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2024-11-08 16:52:49,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 447 states have (on average 1.3937360178970917) internal successors, (623), 450 states have internal predecessors, (623), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 16:52:49,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 715 transitions. [2024-11-08 16:52:49,580 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 715 transitions. Word has length 125 [2024-11-08 16:52:49,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:49,581 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 715 transitions. [2024-11-08 16:52:49,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 715 transitions. [2024-11-08 16:52:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 16:52:49,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:49,583 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:49,599 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-08 16:52:49,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:49,784 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:49,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:49,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1525941949, now seen corresponding path program 1 times [2024-11-08 16:52:49,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:52:49,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6984912] [2024-11-08 16:52:49,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:49,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:49,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:52:49,787 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:52:49,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-08 16:52:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:50,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 16:52:50,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:50,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-08 16:52:50,488 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 16 treesize of output 8 [2024-11-08 16:52:50,513 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:52:50,513 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:52:50,514 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:52:50,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6984912] [2024-11-08 16:52:50,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6984912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:50,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:50,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:52:50,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78327120] [2024-11-08 16:52:50,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:50,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:52:50,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:52:50,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:52:50,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:52:50,516 INFO L87 Difference]: Start difference. First operand 503 states and 715 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:51,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:51,288 INFO L93 Difference]: Finished difference Result 985 states and 1393 transitions. [2024-11-08 16:52:51,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:52:51,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-08 16:52:51,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:51,296 INFO L225 Difference]: With dead ends: 985 [2024-11-08 16:52:51,297 INFO L226 Difference]: Without dead ends: 485 [2024-11-08 16:52:51,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:52:51,300 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 67 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:51,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 625 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 16:52:51,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-08 16:52:51,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 473. [2024-11-08 16:52:51,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 417 states have (on average 1.3788968824940049) internal successors, (575), 420 states have internal predecessors, (575), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 16:52:51,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 667 transitions. [2024-11-08 16:52:51,358 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 667 transitions. Word has length 125 [2024-11-08 16:52:51,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:51,359 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 667 transitions. [2024-11-08 16:52:51,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:51,363 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 667 transitions. [2024-11-08 16:52:51,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 16:52:51,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:51,366 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:51,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-08 16:52:51,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:51,567 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:51,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:51,568 INFO L85 PathProgramCache]: Analyzing trace with hash -302823751, now seen corresponding path program 1 times [2024-11-08 16:52:51,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:52:51,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260718776] [2024-11-08 16:52:51,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:51,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:51,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:52:51,573 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:52:51,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-08 16:52:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:52,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 16:52:52,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:53,248 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 18 [2024-11-08 16:52:53,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-08 16:52:53,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-08 16:52:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:52:53,966 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:52:53,967 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:52:53,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260718776] [2024-11-08 16:52:53,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260718776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:53,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:53,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:52:53,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891977617] [2024-11-08 16:52:53,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:53,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:52:53,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:52:53,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:52:53,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:52:53,969 INFO L87 Difference]: Start difference. First operand 473 states and 667 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:52:59,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:53:01,376 INFO L93 Difference]: Finished difference Result 1193 states and 1692 transitions. [2024-11-08 16:53:01,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:53:01,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-08 16:53:01,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:53:01,387 INFO L225 Difference]: With dead ends: 1193 [2024-11-08 16:53:01,388 INFO L226 Difference]: Without dead ends: 723 [2024-11-08 16:53:01,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:53:01,390 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 56 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:53:01,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 885 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time] [2024-11-08 16:53:01,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-11-08 16:53:01,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 619. [2024-11-08 16:53:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 563 states have (on average 1.4014209591474245) internal successors, (789), 566 states have internal predecessors, (789), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 16:53:01,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 881 transitions. [2024-11-08 16:53:01,452 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 881 transitions. Word has length 125 [2024-11-08 16:53:01,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:53:01,453 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 881 transitions. [2024-11-08 16:53:01,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:53:01,454 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 881 transitions. [2024-11-08 16:53:01,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 16:53:01,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:53:01,457 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:53:01,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-08 16:53:01,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:01,657 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:53:01,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:01,658 INFO L85 PathProgramCache]: Analyzing trace with hash 377234619, now seen corresponding path program 1 times [2024-11-08 16:53:01,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:53:01,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32004982] [2024-11-08 16:53:01,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:01,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:01,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:53:01,661 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:53:01,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-08 16:53:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:02,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 16:53:02,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:53:02,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2024-11-08 16:53:02,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-08 16:53:03,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-08 16:53:03,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-08 16:53:04,080 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:53:04,080 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:53:04,080 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:53:04,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32004982] [2024-11-08 16:53:04,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32004982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:53:04,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:53:04,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:53:04,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586831198] [2024-11-08 16:53:04,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:53:04,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:53:04,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:53:04,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:53:04,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:53:04,082 INFO L87 Difference]: Start difference. First operand 619 states and 881 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:53:08,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:12,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:15,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:53:15,467 INFO L93 Difference]: Finished difference Result 1333 states and 1896 transitions. [2024-11-08 16:53:15,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:53:15,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-08 16:53:15,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:53:15,476 INFO L225 Difference]: With dead ends: 1333 [2024-11-08 16:53:15,476 INFO L226 Difference]: Without dead ends: 717 [2024-11-08 16:53:15,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:53:15,485 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 53 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:53:15,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 911 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2024-11-08 16:53:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-11-08 16:53:15,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 619. [2024-11-08 16:53:15,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 563 states have (on average 1.4014209591474245) internal successors, (789), 566 states have internal predecessors, (789), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 16:53:15,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 881 transitions. [2024-11-08 16:53:15,540 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 881 transitions. Word has length 125 [2024-11-08 16:53:15,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:53:15,543 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 881 transitions. [2024-11-08 16:53:15,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:53:15,544 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 881 transitions. [2024-11-08 16:53:15,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 16:53:15,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:53:15,548 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:53:15,560 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-08 16:53:15,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:15,749 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:53:15,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:15,749 INFO L85 PathProgramCache]: Analyzing trace with hash 95689705, now seen corresponding path program 1 times [2024-11-08 16:53:15,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:53:15,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860341670] [2024-11-08 16:53:15,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:15,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:15,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:53:15,752 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:53:15,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-08 16:53:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:16,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 16:53:16,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:53:16,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 16:53:16,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 16:53:16,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-08 16:53:16,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 16:53:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:53:16,835 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:53:16,835 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:53:16,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860341670] [2024-11-08 16:53:16,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [860341670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:53:16,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:53:16,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:53:16,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091138616] [2024-11-08 16:53:16,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:53:16,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:53:16,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:53:16,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:53:16,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:53:16,838 INFO L87 Difference]: Start difference. First operand 619 states and 881 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:53:18,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:53:18,190 INFO L93 Difference]: Finished difference Result 1377 states and 1962 transitions. [2024-11-08 16:53:18,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:53:18,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-08 16:53:18,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:53:18,197 INFO L225 Difference]: With dead ends: 1377 [2024-11-08 16:53:18,198 INFO L226 Difference]: Without dead ends: 761 [2024-11-08 16:53:18,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:53:18,200 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 53 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:53:18,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 862 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 16:53:18,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-08 16:53:18,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 701. [2024-11-08 16:53:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 645 states have (on average 1.4124031007751938) internal successors, (911), 648 states have internal predecessors, (911), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 16:53:18,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1003 transitions. [2024-11-08 16:53:18,253 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1003 transitions. Word has length 125 [2024-11-08 16:53:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:53:18,254 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 1003 transitions. [2024-11-08 16:53:18,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:53:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1003 transitions. [2024-11-08 16:53:18,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 16:53:18,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:53:18,258 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:53:18,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-08 16:53:18,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:18,459 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:53:18,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:18,460 INFO L85 PathProgramCache]: Analyzing trace with hash 353855143, now seen corresponding path program 1 times [2024-11-08 16:53:18,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:53:18,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003757183] [2024-11-08 16:53:18,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:18,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:18,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:53:18,462 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:53:18,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-08 16:53:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:19,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:53:19,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:53:19,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 16:53:19,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 16:53:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:53:19,370 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:53:19,370 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:53:19,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003757183] [2024-11-08 16:53:19,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003757183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:53:19,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:53:19,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:53:19,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193104665] [2024-11-08 16:53:19,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:53:19,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:53:19,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:53:19,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:53:19,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:53:19,373 INFO L87 Difference]: Start difference. First operand 701 states and 1003 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:53:20,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:53:20,172 INFO L93 Difference]: Finished difference Result 1443 states and 2058 transitions. [2024-11-08 16:53:20,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:53:20,173 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-08 16:53:20,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:53:20,178 INFO L225 Difference]: With dead ends: 1443 [2024-11-08 16:53:20,178 INFO L226 Difference]: Without dead ends: 745 [2024-11-08 16:53:20,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:53:20,181 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 44 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:53:20,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 741 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 16:53:20,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-11-08 16:53:20,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 619. [2024-11-08 16:53:20,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 563 states have (on average 1.4014209591474245) internal successors, (789), 566 states have internal predecessors, (789), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 16:53:20,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 881 transitions. [2024-11-08 16:53:20,233 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 881 transitions. Word has length 125 [2024-11-08 16:53:20,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:53:20,234 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 881 transitions. [2024-11-08 16:53:20,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:53:20,234 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 881 transitions. [2024-11-08 16:53:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 16:53:20,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:53:20,237 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:53:20,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-08 16:53:20,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:20,438 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:53:20,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:20,438 INFO L85 PathProgramCache]: Analyzing trace with hash -240784137, now seen corresponding path program 1 times [2024-11-08 16:53:20,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:53:20,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622066673] [2024-11-08 16:53:20,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:20,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:20,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:53:20,441 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:53:20,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_692ecdab-498a-4eda-92db-ba483f56f795/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process