./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-8.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_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-8.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 3812ed47486d263f6b3b8dc47cacf4510da1c1e9619759cd56ba725df10b3e2b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:45:45,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:45:45,576 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:45:45,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:45:45,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:45:45,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:45:45,624 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:45:45,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:45:45,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:45:45,626 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:45:45,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:45:45,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:45:45,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:45:45,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:45:45,629 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:45:45,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:45:45,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:45:45,630 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:45:45,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:45:45,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:45:45,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:45:45,635 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:45:45,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:45:45,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:45:45,636 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:45:45,637 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:45:45,637 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:45:45,637 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:45:45,638 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:45:45,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:45:45,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:45:45,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:45:45,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:45:45,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:45:45,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:45:45,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:45:45,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:45:45,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:45:45,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:45:45,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:45:45,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:45:45,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:45:45,645 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_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 -> 3812ed47486d263f6b3b8dc47cacf4510da1c1e9619759cd56ba725df10b3e2b [2024-11-08 17:45:45,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:45:45,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:45:45,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:45:45,956 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:45:45,957 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:45:45,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-8.i Unable to find full path for "g++" [2024-11-08 17:45:47,995 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:45:48,234 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:45:48,237 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-8.i [2024-11-08 17:45:48,250 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/data/4db92dd96/8c1eb1c6fef84a108a4304f128525ffa/FLAG9e865f517 [2024-11-08 17:45:48,584 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/data/4db92dd96/8c1eb1c6fef84a108a4304f128525ffa [2024-11-08 17:45:48,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:45:48,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:45:48,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:45:48,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:45:48,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:45:48,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:45:48" (1/1) ... [2024-11-08 17:45:48,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d560821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:45:48, skipping insertion in model container [2024-11-08 17:45:48,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:45:48" (1/1) ... [2024-11-08 17:45:48,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:45:48,821 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_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-8.i[915,928] [2024-11-08 17:45:48,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:45:48,913 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:45:48,926 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_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-8.i[915,928] [2024-11-08 17:45:48,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:45:49,006 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:45:49,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:45:49 WrapperNode [2024-11-08 17:45:49,006 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:45:49,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:45:49,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:45:49,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:45:49,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:45:49" (1/1) ... [2024-11-08 17:45:49,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:45:49" (1/1) ... [2024-11-08 17:45:49,086 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 446 [2024-11-08 17:45:49,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:45:49,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:45:49,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:45:49,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:45:49,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:45:49" (1/1) ... [2024-11-08 17:45:49,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:45:49" (1/1) ... [2024-11-08 17:45:49,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:45:49" (1/1) ... [2024-11-08 17:45:49,139 INFO L175 MemorySlicer]: Split 126 memory accesses to 5 slices as follows [2, 29, 48, 22, 25]. 38 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 6, 2, 2]. The 19 writes are split as follows [0, 6, 7, 4, 2]. [2024-11-08 17:45:49,143 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:45:49" (1/1) ... [2024-11-08 17:45:49,143 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:45:49" (1/1) ... [2024-11-08 17:45:49,176 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:45:49" (1/1) ... [2024-11-08 17:45:49,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:45:49" (1/1) ... [2024-11-08 17:45:49,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:45:49" (1/1) ... [2024-11-08 17:45:49,190 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:45:49" (1/1) ... [2024-11-08 17:45:49,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:45:49,196 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:45:49,197 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:45:49,197 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:45:49,198 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:45:49" (1/1) ... [2024-11-08 17:45:49,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:45:49,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:45:49,244 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:45:49,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:45:49,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:45:49,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 17:45:49,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 17:45:49,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 17:45:49,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 17:45:49,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 17:45:49,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-08 17:45:49,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-08 17:45:49,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-08 17:45:49,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-08 17:45:49,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-08 17:45:49,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-08 17:45:49,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-08 17:45:49,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-08 17:45:49,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-08 17:45:49,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-08 17:45:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 17:45:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 17:45:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 17:45:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 17:45:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 17:45:49,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-08 17:45:49,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-08 17:45:49,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-08 17:45:49,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-08 17:45:49,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-08 17:45:49,296 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:45:49,297 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:45:49,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:45:49,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 17:45:49,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 17:45:49,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 17:45:49,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 17:45:49,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:45:49,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:45:49,471 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:45:49,474 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:45:50,184 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-08 17:45:50,185 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:45:50,205 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:45:50,205 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:45:50,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:45:50 BoogieIcfgContainer [2024-11-08 17:45:50,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:45:50,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:45:50,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:45:50,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:45:50,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:45:48" (1/3) ... [2024-11-08 17:45:50,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511d73c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:45:50, skipping insertion in model container [2024-11-08 17:45:50,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:45:49" (2/3) ... [2024-11-08 17:45:50,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511d73c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:45:50, skipping insertion in model container [2024-11-08 17:45:50,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:45:50" (3/3) ... [2024-11-08 17:45:50,217 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-8.i [2024-11-08 17:45:50,239 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:45:50,239 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:45:50,308 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:45:50,315 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;@26e6efaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:45:50,315 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:45:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:45:50,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 17:45:50,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:45:50,339 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:45:50,339 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:45:50,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:45:50,345 INFO L85 PathProgramCache]: Analyzing trace with hash 260702647, now seen corresponding path program 1 times [2024-11-08 17:45:50,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:45:50,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735660244] [2024-11-08 17:45:50,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:45:50,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:45:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:50,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:45:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:50,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:45:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:50,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:45:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:50,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:45:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:50,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:45:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:50,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:45:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:50,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:45:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:50,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:45:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:50,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:45:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:50,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:45:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:50,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:45:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:50,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:45:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:50,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:45:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:50,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:45:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 17:45:50,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:45:50,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735660244] [2024-11-08 17:45:50,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735660244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:45:50,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:45:50,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:45:50,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873310928] [2024-11-08 17:45:50,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:45:50,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:45:50,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:45:50,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:45:50,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:45:50,825 INFO L87 Difference]: Start difference. First operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 17:45:50,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:45:50,873 INFO L93 Difference]: Finished difference Result 193 states and 298 transitions. [2024-11-08 17:45:50,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:45:50,876 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-08 17:45:50,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:45:50,887 INFO L225 Difference]: With dead ends: 193 [2024-11-08 17:45:50,888 INFO L226 Difference]: Without dead ends: 96 [2024-11-08 17:45:50,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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 17:45:50,898 INFO L432 NwaCegarLoop]: 138 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, 138 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 17:45:50,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:45:50,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-08 17:45:50,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-08 17:45:50,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:45:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-08 17:45:50,963 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 123 [2024-11-08 17:45:50,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:45:50,965 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-08 17:45:50,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 17:45:50,966 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-08 17:45:50,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 17:45:50,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:45:50,974 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:45:50,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:45:50,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:45:50,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:45:50,976 INFO L85 PathProgramCache]: Analyzing trace with hash 936025891, now seen corresponding path program 1 times [2024-11-08 17:45:50,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:45:50,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728050948] [2024-11-08 17:45:50,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:45:50,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:45:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:45:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:45:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:45:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:45:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:45:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:45:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:45:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:45:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:45:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:45:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:45:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:45:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:45:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:45:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,448 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 17:45:51,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:45:51,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728050948] [2024-11-08 17:45:51,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728050948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:45:51,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:45:51,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:45:51,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014128915] [2024-11-08 17:45:51,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:45:51,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:45:51,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:45:51,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:45:51,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:45:51,460 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 17:45:51,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:45:51,514 INFO L93 Difference]: Finished difference Result 191 states and 276 transitions. [2024-11-08 17:45:51,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:45:51,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-08 17:45:51,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:45:51,517 INFO L225 Difference]: With dead ends: 191 [2024-11-08 17:45:51,517 INFO L226 Difference]: Without dead ends: 98 [2024-11-08 17:45:51,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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 17:45:51,520 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 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 17:45:51,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:45:51,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-08 17:45:51,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-08 17:45:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:45:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-08 17:45:51,536 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 123 [2024-11-08 17:45:51,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:45:51,538 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-08 17:45:51,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 17:45:51,538 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-08 17:45:51,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 17:45:51,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:45:51,541 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:45:51,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:45:51,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:45:51,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:45:51,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1025548767, now seen corresponding path program 1 times [2024-11-08 17:45:51,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:45:51,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937477400] [2024-11-08 17:45:51,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:45:51,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:45:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:45:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:45:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:45:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:45:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:45:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:45:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:45:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:45:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:45:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:45:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:45:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:45:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:45:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:45:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 17:45:51,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:45:51,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937477400] [2024-11-08 17:45:51,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937477400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:45:51,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:45:51,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:45:51,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406301680] [2024-11-08 17:45:51,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:45:51,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:45:51,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:45:51,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:45:51,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:45:51,870 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:45:51,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:45:51,927 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2024-11-08 17:45:51,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:45:51,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-08 17:45:51,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:45:51,933 INFO L225 Difference]: With dead ends: 196 [2024-11-08 17:45:51,933 INFO L226 Difference]: Without dead ends: 101 [2024-11-08 17:45:51,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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 17:45:51,939 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:45:51,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 394 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:45:51,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-08 17:45:51,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-08 17:45:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:45:51,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-08 17:45:51,957 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 123 [2024-11-08 17:45:51,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:45:51,961 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-08 17:45:51,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:45:51,962 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-08 17:45:51,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 17:45:51,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:45:51,966 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:45:51,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:45:51,966 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:45:51,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:45:51,967 INFO L85 PathProgramCache]: Analyzing trace with hash -345490397, now seen corresponding path program 1 times [2024-11-08 17:45:51,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:45:51,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790290960] [2024-11-08 17:45:51,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:45:51,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:45:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:52,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:45:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:52,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:45:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:52,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:45:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:52,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:45:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:52,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:45:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:52,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:45:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:52,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:45:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:52,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:45:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:52,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:45:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:52,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:45:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:52,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:45:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:52,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:45:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:52,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:45:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:52,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:45:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:52,222 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 17:45:52,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:45:52,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790290960] [2024-11-08 17:45:52,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790290960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:45:52,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:45:52,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:45:52,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517133922] [2024-11-08 17:45:52,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:45:52,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:45:52,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:45:52,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:45:52,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:45:52,226 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:45:52,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:45:52,273 INFO L93 Difference]: Finished difference Result 200 states and 285 transitions. [2024-11-08 17:45:52,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:45:52,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-08 17:45:52,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:45:52,275 INFO L225 Difference]: With dead ends: 200 [2024-11-08 17:45:52,276 INFO L226 Difference]: Without dead ends: 103 [2024-11-08 17:45:52,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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 17:45:52,281 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:45:52,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:45:52,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-08 17:45:52,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-08 17:45:52,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:45:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2024-11-08 17:45:52,296 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 123 [2024-11-08 17:45:52,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:45:52,299 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2024-11-08 17:45:52,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:45:52,300 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2024-11-08 17:45:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 17:45:52,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:45:52,302 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:45:52,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:45:52,303 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:45:52,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:45:52,304 INFO L85 PathProgramCache]: Analyzing trace with hash -343643355, now seen corresponding path program 1 times [2024-11-08 17:45:52,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:45:52,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948642181] [2024-11-08 17:45:52,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:45:52,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:45:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:53,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:45:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:53,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:45:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:53,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:45:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:53,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:45:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:53,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:45:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:53,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:45:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:53,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:45:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:53,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:45:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:53,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:45:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:53,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:45:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:53,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:45:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:53,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:45:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:53,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:45:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:53,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:45:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 17:45:53,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:45:53,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948642181] [2024-11-08 17:45:53,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948642181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:45:53,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:45:53,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:45:53,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038591462] [2024-11-08 17:45:53,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:45:53,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:45:53,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:45:53,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:45:53,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:45:53,373 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:45:53,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:45:53,631 INFO L93 Difference]: Finished difference Result 258 states and 367 transitions. [2024-11-08 17:45:53,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:45:53,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-08 17:45:53,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:45:53,634 INFO L225 Difference]: With dead ends: 258 [2024-11-08 17:45:53,635 INFO L226 Difference]: Without dead ends: 159 [2024-11-08 17:45:53,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:45:53,636 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 129 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:45:53,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 719 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:45:53,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-08 17:45:53,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 102. [2024-11-08 17:45:53,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:45:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2024-11-08 17:45:53,647 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 123 [2024-11-08 17:45:53,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:45:53,647 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2024-11-08 17:45:53,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:45:53,648 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2024-11-08 17:45:53,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 17:45:53,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:45:53,650 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:45:53,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:45:53,651 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:45:53,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:45:53,651 INFO L85 PathProgramCache]: Analyzing trace with hash -2032587097, now seen corresponding path program 1 times [2024-11-08 17:45:53,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:45:53,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010959595] [2024-11-08 17:45:53,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:45:53,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:45:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:55,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:45:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:55,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:45:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:55,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:45:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:55,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:45:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:55,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:45:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:55,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:45:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:55,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:45:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:55,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:45:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:55,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:45:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:55,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:45:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:55,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:45:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:55,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:45:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:55,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:45:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:55,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:45:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:55,113 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 17:45:55,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:45:55,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010959595] [2024-11-08 17:45:55,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010959595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:45:55,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:45:55,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:45:55,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249890395] [2024-11-08 17:45:55,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:45:55,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:45:55,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:45:55,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:45:55,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:45:55,117 INFO L87 Difference]: Start difference. First operand 102 states and 143 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 17:45:55,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:45:55,275 INFO L93 Difference]: Finished difference Result 237 states and 331 transitions. [2024-11-08 17:45:55,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:45:55,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-08 17:45:55,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:45:55,279 INFO L225 Difference]: With dead ends: 237 [2024-11-08 17:45:55,280 INFO L226 Difference]: Without dead ends: 138 [2024-11-08 17:45:55,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:45:55,283 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 43 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:45:55,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 688 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:45:55,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-08 17:45:55,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 106. [2024-11-08 17:45:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:45:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2024-11-08 17:45:55,301 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 123 [2024-11-08 17:45:55,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:45:55,301 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2024-11-08 17:45:55,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 17:45:55,302 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2024-11-08 17:45:55,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 17:45:55,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:45:55,306 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:45:55,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:45:55,307 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:45:55,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:45:55,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1794730014, now seen corresponding path program 1 times [2024-11-08 17:45:55,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:45:55,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397587401] [2024-11-08 17:45:55,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:45:55,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:45:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:56,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:45:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:56,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:45:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:56,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:45:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:56,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:45:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:56,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:45:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:56,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:45:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:56,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:45:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:56,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:45:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:56,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:45:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:56,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:45:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:56,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:45:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:56,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:45:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:56,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:45:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:56,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:45:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 17:45:56,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:45:56,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397587401] [2024-11-08 17:45:56,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397587401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:45:56,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:45:56,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:45:56,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839508063] [2024-11-08 17:45:56,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:45:56,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:45:56,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:45:56,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:45:56,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:45:56,253 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:45:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:45:56,982 INFO L93 Difference]: Finished difference Result 355 states and 501 transitions. [2024-11-08 17:45:56,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:45:56,982 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-08 17:45:56,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:45:56,985 INFO L225 Difference]: With dead ends: 355 [2024-11-08 17:45:56,986 INFO L226 Difference]: Without dead ends: 252 [2024-11-08 17:45:56,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:45:56,988 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 323 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:45:56,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1402 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:45:56,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-08 17:45:57,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 106. [2024-11-08 17:45:57,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:45:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 147 transitions. [2024-11-08 17:45:57,010 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 147 transitions. Word has length 125 [2024-11-08 17:45:57,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:45:57,011 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 147 transitions. [2024-11-08 17:45:57,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:45:57,013 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 147 transitions. [2024-11-08 17:45:57,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 17:45:57,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:45:57,014 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:45:57,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:45:57,015 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:45:57,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:45:57,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1097702270, now seen corresponding path program 1 times [2024-11-08 17:45:57,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:45:57,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225270014] [2024-11-08 17:45:57,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:45:57,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:45:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:58,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:45:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:58,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:45:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:58,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:45:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:58,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:45:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:58,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:45:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:58,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:45:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:58,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:45:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:58,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:45:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:58,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:45:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:58,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:45:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:58,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:45:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:58,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:45:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:58,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:45:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:58,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:45:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:58,082 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 17:45:58,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:45:58,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225270014] [2024-11-08 17:45:58,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225270014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:45:58,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:45:58,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:45:58,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806513328] [2024-11-08 17:45:58,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:45:58,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:45:58,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:45:58,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:45:58,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:45:58,086 INFO L87 Difference]: Start difference. First operand 106 states and 147 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 17:45:59,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:45:59,206 INFO L93 Difference]: Finished difference Result 347 states and 486 transitions. [2024-11-08 17:45:59,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:45:59,206 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-11-08 17:45:59,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:45:59,208 INFO L225 Difference]: With dead ends: 347 [2024-11-08 17:45:59,209 INFO L226 Difference]: Without dead ends: 244 [2024-11-08 17:45:59,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:45:59,210 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 655 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:45:59,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 947 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 17:45:59,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-08 17:45:59,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 106. [2024-11-08 17:45:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:45:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 146 transitions. [2024-11-08 17:45:59,228 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 146 transitions. Word has length 125 [2024-11-08 17:45:59,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:45:59,228 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 146 transitions. [2024-11-08 17:45:59,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 17:45:59,229 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 146 transitions. [2024-11-08 17:45:59,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 17:45:59,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:45:59,230 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:45:59,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:45:59,231 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:45:59,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:45:59,231 INFO L85 PathProgramCache]: Analyzing trace with hash -726339655, now seen corresponding path program 1 times [2024-11-08 17:45:59,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:45:59,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259348935] [2024-11-08 17:45:59,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:45:59,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:45:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:59,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:45:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:59,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:45:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:59,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:45:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:59,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:45:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:59,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:45:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:59,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:45:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:59,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:45:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:59,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:45:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:59,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:45:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:59,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:45:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:59,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:45:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:59,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:45:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:59,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:45:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:59,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:45:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 17:45:59,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:45:59,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259348935] [2024-11-08 17:45:59,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259348935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:45:59,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:45:59,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:45:59,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950206887] [2024-11-08 17:45:59,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:45:59,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:45:59,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:45:59,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:45:59,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:45:59,928 INFO L87 Difference]: Start difference. First operand 106 states and 146 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:00,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:00,194 INFO L93 Difference]: Finished difference Result 269 states and 375 transitions. [2024-11-08 17:46:00,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:46:00,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-08 17:46:00,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:00,196 INFO L225 Difference]: With dead ends: 269 [2024-11-08 17:46:00,196 INFO L226 Difference]: Without dead ends: 166 [2024-11-08 17:46:00,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:46:00,198 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 123 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:00,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 952 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:46:00,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-08 17:46:00,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 109. [2024-11-08 17:46:00,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 93 states have (on average 1.3010752688172043) internal successors, (121), 93 states have internal predecessors, (121), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:46:00,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 149 transitions. [2024-11-08 17:46:00,219 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 149 transitions. Word has length 125 [2024-11-08 17:46:00,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:00,220 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 149 transitions. [2024-11-08 17:46:00,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:00,220 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 149 transitions. [2024-11-08 17:46:00,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 17:46:00,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:00,223 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:00,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:46:00,224 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:00,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:00,224 INFO L85 PathProgramCache]: Analyzing trace with hash -150312195, now seen corresponding path program 1 times [2024-11-08 17:46:00,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:46:00,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337485033] [2024-11-08 17:46:00,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:00,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:46:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:00,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:46:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:00,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:46:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:00,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:46:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:00,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:46:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:00,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:46:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:00,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:46:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:00,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:46:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:00,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:46:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:00,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:46:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:00,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:46:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:00,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:46:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:00,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:46:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:00,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:46:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:00,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:46:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:00,891 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 17:46:00,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:46:00,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337485033] [2024-11-08 17:46:00,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337485033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:46:00,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:46:00,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:46:00,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57607707] [2024-11-08 17:46:00,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:46:00,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:46:00,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:46:00,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:46:00,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:46:00,894 INFO L87 Difference]: Start difference. First operand 109 states and 149 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:01,172 INFO L93 Difference]: Finished difference Result 322 states and 443 transitions. [2024-11-08 17:46:01,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:46:01,173 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2024-11-08 17:46:01,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:01,174 INFO L225 Difference]: With dead ends: 322 [2024-11-08 17:46:01,174 INFO L226 Difference]: Without dead ends: 216 [2024-11-08 17:46:01,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:46:01,176 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 131 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:01,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 964 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:46:01,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-08 17:46:01,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 114. [2024-11-08 17:46:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:46:01,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2024-11-08 17:46:01,194 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 127 [2024-11-08 17:46:01,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:01,195 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2024-11-08 17:46:01,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:01,195 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2024-11-08 17:46:01,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 17:46:01,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:01,197 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:01,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:46:01,198 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:01,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:01,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1694162002, now seen corresponding path program 1 times [2024-11-08 17:46:01,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:46:01,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113124384] [2024-11-08 17:46:01,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:01,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:46:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:01,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:46:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:01,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:46:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:01,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:46:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:01,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:46:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:01,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:46:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:01,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:46:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:01,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:46:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:01,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:46:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:01,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:46:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:01,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:46:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:01,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:46:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:01,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:46:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:01,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:46:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:01,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:46:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 17:46:01,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:46:01,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113124384] [2024-11-08 17:46:01,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113124384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:46:01,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:46:01,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:46:01,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346411385] [2024-11-08 17:46:01,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:46:01,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:46:01,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:46:01,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:46:01,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:46:01,532 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:01,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:01,753 INFO L93 Difference]: Finished difference Result 225 states and 307 transitions. [2024-11-08 17:46:01,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:46:01,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2024-11-08 17:46:01,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:01,755 INFO L225 Difference]: With dead ends: 225 [2024-11-08 17:46:01,755 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 17:46:01,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:46:01,756 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 119 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:01,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 325 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:46:01,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 17:46:01,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-08 17:46:01,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.2857142857142858) internal successors, (126), 98 states have internal predecessors, (126), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:46:01,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 154 transitions. [2024-11-08 17:46:01,777 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 154 transitions. Word has length 127 [2024-11-08 17:46:01,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:01,777 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 154 transitions. [2024-11-08 17:46:01,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:01,778 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 154 transitions. [2024-11-08 17:46:01,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 17:46:01,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:01,779 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:01,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:46:01,779 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:01,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:01,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1952327440, now seen corresponding path program 1 times [2024-11-08 17:46:01,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:46:01,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670883610] [2024-11-08 17:46:01,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:01,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:46:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 17:46:01,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [169945555] [2024-11-08 17:46:01,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:01,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:46:01,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:46:01,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:46:01,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:46:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:46:02,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:46:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:46:02,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:46:02,586 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:46:02,587 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:46:02,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 17:46:02,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 17:46:02,797 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:46:02,898 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:46:02,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:46:02 BoogieIcfgContainer [2024-11-08 17:46:02,902 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:46:02,902 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:46:02,902 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:46:02,902 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:46:02,906 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:45:50" (3/4) ... [2024-11-08 17:46:02,909 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:46:02,910 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:46:02,910 INFO L158 Benchmark]: Toolchain (without parser) took 14322.84ms. Allocated memory was 174.1MB in the beginning and 314.6MB in the end (delta: 140.5MB). Free memory was 132.9MB in the beginning and 204.8MB in the end (delta: -71.9MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. [2024-11-08 17:46:02,910 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 119.5MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:46:02,911 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.72ms. Allocated memory is still 174.1MB. Free memory was 132.9MB in the beginning and 116.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 17:46:02,911 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.91ms. Allocated memory is still 174.1MB. Free memory was 116.0MB in the beginning and 112.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:46:02,911 INFO L158 Benchmark]: Boogie Preprocessor took 108.62ms. Allocated memory is still 174.1MB. Free memory was 112.3MB in the beginning and 107.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:46:02,912 INFO L158 Benchmark]: RCFGBuilder took 1010.00ms. Allocated memory is still 174.1MB. Free memory was 107.4MB in the beginning and 127.5MB in the end (delta: -20.1MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2024-11-08 17:46:02,912 INFO L158 Benchmark]: TraceAbstraction took 12693.10ms. Allocated memory was 174.1MB in the beginning and 314.6MB in the end (delta: 140.5MB). Free memory was 126.8MB in the beginning and 204.8MB in the end (delta: -77.9MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. [2024-11-08 17:46:02,912 INFO L158 Benchmark]: Witness Printer took 7.74ms. Allocated memory is still 314.6MB. Free memory is still 204.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:46:02,914 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.26ms. Allocated memory is still 119.5MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.72ms. Allocated memory is still 174.1MB. Free memory was 132.9MB in the beginning and 116.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.91ms. Allocated memory is still 174.1MB. Free memory was 116.0MB in the beginning and 112.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.62ms. Allocated memory is still 174.1MB. Free memory was 112.3MB in the beginning and 107.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1010.00ms. Allocated memory is still 174.1MB. Free memory was 107.4MB in the beginning and 127.5MB in the end (delta: -20.1MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12693.10ms. Allocated memory was 174.1MB in the beginning and 314.6MB in the end (delta: 140.5MB). Free memory was 126.8MB in the beginning and 204.8MB in the end (delta: -77.9MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. * Witness Printer took 7.74ms. Allocated memory is still 314.6MB. Free memory is still 204.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 someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryArithmeticFLOAToperation at line 55. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 0 }; [L25-L27] float float_Array_0[2][3] = { {2.4, 256.75, 0.0}, {127.75, 256.6, 31.4} }; [L25-L27] float float_Array_0[2][3] = { {2.4, 256.75, 0.0}, {127.75, 256.6, 31.4} }; [L25-L27] float float_Array_0[2][3] = { {2.4, 256.75, 0.0}, {127.75, 256.6, 31.4} }; [L25-L27] float float_Array_0[2][3] = { {2.4, 256.75, 0.0}, {127.75, 256.6, 31.4} }; [L25-L27] float float_Array_0[2][3] = { {2.4, 256.75, 0.0}, {127.75, 256.6, 31.4} }; [L25-L27] float float_Array_0[2][3] = { {2.4, 256.75, 0.0}, {127.75, 256.6, 31.4} }; [L25-L27] float float_Array_0[2][3] = { {2.4, 256.75, 0.0}, {127.75, 256.6, 31.4} }; [L28-L30] signed long int signed_long_int_Array_0[2] = { 64, 0 }; [L28-L30] signed long int signed_long_int_Array_0[2] = { 64, 0 }; [L28-L30] signed long int signed_long_int_Array_0[2] = { 64, 0 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 100, 32 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 100, 32 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 100, 32 }; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] FCALL updateLastVariables() [L99] CALL updateVariables() [L64] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L68] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L69] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] BOOL_unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] float_Array_0[1][0] = __VERIFIER_nondet_float() [L77] EXPR float_Array_0[1][0] [L77] EXPR float_Array_0[1][0] >= -461168.6018427382800e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] EXPR float_Array_0[1][0] >= -461168.6018427382800e+13F && float_Array_0[1][0] <= -1.0e-20F [L77] EXPR float_Array_0[1][0] [L77] EXPR float_Array_0[1][0] >= -461168.6018427382800e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] EXPR (float_Array_0[1][0] >= -461168.6018427382800e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] EXPR (float_Array_0[1][0] >= -461168.6018427382800e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] CALL assume_abort_if_not((float_Array_0[1][0] >= -461168.6018427382800e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] RET assume_abort_if_not((float_Array_0[1][0] >= -461168.6018427382800e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] float_Array_0[0][1] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[0][1] [L79] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F [L79] EXPR float_Array_0[0][1] [L79] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] CALL assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] RET assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] float_Array_0[0][2] = __VERIFIER_nondet_float() [L81] EXPR float_Array_0[0][2] [L81] EXPR float_Array_0[0][2] >= 2305843.009213691390e+12F && float_Array_0[0][2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] EXPR float_Array_0[0][2] >= 2305843.009213691390e+12F && float_Array_0[0][2] <= -1.0e-20F [L81] EXPR float_Array_0[0][2] [L81] EXPR float_Array_0[0][2] >= 2305843.009213691390e+12F && float_Array_0[0][2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] EXPR (float_Array_0[0][2] >= 2305843.009213691390e+12F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 4611686.018427382800e+12F && float_Array_0[0][2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] EXPR (float_Array_0[0][2] >= 2305843.009213691390e+12F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 4611686.018427382800e+12F && float_Array_0[0][2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] CALL assume_abort_if_not((float_Array_0[0][2] >= 2305843.009213691390e+12F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 4611686.018427382800e+12F && float_Array_0[0][2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] RET assume_abort_if_not((float_Array_0[0][2] >= 2305843.009213691390e+12F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 4611686.018427382800e+12F && float_Array_0[0][2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] float_Array_0[1][2] = __VERIFIER_nondet_float() [L83] EXPR float_Array_0[1][2] [L83] EXPR float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F [L83] EXPR float_Array_0[1][2] [L83] EXPR float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F) || (float_Array_0[1][2] <= 2305843.009213691390e+12F && float_Array_0[1][2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F) || (float_Array_0[1][2] <= 2305843.009213691390e+12F && float_Array_0[1][2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] CALL assume_abort_if_not((float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F) || (float_Array_0[1][2] <= 2305843.009213691390e+12F && float_Array_0[1][2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] RET assume_abort_if_not((float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F) || (float_Array_0[1][2] <= 2305843.009213691390e+12F && float_Array_0[1][2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L85] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L99] RET updateVariables() [L100] CALL step() [L37] EXPR float_Array_0[0][2] [L37] float_Array_0[1][1] = float_Array_0[0][2] [L38] EXPR unsigned_char_Array_0[0] [L38] unsigned_char_Array_0[1] = unsigned_char_Array_0[0] [L39] EXPR unsigned_char_Array_0[1] [L39] signed_long_int_Array_0[1] = unsigned_char_Array_0[1] [L40] EXPR unsigned_char_Array_0[1] [L40] unsigned char stepLocal_1 = unsigned_char_Array_0[1]; [L41] EXPR signed_long_int_Array_0[1] [L41] EXPR signed_long_int_Array_0[1] [L41] EXPR unsigned_char_Array_0[1] [L41] EXPR unsigned_char_Array_0[1] [L41] signed long int stepLocal_0 = (signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]); [L42] COND FALSE !(stepLocal_0 >= 1u) [L49] EXPR unsigned_char_Array_0[1] [L49] signed_long_int_Array_0[0] = unsigned_char_Array_0[1] [L51] EXPR signed_long_int_Array_0[0] [L51] signed long int stepLocal_2 = signed_long_int_Array_0[0]; [L52] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L52] COND FALSE !(unsigned_char_Array_0[1] > stepLocal_2) [L55] EXPR float_Array_0[0][1] [L55] EXPR float_Array_0[0][2] [L55] EXPR float_Array_0[1][2] [L55] float_Array_0[0][0] = (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2])) [L57] EXPR signed_long_int_Array_0[1] [L57] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L57] COND FALSE !(signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) [L60] EXPR BOOL_unsigned_char_Array_0[0] [L60] BOOL_unsigned_char_Array_0[4] = BOOL_unsigned_char_Array_0[0] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR signed_long_int_Array_0[1] [L91] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR (signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) [L91] EXPR BOOL_unsigned_char_Array_0[4] [L91] EXPR BOOL_unsigned_char_Array_0[0] [L91] EXPR (signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR ((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR ((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) [L91] EXPR signed_long_int_Array_0[1] [L91] EXPR signed_long_int_Array_0[1] [L91] EXPR unsigned_char_Array_0[1] [L91] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR (((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) [L91] EXPR signed_long_int_Array_0[0] [L91] EXPR unsigned_char_Array_0[1] [L91] EXPR (((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR ((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR (((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])))) && ((unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR (((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])))) && ((unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2]))))) [L91] EXPR unsigned_char_Array_0[1] [L91] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR (unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2])))) [L91] EXPR float_Array_0[0][0] [L91] EXPR float_Array_0[0][1] [L91] EXPR float_Array_0[0][2] [L91] EXPR float_Array_0[1][2] [L91] EXPR (unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR (((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])))) && ((unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR ((((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])))) && ((unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2])))))) && (float_Array_0[1][1] == ((float) float_Array_0[0][2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR ((((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])))) && ((unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2])))))) && (float_Array_0[1][1] == ((float) float_Array_0[0][2])) [L91] EXPR float_Array_0[1][1] [L91] EXPR float_Array_0[0][2] [L91] EXPR ((((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])))) && ((unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2])))))) && (float_Array_0[1][1] == ((float) float_Array_0[0][2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR (((((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])))) && ((unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2])))))) && (float_Array_0[1][1] == ((float) float_Array_0[0][2]))) && (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR (((((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])))) && ((unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2])))))) && (float_Array_0[1][1] == ((float) float_Array_0[0][2]))) && (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR ((((((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])))) && ((unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2])))))) && (float_Array_0[1][1] == ((float) float_Array_0[0][2]))) && (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR ((((((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])))) && ((unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2])))))) && (float_Array_0[1][1] == ((float) float_Array_0[0][2]))) && (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91-L92] return ((((((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])))) && ((unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2])))))) && (float_Array_0[1][1] == ((float) float_Array_0[0][2]))) && (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 12, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1526 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1525 mSDsluCounter, 7323 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5469 mSDsCounter, 266 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1302 IncrementalHoareTripleChecker+Invalid, 1568 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 266 mSolverCounterUnsat, 1854 mSDtfsCounter, 1302 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 428 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=10, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 534 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 1621 NumberOfCodeBlocks, 1621 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1356 ConstructedInterpolants, 0 QuantifiedInterpolants, 2191 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 4004/4004 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 17:46:02,939 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-8.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 3812ed47486d263f6b3b8dc47cacf4510da1c1e9619759cd56ba725df10b3e2b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:46:05,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:46:05,529 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:46:05,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:46:05,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:46:05,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:46:05,576 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:46:05,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:46:05,577 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:46:05,577 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:46:05,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:46:05,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:46:05,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:46:05,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:46:05,582 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:46:05,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:46:05,583 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:46:05,583 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:46:05,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:46:05,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:46:05,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:46:05,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:46:05,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:46:05,588 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:46:05,588 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:46:05,589 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:46:05,589 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:46:05,589 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:46:05,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:46:05,592 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:46:05,593 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:46:05,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:46:05,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:46:05,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:46:05,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:46:05,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:46:05,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:46:05,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:46:05,595 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:46:05,595 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:46:05,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:46:05,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:46:05,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:46:05,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:46:05,597 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_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 -> 3812ed47486d263f6b3b8dc47cacf4510da1c1e9619759cd56ba725df10b3e2b [2024-11-08 17:46:05,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:46:05,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:46:05,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:46:05,986 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:46:05,987 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:46:05,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-8.i Unable to find full path for "g++" [2024-11-08 17:46:08,056 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:46:08,327 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:46:08,328 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-8.i [2024-11-08 17:46:08,342 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/data/d693d16fd/ccfe58c2089449db96da88ffdc336d19/FLAG29172ba88 [2024-11-08 17:46:08,361 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/data/d693d16fd/ccfe58c2089449db96da88ffdc336d19 [2024-11-08 17:46:08,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:46:08,367 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:46:08,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:46:08,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:46:08,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:46:08,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:46:08" (1/1) ... [2024-11-08 17:46:08,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2138710c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:46:08, skipping insertion in model container [2024-11-08 17:46:08,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:46:08" (1/1) ... [2024-11-08 17:46:08,412 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:46:08,656 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_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-8.i[915,928] [2024-11-08 17:46:08,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:46:08,781 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:46:08,799 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_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-8.i[915,928] [2024-11-08 17:46:08,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:46:08,907 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:46:08,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:46:08 WrapperNode [2024-11-08 17:46:08,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:46:08,934 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:46:08,934 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:46:08,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:46:08,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:46:08" (1/1) ... [2024-11-08 17:46:08,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:46:08" (1/1) ... [2024-11-08 17:46:09,040 INFO L138 Inliner]: procedures = 33, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 446 [2024-11-08 17:46:09,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:46:09,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:46:09,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:46:09,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:46:09,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:46:08" (1/1) ... [2024-11-08 17:46:09,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:46:08" (1/1) ... [2024-11-08 17:46:09,068 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:46:08" (1/1) ... [2024-11-08 17:46:09,101 INFO L175 MemorySlicer]: Split 126 memory accesses to 5 slices as follows [2, 29, 48, 22, 25]. 38 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 6, 2, 2]. The 19 writes are split as follows [0, 6, 7, 4, 2]. [2024-11-08 17:46:09,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:46:08" (1/1) ... [2024-11-08 17:46:09,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:46:08" (1/1) ... [2024-11-08 17:46:09,126 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:46:08" (1/1) ... [2024-11-08 17:46:09,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:46:08" (1/1) ... [2024-11-08 17:46:09,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:46:08" (1/1) ... [2024-11-08 17:46:09,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:46:08" (1/1) ... [2024-11-08 17:46:09,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:46:09,161 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:46:09,162 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:46:09,162 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:46:09,163 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:46:08" (1/1) ... [2024-11-08 17:46:09,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:46:09,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:46:09,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:46:09,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:46:09,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:46:09,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 17:46:09,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 17:46:09,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-08 17:46:09,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-08 17:46:09,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-08 17:46:09,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:46:09,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 17:46:09,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 17:46:09,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-08 17:46:09,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-08 17:46:09,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-08 17:46:09,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-08 17:46:09,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-08 17:46:09,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-08 17:46:09,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-08 17:46:09,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-08 17:46:09,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-08 17:46:09,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-08 17:46:09,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-08 17:46:09,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-08 17:46:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 17:46:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 17:46:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-08 17:46:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-08 17:46:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-08 17:46:09,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-08 17:46:09,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-08 17:46:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-08 17:46:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-08 17:46:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-08 17:46:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-08 17:46:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-08 17:46:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-08 17:46:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-08 17:46:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-08 17:46:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:46:09,248 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:46:09,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:46:09,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:46:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 17:46:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 17:46:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-08 17:46:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-08 17:46:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-08 17:46:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 17:46:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 17:46:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-08 17:46:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-08 17:46:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-08 17:46:09,422 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:46:09,423 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:46:11,181 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-08 17:46:11,181 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:46:11,196 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:46:11,196 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:46:11,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:46:11 BoogieIcfgContainer [2024-11-08 17:46:11,197 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:46:11,199 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:46:11,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:46:11,202 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:46:11,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:46:08" (1/3) ... [2024-11-08 17:46:11,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416d85f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:46:11, skipping insertion in model container [2024-11-08 17:46:11,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:46:08" (2/3) ... [2024-11-08 17:46:11,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416d85f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:46:11, skipping insertion in model container [2024-11-08 17:46:11,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:46:11" (3/3) ... [2024-11-08 17:46:11,205 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-8.i [2024-11-08 17:46:11,222 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:46:11,222 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:46:11,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:46:11,302 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;@1620e1f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:46:11,302 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:46:11,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:46:11,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 17:46:11,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:11,319 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:11,320 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:11,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:11,325 INFO L85 PathProgramCache]: Analyzing trace with hash 260702647, now seen corresponding path program 1 times [2024-11-08 17:46:11,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:46:11,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183963374] [2024-11-08 17:46:11,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:11,340 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 17:46:11,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:46:11,341 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:11,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:11,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:46:11,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:11,903 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-11-08 17:46:11,904 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:46:11,904 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:46:11,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183963374] [2024-11-08 17:46:11,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183963374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:46:11,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:46:11,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:46:11,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673561960] [2024-11-08 17:46:11,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:46:11,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:46:11,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:46:11,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:46:11,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:46:11,944 INFO L87 Difference]: Start difference. First operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 17:46:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:11,985 INFO L93 Difference]: Finished difference Result 193 states and 298 transitions. [2024-11-08 17:46:11,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:46:11,987 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-08 17:46:11,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:11,994 INFO L225 Difference]: With dead ends: 193 [2024-11-08 17:46:11,995 INFO L226 Difference]: Without dead ends: 96 [2024-11-08 17:46:12,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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 17:46:12,012 INFO L432 NwaCegarLoop]: 138 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, 138 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 17:46:12,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:46:12,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-08 17:46:12,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-08 17:46:12,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:46:12,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-08 17:46:12,069 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 123 [2024-11-08 17:46:12,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:12,070 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-08 17:46:12,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 17:46:12,070 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-08 17:46:12,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 17:46:12,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:12,074 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:12,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:12,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:12,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:12,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:12,276 INFO L85 PathProgramCache]: Analyzing trace with hash 936025891, now seen corresponding path program 1 times [2024-11-08 17:46:12,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:46:12,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979225530] [2024-11-08 17:46:12,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:12,278 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 17:46:12,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:46:12,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:12,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:12,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:46:12,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:12,758 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-08 17:46:12,758 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:46:12,759 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:46:12,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979225530] [2024-11-08 17:46:12,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1979225530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:46:12,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:46:12,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:46:12,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906024888] [2024-11-08 17:46:12,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:46:12,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:46:12,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:46:12,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:46:12,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:46:12,768 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 17:46:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:12,866 INFO L93 Difference]: Finished difference Result 191 states and 276 transitions. [2024-11-08 17:46:12,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:46:12,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-08 17:46:12,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:12,872 INFO L225 Difference]: With dead ends: 191 [2024-11-08 17:46:12,874 INFO L226 Difference]: Without dead ends: 98 [2024-11-08 17:46:12,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 120 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 17:46:12,876 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 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 17:46:12,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:46:12,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-08 17:46:12,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-08 17:46:12,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:46:12,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-08 17:46:12,906 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 123 [2024-11-08 17:46:12,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:12,911 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-08 17:46:12,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 17:46:12,911 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-08 17:46:12,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 17:46:12,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:12,915 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:12,929 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:13,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:13,116 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:13,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:13,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1025548767, now seen corresponding path program 1 times [2024-11-08 17:46:13,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:46:13,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759559593] [2024-11-08 17:46:13,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:13,118 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 17:46:13,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:46:13,120 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:13,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:13,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 17:46:13,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:13,682 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 17:46:13,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:46:13,684 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:46:13,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759559593] [2024-11-08 17:46:13,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759559593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:46:13,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:46:13,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:46:13,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778084829] [2024-11-08 17:46:13,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:46:13,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:46:13,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:46:13,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:46:13,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:46:13,689 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:13,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:13,800 INFO L93 Difference]: Finished difference Result 198 states and 284 transitions. [2024-11-08 17:46:13,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:46:13,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-08 17:46:13,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:13,804 INFO L225 Difference]: With dead ends: 198 [2024-11-08 17:46:13,804 INFO L226 Difference]: Without dead ends: 103 [2024-11-08 17:46:13,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:46:13,808 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:13,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 516 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:46:13,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-08 17:46:13,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-08 17:46:13,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:46:13,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2024-11-08 17:46:13,826 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 123 [2024-11-08 17:46:13,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:13,830 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2024-11-08 17:46:13,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:13,831 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2024-11-08 17:46:13,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 17:46:13,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:13,833 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:13,845 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:14,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:14,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:14,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:14,034 INFO L85 PathProgramCache]: Analyzing trace with hash -345490397, now seen corresponding path program 1 times [2024-11-08 17:46:14,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:46:14,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507835927] [2024-11-08 17:46:14,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:14,035 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 17:46:14,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:46:14,038 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:14,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:14,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 17:46:14,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:14,651 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 17:46:14,651 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:46:14,651 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:46:14,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507835927] [2024-11-08 17:46:14,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507835927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:46:14,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:46:14,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:46:14,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081289429] [2024-11-08 17:46:14,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:46:14,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:46:14,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:46:14,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:46:14,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:46:14,655 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:14,804 INFO L93 Difference]: Finished difference Result 206 states and 292 transitions. [2024-11-08 17:46:14,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:46:14,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-08 17:46:14,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:14,807 INFO L225 Difference]: With dead ends: 206 [2024-11-08 17:46:14,807 INFO L226 Difference]: Without dead ends: 107 [2024-11-08 17:46:14,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:46:14,809 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:14,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 755 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:46:14,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-08 17:46:14,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-11-08 17:46:14,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:46:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2024-11-08 17:46:14,818 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 123 [2024-11-08 17:46:14,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:14,819 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2024-11-08 17:46:14,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:14,820 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2024-11-08 17:46:14,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 17:46:14,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:14,822 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:14,832 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:15,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:15,026 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:15,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:15,027 INFO L85 PathProgramCache]: Analyzing trace with hash -343643355, now seen corresponding path program 1 times [2024-11-08 17:46:15,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:46:15,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881996937] [2024-11-08 17:46:15,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:15,028 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 17:46:15,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:46:15,032 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:15,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:15,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:46:15,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:15,834 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 95 treesize of output 41 [2024-11-08 17:46:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-08 17:46:15,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:46:15,909 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:46:15,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881996937] [2024-11-08 17:46:15,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881996937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:46:15,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:46:15,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:46:15,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828495624] [2024-11-08 17:46:15,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:46:15,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:46:15,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:46:15,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:46:15,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:46:15,912 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 17:46:18,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:18,459 INFO L93 Difference]: Finished difference Result 209 states and 293 transitions. [2024-11-08 17:46:18,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:46:18,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-08 17:46:18,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:18,462 INFO L225 Difference]: With dead ends: 209 [2024-11-08 17:46:18,462 INFO L226 Difference]: Without dead ends: 106 [2024-11-08 17:46:18,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:46:18,463 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 101 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:18,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 428 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 17:46:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-08 17:46:18,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2024-11-08 17:46:18,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:46:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 145 transitions. [2024-11-08 17:46:18,481 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 145 transitions. Word has length 123 [2024-11-08 17:46:18,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:18,482 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 145 transitions. [2024-11-08 17:46:18,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 17:46:18,482 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 145 transitions. [2024-11-08 17:46:18,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 17:46:18,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:18,484 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:18,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:46:18,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:18,689 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:18,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:18,689 INFO L85 PathProgramCache]: Analyzing trace with hash 664723597, now seen corresponding path program 1 times [2024-11-08 17:46:18,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:46:18,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948449128] [2024-11-08 17:46:18,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:18,690 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 17:46:18,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:46:18,691 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:18,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:19,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 17:46:19,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:19,500 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 94 treesize of output 40 [2024-11-08 17:46:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 36 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-11-08 17:46:19,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:46:19,927 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 58 treesize of output 22 [2024-11-08 17:46:20,008 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-08 17:46:20,008 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:46:20,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948449128] [2024-11-08 17:46:20,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948449128] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:46:20,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:46:20,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-08 17:46:20,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934377741] [2024-11-08 17:46:20,013 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:46:20,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 17:46:20,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:46:20,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 17:46:20,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:46:20,015 INFO L87 Difference]: Start difference. First operand 104 states and 145 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 4 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-08 17:46:22,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:46:24,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:24,118 INFO L93 Difference]: Finished difference Result 218 states and 302 transitions. [2024-11-08 17:46:24,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:46:24,119 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 4 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) Word has length 125 [2024-11-08 17:46:24,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:24,121 INFO L225 Difference]: With dead ends: 218 [2024-11-08 17:46:24,121 INFO L226 Difference]: Without dead ends: 106 [2024-11-08 17:46:24,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-08 17:46:24,122 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 113 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:24,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 646 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-08 17:46:24,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-08 17:46:24,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2024-11-08 17:46:24,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 88 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:46:24,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2024-11-08 17:46:24,132 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 125 [2024-11-08 17:46:24,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:24,132 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2024-11-08 17:46:24,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 4 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-08 17:46:24,133 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2024-11-08 17:46:24,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 17:46:24,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:24,135 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:24,145 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:24,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:24,336 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:24,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:24,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1082120203, now seen corresponding path program 1 times [2024-11-08 17:46:24,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:46:24,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437964261] [2024-11-08 17:46:24,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:24,337 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 17:46:24,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:46:24,339 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:24,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:24,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:46:24,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:25,128 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 97 treesize of output 43 [2024-11-08 17:46:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-08 17:46:25,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:46:25,169 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:46:25,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437964261] [2024-11-08 17:46:25,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437964261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:46:25,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:46:25,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:46:25,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695654854] [2024-11-08 17:46:25,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:46:25,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:46:25,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:46:25,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:46:25,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:46:25,172 INFO L87 Difference]: Start difference. First operand 104 states and 143 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 17:46:27,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:27,795 INFO L93 Difference]: Finished difference Result 206 states and 284 transitions. [2024-11-08 17:46:27,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:46:27,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-11-08 17:46:27,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:27,797 INFO L225 Difference]: With dead ends: 206 [2024-11-08 17:46:27,798 INFO L226 Difference]: Without dead ends: 105 [2024-11-08 17:46:27,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:46:27,799 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 88 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:27,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 415 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 17:46:27,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-08 17:46:27,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-08 17:46:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 88 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:46:27,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 142 transitions. [2024-11-08 17:46:27,809 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 142 transitions. Word has length 125 [2024-11-08 17:46:27,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:27,810 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 142 transitions. [2024-11-08 17:46:27,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 17:46:27,811 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 142 transitions. [2024-11-08 17:46:27,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 17:46:27,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:27,813 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:27,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:46:28,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:28,014 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:28,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:28,014 INFO L85 PathProgramCache]: Analyzing trace with hash 3387621, now seen corresponding path program 1 times [2024-11-08 17:46:28,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:46:28,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006900426] [2024-11-08 17:46:28,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:28,015 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 17:46:28,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:46:28,016 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:28,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:28,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:46:28,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:28,793 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 95 treesize of output 41 [2024-11-08 17:46:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-08 17:46:28,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:46:28,833 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:46:28,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006900426] [2024-11-08 17:46:28,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006900426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:46:28,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:46:28,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:46:28,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119554747] [2024-11-08 17:46:28,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:46:28,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:46:28,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:46:28,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:46:28,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:46:28,836 INFO L87 Difference]: Start difference. First operand 104 states and 142 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 17:46:31,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:31,824 INFO L93 Difference]: Finished difference Result 206 states and 282 transitions. [2024-11-08 17:46:31,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:46:31,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 127 [2024-11-08 17:46:31,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:31,826 INFO L225 Difference]: With dead ends: 206 [2024-11-08 17:46:31,826 INFO L226 Difference]: Without dead ends: 105 [2024-11-08 17:46:31,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:46:31,827 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 79 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:31,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 409 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 17:46:31,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-08 17:46:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-08 17:46:31,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 88 states have internal predecessors, (113), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:46:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 141 transitions. [2024-11-08 17:46:31,837 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 141 transitions. Word has length 127 [2024-11-08 17:46:31,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:31,841 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 141 transitions. [2024-11-08 17:46:31,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 17:46:31,842 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 141 transitions. [2024-11-08 17:46:31,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 17:46:31,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:31,843 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:31,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:32,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:32,044 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:32,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:32,045 INFO L85 PathProgramCache]: Analyzing trace with hash 59889611, now seen corresponding path program 1 times [2024-11-08 17:46:32,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:46:32,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262150139] [2024-11-08 17:46:32,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:32,045 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 17:46:32,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:46:32,046 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:32,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:32,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:46:32,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:32,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-08 17:46:32,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-08 17:46:32,592 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 17:46:32,652 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 17:46:32,653 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:46:32,653 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:46:32,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262150139] [2024-11-08 17:46:32,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262150139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:46:32,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:46:32,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:46:32,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327538013] [2024-11-08 17:46:32,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:46:32,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:46:32,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:46:32,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:46:32,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:46:32,657 INFO L87 Difference]: Start difference. First operand 104 states and 141 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:33,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:33,375 INFO L93 Difference]: Finished difference Result 260 states and 354 transitions. [2024-11-08 17:46:33,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:46:33,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 129 [2024-11-08 17:46:33,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:33,378 INFO L225 Difference]: With dead ends: 260 [2024-11-08 17:46:33,378 INFO L226 Difference]: Without dead ends: 159 [2024-11-08 17:46:33,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:46:33,379 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 123 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:33,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 457 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:46:33,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-08 17:46:33,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 104. [2024-11-08 17:46:33,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 88 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:46:33,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 140 transitions. [2024-11-08 17:46:33,391 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 140 transitions. Word has length 129 [2024-11-08 17:46:33,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:33,392 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 140 transitions. [2024-11-08 17:46:33,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:33,392 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 140 transitions. [2024-11-08 17:46:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 17:46:33,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:33,394 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:33,404 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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)] Ended with exit code 0 [2024-11-08 17:46:33,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:33,595 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:33,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:33,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1629054131, now seen corresponding path program 1 times [2024-11-08 17:46:33,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:46:33,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001049638] [2024-11-08 17:46:33,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:33,596 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 17:46:33,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:46:33,597 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:33,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:34,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 17:46:34,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:34,121 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 17:46:34,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2024-11-08 17:46:34,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:34,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2024-11-08 17:46:35,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:35,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 44 [2024-11-08 17:46:36,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:36,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 55 [2024-11-08 17:46:36,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:36,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 48 [2024-11-08 17:46:37,006 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 108 proven. 72 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-08 17:46:37,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:46:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 17:46:37,279 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:46:37,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001049638] [2024-11-08 17:46:37,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001049638] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:46:37,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:46:37,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 17 [2024-11-08 17:46:37,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953409343] [2024-11-08 17:46:37,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:46:37,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:46:37,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:46:37,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:46:37,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-11-08 17:46:37,282 INFO L87 Difference]: Start difference. First operand 104 states and 140 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:37,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:37,520 INFO L93 Difference]: Finished difference Result 245 states and 329 transitions. [2024-11-08 17:46:37,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:46:37,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 129 [2024-11-08 17:46:37,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:37,522 INFO L225 Difference]: With dead ends: 245 [2024-11-08 17:46:37,522 INFO L226 Difference]: Without dead ends: 144 [2024-11-08 17:46:37,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:46:37,524 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 43 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:37,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 516 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:46:37,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-08 17:46:37,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 108. [2024-11-08 17:46:37,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.2717391304347827) internal successors, (117), 92 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:46:37,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 145 transitions. [2024-11-08 17:46:37,533 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 145 transitions. Word has length 129 [2024-11-08 17:46:37,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:37,534 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 145 transitions. [2024-11-08 17:46:37,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:37,534 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 145 transitions. [2024-11-08 17:46:37,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 17:46:37,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:37,536 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:37,547 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:37,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:37,737 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:37,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:37,737 INFO L85 PathProgramCache]: Analyzing trace with hash -546606328, now seen corresponding path program 1 times [2024-11-08 17:46:37,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:46:37,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565610007] [2024-11-08 17:46:37,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:37,738 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 17:46:37,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:46:37,739 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:37,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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)] Waiting until timeout for monitored process [2024-11-08 17:46:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:38,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 17:46:38,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:38,610 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 39 treesize of output 21 [2024-11-08 17:46:38,643 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 195 proven. 18 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-08 17:46:38,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:46:39,146 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-08 17:46:39,146 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:46:39,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [565610007] [2024-11-08 17:46:39,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [565610007] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:46:39,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:46:39,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-11-08 17:46:39,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819835752] [2024-11-08 17:46:39,148 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:46:39,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:46:39,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:46:39,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:46:39,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:46:39,150 INFO L87 Difference]: Start difference. First operand 108 states and 145 transitions. Second operand has 10 states, 8 states have (on average 9.25) internal successors, (74), 10 states have internal predecessors, (74), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-08 17:46:39,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:39,843 INFO L93 Difference]: Finished difference Result 221 states and 294 transitions. [2024-11-08 17:46:39,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:46:39,844 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.25) internal successors, (74), 10 states have internal predecessors, (74), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) Word has length 131 [2024-11-08 17:46:39,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:39,846 INFO L225 Difference]: With dead ends: 221 [2024-11-08 17:46:39,846 INFO L226 Difference]: Without dead ends: 116 [2024-11-08 17:46:39,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:46:39,847 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 71 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:39,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 450 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:46:39,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-08 17:46:39,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2024-11-08 17:46:39,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 95 states have internal predecessors, (119), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:46:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 147 transitions. [2024-11-08 17:46:39,859 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 147 transitions. Word has length 131 [2024-11-08 17:46:39,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:39,861 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 147 transitions. [2024-11-08 17:46:39,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.25) internal successors, (74), 10 states have internal predecessors, (74), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-08 17:46:39,862 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 147 transitions. [2024-11-08 17:46:39,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 17:46:39,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:39,866 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:39,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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)] Ended with exit code 0 [2024-11-08 17:46:40,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:40,066 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:40,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:40,067 INFO L85 PathProgramCache]: Analyzing trace with hash 150421416, now seen corresponding path program 1 times [2024-11-08 17:46:40,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:46:40,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858974372] [2024-11-08 17:46:40,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:40,068 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 17:46:40,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:46:40,071 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:40,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:40,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:46:40,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:40,487 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 13 [2024-11-08 17:46:40,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-08 17:46:40,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:40,622 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 42 treesize of output 18 [2024-11-08 17:46:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 17:46:40,675 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:46:40,675 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:46:40,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858974372] [2024-11-08 17:46:40,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [858974372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:46:40,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:46:40,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:46:40,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244123550] [2024-11-08 17:46:40,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:46:40,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:46:40,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:46:40,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:46:40,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:46:40,678 INFO L87 Difference]: Start difference. First operand 112 states and 147 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:41,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:41,887 INFO L93 Difference]: Finished difference Result 306 states and 402 transitions. [2024-11-08 17:46:41,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:46:41,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 131 [2024-11-08 17:46:41,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:41,889 INFO L225 Difference]: With dead ends: 306 [2024-11-08 17:46:41,889 INFO L226 Difference]: Without dead ends: 197 [2024-11-08 17:46:41,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:46:41,891 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 306 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:41,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 390 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 17:46:41,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-08 17:46:41,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 112. [2024-11-08 17:46:41,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 95 states have internal predecessors, (118), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:46:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 146 transitions. [2024-11-08 17:46:41,905 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 146 transitions. Word has length 131 [2024-11-08 17:46:41,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:41,906 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 146 transitions. [2024-11-08 17:46:41,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:41,907 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 146 transitions. [2024-11-08 17:46:41,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 17:46:41,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:41,908 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:41,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:42,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:42,109 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:42,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:42,109 INFO L85 PathProgramCache]: Analyzing trace with hash 521784031, now seen corresponding path program 1 times [2024-11-08 17:46:42,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:46:42,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146672285] [2024-11-08 17:46:42,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:42,110 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 17:46:42,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:46:42,111 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:42,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:42,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:46:42,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:42,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-08 17:46:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 17:46:42,744 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:46:42,744 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:46:42,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146672285] [2024-11-08 17:46:42,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146672285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:46:42,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:46:42,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:46:42,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022944579] [2024-11-08 17:46:42,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:46:42,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:46:42,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:46:42,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:46:42,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:46:42,748 INFO L87 Difference]: Start difference. First operand 112 states and 146 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:43,204 INFO L93 Difference]: Finished difference Result 283 states and 371 transitions. [2024-11-08 17:46:43,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:46:43,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 131 [2024-11-08 17:46:43,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:43,207 INFO L225 Difference]: With dead ends: 283 [2024-11-08 17:46:43,207 INFO L226 Difference]: Without dead ends: 174 [2024-11-08 17:46:43,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 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 17:46:43,208 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 117 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:43,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 822 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:46:43,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-08 17:46:43,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 115. [2024-11-08 17:46:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 98 states have internal predecessors, (121), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:46:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 149 transitions. [2024-11-08 17:46:43,223 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 149 transitions. Word has length 131 [2024-11-08 17:46:43,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:43,224 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 149 transitions. [2024-11-08 17:46:43,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 149 transitions. [2024-11-08 17:46:43,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 17:46:43,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:43,226 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:43,236 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:43,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:43,427 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:43,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:43,427 INFO L85 PathProgramCache]: Analyzing trace with hash -752502430, now seen corresponding path program 1 times [2024-11-08 17:46:43,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:46:43,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275020677] [2024-11-08 17:46:43,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:43,428 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 17:46:43,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:46:43,430 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:43,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:43,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:46:43,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:43,880 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 13 [2024-11-08 17:46:43,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-08 17:46:44,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:44,035 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 41 treesize of output 17 [2024-11-08 17:46:44,080 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 17:46:44,080 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:46:44,081 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:46:44,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275020677] [2024-11-08 17:46:44,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275020677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:46:44,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:46:44,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:46:44,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689375306] [2024-11-08 17:46:44,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:46:44,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:46:44,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:46:44,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:46:44,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:46:44,083 INFO L87 Difference]: Start difference. First operand 115 states and 149 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:45,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:45,228 INFO L93 Difference]: Finished difference Result 315 states and 409 transitions. [2024-11-08 17:46:45,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:46:45,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 133 [2024-11-08 17:46:45,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:45,230 INFO L225 Difference]: With dead ends: 315 [2024-11-08 17:46:45,230 INFO L226 Difference]: Without dead ends: 203 [2024-11-08 17:46:45,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:46:45,231 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 231 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:45,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 637 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 17:46:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-08 17:46:45,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 115. [2024-11-08 17:46:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 98 states have internal predecessors, (120), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:46:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 148 transitions. [2024-11-08 17:46:45,250 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 148 transitions. Word has length 133 [2024-11-08 17:46:45,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:45,250 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 148 transitions. [2024-11-08 17:46:45,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:45,250 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 148 transitions. [2024-11-08 17:46:45,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 17:46:45,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:45,252 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:45,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:45,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:45,457 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:45,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:45,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1449818632, now seen corresponding path program 1 times [2024-11-08 17:46:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:46:45,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471844401] [2024-11-08 17:46:45,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:45,458 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 17:46:45,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:46:45,459 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:45,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:45,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:46:45,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:45,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-08 17:46:46,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-08 17:46:46,071 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 17:46:46,100 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 17:46:46,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:46:46,101 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:46:46,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471844401] [2024-11-08 17:46:46,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471844401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:46:46,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:46:46,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:46:46,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420781188] [2024-11-08 17:46:46,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:46:46,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:46:46,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:46:46,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:46:46,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:46:46,103 INFO L87 Difference]: Start difference. First operand 115 states and 148 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:46,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:46,792 INFO L93 Difference]: Finished difference Result 286 states and 371 transitions. [2024-11-08 17:46:46,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:46:46,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 133 [2024-11-08 17:46:46,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:46,794 INFO L225 Difference]: With dead ends: 286 [2024-11-08 17:46:46,794 INFO L226 Difference]: Without dead ends: 174 [2024-11-08 17:46:46,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:46:46,796 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 110 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:46,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 452 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:46:46,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-08 17:46:46,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 115. [2024-11-08 17:46:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.2142857142857142) internal successors, (119), 98 states have internal predecessors, (119), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:46:46,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 147 transitions. [2024-11-08 17:46:46,812 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 147 transitions. Word has length 133 [2024-11-08 17:46:46,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:46,812 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 147 transitions. [2024-11-08 17:46:46,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:46,813 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 147 transitions. [2024-11-08 17:46:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 17:46:46,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:46,814 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:46,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:46:47,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:47,015 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:47,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:47,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1191653194, now seen corresponding path program 1 times [2024-11-08 17:46:47,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:46:47,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [79148178] [2024-11-08 17:46:47,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:47,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 17:46:47,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:46:47,017 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:47,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:47,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 17:46:47,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:47,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 17:46:48,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 32 [2024-11-08 17:46:48,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 65 [2024-11-08 17:46:48,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:48,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 56 [2024-11-08 17:46:48,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:48,977 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 219 treesize of output 75 [2024-11-08 17:46:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-08 17:46:49,090 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:46:49,322 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:46:49,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [79148178] [2024-11-08 17:46:49,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [79148178] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:46:49,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629456066] [2024-11-08 17:46:49,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:49,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:46:49,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:46:49,324 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:46:49,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-08 17:46:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:50,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 17:46:50,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:50,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 32 [2024-11-08 17:46:50,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 65 [2024-11-08 17:46:50,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:50,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 56 [2024-11-08 17:46:51,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:51,162 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 219 treesize of output 75 [2024-11-08 17:46:51,185 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-08 17:46:51,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:46:51,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629456066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:46:51,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:46:51,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 15 [2024-11-08 17:46:51,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946509360] [2024-11-08 17:46:51,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:46:51,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 17:46:51,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:46:51,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 17:46:51,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:46:51,360 INFO L87 Difference]: Start difference. First operand 115 states and 147 transitions. Second operand has 16 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-08 17:46:56,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:56,519 INFO L93 Difference]: Finished difference Result 456 states and 580 transitions. [2024-11-08 17:46:56,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 17:46:56,520 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 133 [2024-11-08 17:46:56,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:56,521 INFO L225 Difference]: With dead ends: 456 [2024-11-08 17:46:56,522 INFO L226 Difference]: Without dead ends: 344 [2024-11-08 17:46:56,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2024-11-08 17:46:56,523 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 486 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:56,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1372 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-08 17:46:56,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-08 17:46:56,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2024-11-08 17:46:56,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 193 states have (on average 1.2072538860103628) internal successors, (233), 194 states have internal predecessors, (233), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 17:46:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 289 transitions. [2024-11-08 17:46:56,563 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 289 transitions. Word has length 133 [2024-11-08 17:46:56,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:56,564 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 289 transitions. [2024-11-08 17:46:56,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-08 17:46:56,565 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 289 transitions. [2024-11-08 17:46:56,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 17:46:56,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:56,566 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:56,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-08 17:46:56,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:46:56,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:56,967 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:56,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:56,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1326459698, now seen corresponding path program 1 times [2024-11-08 17:46:56,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:46:56,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667980124] [2024-11-08 17:46:56,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:56,968 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 17:46:56,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:46:56,971 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:56,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:57,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 17:46:57,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:57,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 17:46:57,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-11-08 17:46:57,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:57,734 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 57 treesize of output 27 [2024-11-08 17:46:57,799 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 17:46:57,799 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:46:57,799 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:46:57,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667980124] [2024-11-08 17:46:57,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667980124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:46:57,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:46:57,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:46:57,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082536714] [2024-11-08 17:46:57,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:46:57,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:46:57,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:46:57,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:46:57,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:46:57,802 INFO L87 Difference]: Start difference. First operand 227 states and 289 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:58,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:58,161 INFO L93 Difference]: Finished difference Result 306 states and 390 transitions. [2024-11-08 17:46:58,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:46:58,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 133 [2024-11-08 17:46:58,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:58,165 INFO L225 Difference]: With dead ends: 306 [2024-11-08 17:46:58,165 INFO L226 Difference]: Without dead ends: 304 [2024-11-08 17:46:58,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 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 17:46:58,166 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 102 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:58,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 796 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:46:58,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-08 17:46:58,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 302. [2024-11-08 17:46:58,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 251 states have (on average 1.199203187250996) internal successors, (301), 254 states have internal predecessors, (301), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 17:46:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 385 transitions. [2024-11-08 17:46:58,238 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 385 transitions. Word has length 133 [2024-11-08 17:46:58,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:58,239 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 385 transitions. [2024-11-08 17:46:58,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 385 transitions. [2024-11-08 17:46:58,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 17:46:58,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:58,241 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:58,252 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:46:58,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:58,442 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:58,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:58,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1328306740, now seen corresponding path program 1 times [2024-11-08 17:46:58,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:46:58,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140532092] [2024-11-08 17:46:58,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:58,443 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 17:46:58,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:46:58,445 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:46:58,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 [2024-11-08 17:46:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:59,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 17:46:59,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:59,085 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 21 treesize of output 17 [2024-11-08 17:46:59,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2024-11-08 17:46:59,371 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 17:46:59,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:46:59,372 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:46:59,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140532092] [2024-11-08 17:46:59,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140532092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:46:59,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:46:59,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:46:59,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604862917] [2024-11-08 17:46:59,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:46:59,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:46:59,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:46:59,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:46:59,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:46:59,375 INFO L87 Difference]: Start difference. First operand 302 states and 385 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:59,930 INFO L93 Difference]: Finished difference Result 560 states and 705 transitions. [2024-11-08 17:46:59,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:46:59,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 133 [2024-11-08 17:46:59,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:59,933 INFO L225 Difference]: With dead ends: 560 [2024-11-08 17:46:59,933 INFO L226 Difference]: Without dead ends: 322 [2024-11-08 17:46:59,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:46:59,934 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 183 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:59,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 625 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:46:59,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-08 17:46:59,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 318. [2024-11-08 17:46:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 261 states have (on average 1.1839080459770115) internal successors, (309), 264 states have internal predecessors, (309), 46 states have call successors, (46), 10 states have call predecessors, (46), 10 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 17:46:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 401 transitions. [2024-11-08 17:46:59,986 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 401 transitions. Word has length 133 [2024-11-08 17:46:59,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:59,991 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 401 transitions. [2024-11-08 17:46:59,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 17:46:59,991 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 401 transitions. [2024-11-08 17:46:59,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 17:46:59,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:59,993 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:47:00,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:47:00,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:47:00,193 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:47:00,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:47:00,194 INFO L85 PathProgramCache]: Analyzing trace with hash -511594824, now seen corresponding path program 1 times [2024-11-08 17:47:00,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:47:00,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125351631] [2024-11-08 17:47:00,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:47:00,195 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 17:47:00,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:47:00,197 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 17:47:00,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba44eaa-4c18-4d03-a532-9f1f550afc5f/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 (21)] Waiting until timeout for monitored process