./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.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_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 f2cb36cc0f0fd05117e5167c95d28ca6a711637d120a8a77c2820981a0c818fc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:42:24,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:42:24,213 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:42:24,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:42:24,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:42:24,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:42:24,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:42:24,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:42:24,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:42:24,262 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:42:24,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:42:24,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:42:24,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:42:24,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:42:24,264 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:42:24,264 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:42:24,265 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:42:24,265 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:42:24,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:42:24,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:42:24,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:42:24,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:42:24,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:42:24,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:42:24,272 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:42:24,272 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:42:24,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:42:24,272 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:42:24,273 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:42:24,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:42:24,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:42:24,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:42:24,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:42:24,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:42:24,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:42:24,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:42:24,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:42:24,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:42:24,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:42:24,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:42:24,280 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:42:24,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:42:24,283 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_51e319ad-a601-4486-8a0e-78ba0c676ca8/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_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 -> f2cb36cc0f0fd05117e5167c95d28ca6a711637d120a8a77c2820981a0c818fc [2024-11-08 16:42:24,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:42:24,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:42:24,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:42:24,628 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:42:24,629 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:42:24,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i Unable to find full path for "g++" [2024-11-08 16:42:26,528 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:42:26,743 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:42:26,745 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i [2024-11-08 16:42:26,754 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/data/97c2e48d3/6aed80db9d344dab8d21e0e58ac4c4b2/FLAGf68719fd6 [2024-11-08 16:42:26,772 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/data/97c2e48d3/6aed80db9d344dab8d21e0e58ac4c4b2 [2024-11-08 16:42:26,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:42:26,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:42:26,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:42:26,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:42:26,786 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:42:26,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:42:26" (1/1) ... [2024-11-08 16:42:26,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2940e227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:26, skipping insertion in model container [2024-11-08 16:42:26,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:42:26" (1/1) ... [2024-11-08 16:42:26,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:42:27,082 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_51e319ad-a601-4486-8a0e-78ba0c676ca8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i[916,929] [2024-11-08 16:42:27,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:42:27,202 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:42:27,215 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_51e319ad-a601-4486-8a0e-78ba0c676ca8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i[916,929] [2024-11-08 16:42:27,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:42:27,295 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:42:27,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:27 WrapperNode [2024-11-08 16:42:27,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:42:27,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:42:27,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:42:27,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:42:27,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:27" (1/1) ... [2024-11-08 16:42:27,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:27" (1/1) ... [2024-11-08 16:42:27,379 INFO L138 Inliner]: procedures = 29, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 523 [2024-11-08 16:42:27,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:42:27,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:42:27,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:42:27,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:42:27,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:27" (1/1) ... [2024-11-08 16:42:27,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:27" (1/1) ... [2024-11-08 16:42:27,398 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:27" (1/1) ... [2024-11-08 16:42:27,424 INFO L175 MemorySlicer]: Split 132 memory accesses to 7 slices as follows [2, 8, 39, 12, 5, 41, 25]. 31 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 3, 1, 2, 2]. The 16 writes are split as follows [0, 1, 6, 3, 2, 2, 2]. [2024-11-08 16:42:27,425 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:27" (1/1) ... [2024-11-08 16:42:27,425 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:27" (1/1) ... [2024-11-08 16:42:27,446 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:27" (1/1) ... [2024-11-08 16:42:27,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:27" (1/1) ... [2024-11-08 16:42:27,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:27" (1/1) ... [2024-11-08 16:42:27,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:27" (1/1) ... [2024-11-08 16:42:27,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:42:27,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:42:27,481 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:42:27,481 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:42:27,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:27" (1/1) ... [2024-11-08 16:42:27,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:42:27,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:42:27,523 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:42:27,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:42:27,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:42:27,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-08 16:42:27,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-08 16:42:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-08 16:42:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-08 16:42:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-08 16:42:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-08 16:42:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-08 16:42:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 16:42:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 16:42:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 16:42:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 16:42:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 16:42:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-08 16:42:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-08 16:42:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-08 16:42:27,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-08 16:42:27,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-08 16:42:27,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-08 16:42:27,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-08 16:42:27,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-08 16:42:27,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-08 16:42:27,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 16:42:27,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 16:42:27,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 16:42:27,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 16:42:27,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 16:42:27,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-08 16:42:27,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-08 16:42:27,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-08 16:42:27,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-08 16:42:27,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-08 16:42:27,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-08 16:42:27,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-08 16:42:27,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-08 16:42:27,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-08 16:42:27,574 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:42:27,574 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:42:27,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:42:27,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 16:42:27,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 16:42:27,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 16:42:27,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 16:42:27,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-08 16:42:27,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-08 16:42:27,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:42:27,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:42:27,787 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:42:27,790 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:42:28,412 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2024-11-08 16:42:28,413 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:42:28,437 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:42:28,437 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:42:28,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:42:28 BoogieIcfgContainer [2024-11-08 16:42:28,438 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:42:28,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:42:28,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:42:28,446 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:42:28,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:42:26" (1/3) ... [2024-11-08 16:42:28,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34938275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:42:28, skipping insertion in model container [2024-11-08 16:42:28,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:27" (2/3) ... [2024-11-08 16:42:28,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34938275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:42:28, skipping insertion in model container [2024-11-08 16:42:28,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:42:28" (3/3) ... [2024-11-08 16:42:28,451 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-70.i [2024-11-08 16:42:28,470 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:42:28,470 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:42:28,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:42:28,554 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;@13ca408f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:42:28,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:42:28,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 96 states have (on average 1.4375) internal successors, (138), 97 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:42:28,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 16:42:28,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:28,573 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:42:28,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:28,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:28,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1588853140, now seen corresponding path program 1 times [2024-11-08 16:42:28,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:28,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367100175] [2024-11-08 16:42:28,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:28,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:42:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:42:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:42:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:42:29,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:29,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367100175] [2024-11-08 16:42:29,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367100175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:29,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:29,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:42:29,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696746157] [2024-11-08 16:42:29,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:29,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:42:29,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:29,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:42:29,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:42:29,142 INFO L87 Difference]: Start difference. First operand has 111 states, 96 states have (on average 1.4375) internal successors, (138), 97 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:42:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:29,181 INFO L93 Difference]: Finished difference Result 215 states and 330 transitions. [2024-11-08 16:42:29,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:42:29,183 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2024-11-08 16:42:29,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:29,194 INFO L225 Difference]: With dead ends: 215 [2024-11-08 16:42:29,194 INFO L226 Difference]: Without dead ends: 107 [2024-11-08 16:42:29,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:42:29,206 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:29,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:42:29,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-08 16:42:29,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-08 16:42:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:42:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2024-11-08 16:42:29,275 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 116 [2024-11-08 16:42:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:29,275 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2024-11-08 16:42:29,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:42:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2024-11-08 16:42:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 16:42:29,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:29,283 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:42:29,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:42:29,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:29,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:29,286 INFO L85 PathProgramCache]: Analyzing trace with hash -722528732, now seen corresponding path program 1 times [2024-11-08 16:42:29,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:29,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768816560] [2024-11-08 16:42:29,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:29,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:42:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:42:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:42:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:29,785 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:42:29,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:29,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768816560] [2024-11-08 16:42:29,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768816560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:29,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:29,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:42:29,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979546366] [2024-11-08 16:42:29,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:29,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:42:29,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:29,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:42:29,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:42:29,794 INFO L87 Difference]: Start difference. First operand 107 states and 155 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:42:29,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:29,868 INFO L93 Difference]: Finished difference Result 213 states and 310 transitions. [2024-11-08 16:42:29,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:42:29,872 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2024-11-08 16:42:29,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:29,874 INFO L225 Difference]: With dead ends: 213 [2024-11-08 16:42:29,874 INFO L226 Difference]: Without dead ends: 109 [2024-11-08 16:42:29,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:42:29,895 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:29,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:42:29,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-08 16:42:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-08 16:42:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:42:29,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-08 16:42:29,912 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 116 [2024-11-08 16:42:29,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:29,914 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-08 16:42:29,914 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:42:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-08 16:42:29,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 16:42:29,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:29,918 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:42:29,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:42:29,918 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:29,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:29,919 INFO L85 PathProgramCache]: Analyzing trace with hash -799429530, now seen corresponding path program 1 times [2024-11-08 16:42:29,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:29,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144510599] [2024-11-08 16:42:29,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:29,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:42:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:42:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:42:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,360 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:42:30,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:30,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144510599] [2024-11-08 16:42:30,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144510599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:30,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:30,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:42:30,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244542294] [2024-11-08 16:42:30,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:30,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:42:30,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:30,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:42:30,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:42:30,366 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:42:30,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:30,411 INFO L93 Difference]: Finished difference Result 217 states and 314 transitions. [2024-11-08 16:42:30,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:42:30,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-11-08 16:42:30,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:30,414 INFO L225 Difference]: With dead ends: 217 [2024-11-08 16:42:30,414 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 16:42:30,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:42:30,416 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:30,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:42:30,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 16:42:30,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-08 16:42:30,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:42:30,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-08 16:42:30,433 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 116 [2024-11-08 16:42:30,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:30,434 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-08 16:42:30,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:42:30,434 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-08 16:42:30,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 16:42:30,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:30,441 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:42:30,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:42:30,441 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:30,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:30,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1079200959, now seen corresponding path program 1 times [2024-11-08 16:42:30,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:30,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285806398] [2024-11-08 16:42:30,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:30,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:42:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:42:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:42:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:42:30,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:30,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285806398] [2024-11-08 16:42:30,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285806398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:30,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:30,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:42:30,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784664368] [2024-11-08 16:42:30,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:30,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:42:30,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:30,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:42:30,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:42:30,699 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:42:30,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:30,752 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-11-08 16:42:30,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:42:30,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-08 16:42:30,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:30,757 INFO L225 Difference]: With dead ends: 222 [2024-11-08 16:42:30,757 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 16:42:30,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:42:30,759 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:30,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:42:30,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 16:42:30,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-08 16:42:30,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:42:30,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-11-08 16:42:30,779 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 118 [2024-11-08 16:42:30,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:30,780 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-11-08 16:42:30,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:42:30,780 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-11-08 16:42:30,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 16:42:30,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:30,785 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:42:30,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:42:30,785 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:30,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:30,786 INFO L85 PathProgramCache]: Analyzing trace with hash 695806403, now seen corresponding path program 1 times [2024-11-08 16:42:30,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:30,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683502458] [2024-11-08 16:42:30,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:30,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:42:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:42:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:30,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:31,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:42:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:31,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:31,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:31,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:31,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:31,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:31,024 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:42:31,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:31,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683502458] [2024-11-08 16:42:31,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683502458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:31,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:31,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:42:31,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303115555] [2024-11-08 16:42:31,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:31,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:42:31,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:31,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:42:31,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:42:31,027 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:42:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:31,064 INFO L93 Difference]: Finished difference Result 226 states and 323 transitions. [2024-11-08 16:42:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:42:31,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-08 16:42:31,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:31,068 INFO L225 Difference]: With dead ends: 226 [2024-11-08 16:42:31,068 INFO L226 Difference]: Without dead ends: 116 [2024-11-08 16:42:31,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:42:31,073 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:31,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:42:31,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-08 16:42:31,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-08 16:42:31,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 101 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:42:31,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2024-11-08 16:42:31,090 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 118 [2024-11-08 16:42:31,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:31,091 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2024-11-08 16:42:31,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:42:31,091 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2024-11-08 16:42:31,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 16:42:31,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:31,096 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:42:31,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:42:31,096 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:31,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:31,097 INFO L85 PathProgramCache]: Analyzing trace with hash 697653445, now seen corresponding path program 1 times [2024-11-08 16:42:31,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:31,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115347810] [2024-11-08 16:42:31,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:31,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:31,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:31,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:31,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:42:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:31,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:31,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:42:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:31,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:31,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:42:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:31,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:31,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:31,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:31,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:31,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:31,787 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:42:31,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:31,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115347810] [2024-11-08 16:42:31,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115347810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:31,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:31,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:42:31,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793617409] [2024-11-08 16:42:31,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:31,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:42:31,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:31,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:42:31,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:42:31,791 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:42:31,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:31,920 INFO L93 Difference]: Finished difference Result 286 states and 406 transitions. [2024-11-08 16:42:31,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:42:31,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2024-11-08 16:42:31,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:31,923 INFO L225 Difference]: With dead ends: 286 [2024-11-08 16:42:31,923 INFO L226 Difference]: Without dead ends: 174 [2024-11-08 16:42:31,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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 16:42:31,926 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 75 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:31,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 716 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:42:31,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-08 16:42:31,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 118. [2024-11-08 16:42:31,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 104 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:42:31,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2024-11-08 16:42:31,946 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 118 [2024-11-08 16:42:31,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:31,947 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2024-11-08 16:42:31,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:42:31,947 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2024-11-08 16:42:31,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 16:42:31,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:31,951 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:42:31,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:42:31,952 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:31,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:31,952 INFO L85 PathProgramCache]: Analyzing trace with hash 900241669, now seen corresponding path program 1 times [2024-11-08 16:42:31,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:31,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926383911] [2024-11-08 16:42:31,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:31,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:42:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:42:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:42:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,321 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:42:32,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:32,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926383911] [2024-11-08 16:42:32,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926383911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:32,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:32,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:42:32,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149740519] [2024-11-08 16:42:32,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:32,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:42:32,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:32,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:42:32,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:42:32,323 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:42:32,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:32,419 INFO L93 Difference]: Finished difference Result 233 states and 329 transitions. [2024-11-08 16:42:32,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:42:32,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-08 16:42:32,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:32,422 INFO L225 Difference]: With dead ends: 233 [2024-11-08 16:42:32,422 INFO L226 Difference]: Without dead ends: 118 [2024-11-08 16:42:32,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:42:32,423 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:32,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 402 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:42:32,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-08 16:42:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-08 16:42:32,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 104 states have (on average 1.3557692307692308) internal successors, (141), 104 states have internal predecessors, (141), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:42:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 165 transitions. [2024-11-08 16:42:32,435 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 165 transitions. Word has length 118 [2024-11-08 16:42:32,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:32,436 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 165 transitions. [2024-11-08 16:42:32,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:42:32,436 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 165 transitions. [2024-11-08 16:42:32,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 16:42:32,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:32,438 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:42:32,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:42:32,438 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:32,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:32,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1794324514, now seen corresponding path program 1 times [2024-11-08 16:42:32,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:32,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721253037] [2024-11-08 16:42:32,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:32,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:42:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:42:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:42:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:42:32,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:32,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721253037] [2024-11-08 16:42:32,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721253037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:32,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:32,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:42:32,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040038339] [2024-11-08 16:42:32,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:32,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:42:32,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:32,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:42:32,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:42:32,887 INFO L87 Difference]: Start difference. First operand 118 states and 165 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:42:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:32,978 INFO L93 Difference]: Finished difference Result 233 states and 327 transitions. [2024-11-08 16:42:32,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:42:32,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-11-08 16:42:32,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:32,981 INFO L225 Difference]: With dead ends: 233 [2024-11-08 16:42:32,981 INFO L226 Difference]: Without dead ends: 118 [2024-11-08 16:42:32,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:42:32,983 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:32,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:42:32,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-08 16:42:32,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-08 16:42:32,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 104 states have (on average 1.3461538461538463) internal successors, (140), 104 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:42:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2024-11-08 16:42:32,999 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 120 [2024-11-08 16:42:32,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:32,999 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2024-11-08 16:42:33,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:42:33,000 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2024-11-08 16:42:33,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 16:42:33,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:33,001 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:42:33,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:42:33,001 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:33,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:33,002 INFO L85 PathProgramCache]: Analyzing trace with hash 811699040, now seen corresponding path program 1 times [2024-11-08 16:42:33,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:33,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349259340] [2024-11-08 16:42:33,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:33,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:33,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:33,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:33,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:42:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:33,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:33,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:42:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:33,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:33,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:42:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:33,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:33,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:33,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:33,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:33,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:42:33,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:33,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349259340] [2024-11-08 16:42:33,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349259340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:33,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:33,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:42:33,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867012196] [2024-11-08 16:42:33,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:33,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:42:33,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:33,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:42:33,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:42:33,708 INFO L87 Difference]: Start difference. First operand 118 states and 164 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:42:33,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:33,788 INFO L93 Difference]: Finished difference Result 285 states and 394 transitions. [2024-11-08 16:42:33,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:42:33,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2024-11-08 16:42:33,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:33,790 INFO L225 Difference]: With dead ends: 285 [2024-11-08 16:42:33,790 INFO L226 Difference]: Without dead ends: 170 [2024-11-08 16:42:33,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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 16:42:33,792 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 56 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:33,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 709 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:42:33,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-08 16:42:33,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 133. [2024-11-08 16:42:33,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 119 states have (on average 1.3361344537815125) internal successors, (159), 119 states have internal predecessors, (159), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:42:33,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 183 transitions. [2024-11-08 16:42:33,799 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 183 transitions. Word has length 120 [2024-11-08 16:42:33,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:33,799 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 183 transitions. [2024-11-08 16:42:33,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:42:33,813 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 183 transitions. [2024-11-08 16:42:33,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:42:33,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:33,814 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:42:33,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:42:33,815 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:33,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:33,815 INFO L85 PathProgramCache]: Analyzing trace with hash -612305399, now seen corresponding path program 1 times [2024-11-08 16:42:33,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:33,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196632274] [2024-11-08 16:42:33,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:33,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:42:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:42:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:42:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:42:34,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:34,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196632274] [2024-11-08 16:42:34,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196632274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:34,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:34,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:42:34,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510703438] [2024-11-08 16:42:34,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:34,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:42:34,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:34,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:42:34,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:42:34,071 INFO L87 Difference]: Start difference. First operand 133 states and 183 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:42:34,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:34,107 INFO L93 Difference]: Finished difference Result 266 states and 367 transitions. [2024-11-08 16:42:34,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:42:34,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-08 16:42:34,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:34,109 INFO L225 Difference]: With dead ends: 266 [2024-11-08 16:42:34,109 INFO L226 Difference]: Without dead ends: 136 [2024-11-08 16:42:34,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:42:34,110 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:34,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 583 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:42:34,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-08 16:42:34,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-08 16:42:34,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 122 states have internal predecessors, (162), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:42:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 186 transitions. [2024-11-08 16:42:34,117 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 186 transitions. Word has length 121 [2024-11-08 16:42:34,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:34,117 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 186 transitions. [2024-11-08 16:42:34,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:42:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 186 transitions. [2024-11-08 16:42:34,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:42:34,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:34,119 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:42:34,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 16:42:34,120 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:34,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:34,120 INFO L85 PathProgramCache]: Analyzing trace with hash 398811851, now seen corresponding path program 1 times [2024-11-08 16:42:34,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:34,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268551661] [2024-11-08 16:42:34,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:34,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:42:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:42:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:42:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:42:34,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:34,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268551661] [2024-11-08 16:42:34,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268551661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:34,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:34,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:42:34,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877615079] [2024-11-08 16:42:34,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:34,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:42:34,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:34,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:42:34,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:42:34,641 INFO L87 Difference]: Start difference. First operand 136 states and 186 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:42:34,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:34,731 INFO L93 Difference]: Finished difference Result 307 states and 419 transitions. [2024-11-08 16:42:34,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:42:34,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2024-11-08 16:42:34,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:34,733 INFO L225 Difference]: With dead ends: 307 [2024-11-08 16:42:34,734 INFO L226 Difference]: Without dead ends: 174 [2024-11-08 16:42:34,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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 16:42:34,735 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 51 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:34,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 757 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:42:34,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-08 16:42:34,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 140. [2024-11-08 16:42:34,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 126 states have (on average 1.3174603174603174) internal successors, (166), 126 states have internal predecessors, (166), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:42:34,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2024-11-08 16:42:34,741 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 121 [2024-11-08 16:42:34,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:34,742 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2024-11-08 16:42:34,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:42:34,742 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2024-11-08 16:42:34,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 16:42:34,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:34,744 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:42:34,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 16:42:34,744 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:34,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:34,745 INFO L85 PathProgramCache]: Analyzing trace with hash -266913851, now seen corresponding path program 1 times [2024-11-08 16:42:34,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:34,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288168156] [2024-11-08 16:42:34,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:34,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:36,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:36,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:36,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:42:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:36,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:36,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:42:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:36,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:36,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:42:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:36,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:36,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:36,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:36,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:36,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:42:36,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:36,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288168156] [2024-11-08 16:42:36,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288168156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:36,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:36,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:42:36,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737408881] [2024-11-08 16:42:36,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:36,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:42:36,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:36,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:42:36,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:42:36,321 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:42:38,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:38,789 INFO L93 Difference]: Finished difference Result 502 states and 688 transitions. [2024-11-08 16:42:38,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 16:42:38,790 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-08 16:42:38,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:38,792 INFO L225 Difference]: With dead ends: 502 [2024-11-08 16:42:38,792 INFO L226 Difference]: Without dead ends: 365 [2024-11-08 16:42:38,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:42:38,794 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 375 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:38,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1862 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 16:42:38,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-08 16:42:38,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 160. [2024-11-08 16:42:38,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 146 states have (on average 1.3287671232876712) internal successors, (194), 146 states have internal predecessors, (194), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:42:38,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 218 transitions. [2024-11-08 16:42:38,803 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 218 transitions. Word has length 122 [2024-11-08 16:42:38,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:38,803 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 218 transitions. [2024-11-08 16:42:38,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:42:38,804 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 218 transitions. [2024-11-08 16:42:38,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 16:42:38,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:38,805 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:42:38,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 16:42:38,805 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:38,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:38,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1287982205, now seen corresponding path program 1 times [2024-11-08 16:42:38,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:38,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080909661] [2024-11-08 16:42:38,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:38,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:39,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:39,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:39,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:42:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:39,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:39,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:42:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:39,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:39,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:42:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:39,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:39,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:39,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:39,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:39,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:42:39,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:39,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080909661] [2024-11-08 16:42:39,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080909661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:39,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:39,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:42:39,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716227660] [2024-11-08 16:42:39,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:39,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:42:39,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:39,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:42:39,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:42:39,351 INFO L87 Difference]: Start difference. First operand 160 states and 218 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:42:39,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:39,560 INFO L93 Difference]: Finished difference Result 420 states and 575 transitions. [2024-11-08 16:42:39,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:42:39,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2024-11-08 16:42:39,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:39,563 INFO L225 Difference]: With dead ends: 420 [2024-11-08 16:42:39,563 INFO L226 Difference]: Without dead ends: 263 [2024-11-08 16:42:39,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:42:39,564 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 124 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:39,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1115 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:42:39,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-08 16:42:39,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 260. [2024-11-08 16:42:39,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 235 states have (on average 1.327659574468085) internal successors, (312), 236 states have internal predecessors, (312), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 16:42:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 356 transitions. [2024-11-08 16:42:39,577 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 356 transitions. Word has length 122 [2024-11-08 16:42:39,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:39,577 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 356 transitions. [2024-11-08 16:42:39,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:42:39,578 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 356 transitions. [2024-11-08 16:42:39,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 16:42:39,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:39,579 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:42:39,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 16:42:39,580 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:39,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:39,580 INFO L85 PathProgramCache]: Analyzing trace with hash 434686023, now seen corresponding path program 1 times [2024-11-08 16:42:39,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:39,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479381706] [2024-11-08 16:42:39,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:39,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:40,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:40,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:40,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:42:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:40,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:40,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:42:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:40,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:40,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:42:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:40,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:40,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:40,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:40,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:40,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:40,074 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:42:40,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:40,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479381706] [2024-11-08 16:42:40,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479381706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:40,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:40,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:42:40,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907123470] [2024-11-08 16:42:40,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:40,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:42:40,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:40,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:42:40,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:42:40,077 INFO L87 Difference]: Start difference. First operand 260 states and 356 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:42:40,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:40,293 INFO L93 Difference]: Finished difference Result 597 states and 819 transitions. [2024-11-08 16:42:40,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:42:40,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2024-11-08 16:42:40,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:40,297 INFO L225 Difference]: With dead ends: 597 [2024-11-08 16:42:40,297 INFO L226 Difference]: Without dead ends: 340 [2024-11-08 16:42:40,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:42:40,299 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 126 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:40,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 791 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:42:40,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-08 16:42:40,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 250. [2024-11-08 16:42:40,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 225 states have (on average 1.32) internal successors, (297), 226 states have internal predecessors, (297), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 16:42:40,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 341 transitions. [2024-11-08 16:42:40,316 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 341 transitions. Word has length 122 [2024-11-08 16:42:40,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:40,316 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 341 transitions. [2024-11-08 16:42:40,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:42:40,317 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 341 transitions. [2024-11-08 16:42:40,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 16:42:40,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:40,319 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:42:40,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 16:42:40,319 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:40,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:40,320 INFO L85 PathProgramCache]: Analyzing trace with hash -586382331, now seen corresponding path program 1 times [2024-11-08 16:42:40,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:40,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651438047] [2024-11-08 16:42:40,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:40,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:42:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:42:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:42:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,665 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:42:41,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:41,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651438047] [2024-11-08 16:42:41,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651438047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:41,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:41,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:42:41,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643529627] [2024-11-08 16:42:41,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:41,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:42:41,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:41,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:42:41,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:42:41,667 INFO L87 Difference]: Start difference. First operand 250 states and 341 transitions. Second operand has 9 states, 6 states have (on average 10.833333333333334) internal successors, (65), 9 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-08 16:42:42,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:42,241 INFO L93 Difference]: Finished difference Result 587 states and 803 transitions. [2024-11-08 16:42:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 16:42:42,242 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 10.833333333333334) internal successors, (65), 9 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) Word has length 122 [2024-11-08 16:42:42,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:42,245 INFO L225 Difference]: With dead ends: 587 [2024-11-08 16:42:42,245 INFO L226 Difference]: Without dead ends: 340 [2024-11-08 16:42:42,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:42:42,248 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 132 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:42,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1539 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:42:42,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-08 16:42:42,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 249. [2024-11-08 16:42:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 224 states have (on average 1.3169642857142858) internal successors, (295), 225 states have internal predecessors, (295), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 16:42:42,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 339 transitions. [2024-11-08 16:42:42,269 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 339 transitions. Word has length 122 [2024-11-08 16:42:42,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:42,270 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 339 transitions. [2024-11-08 16:42:42,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 10.833333333333334) internal successors, (65), 9 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-08 16:42:42,270 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 339 transitions. [2024-11-08 16:42:42,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 16:42:42,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:42,273 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:42:42,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 16:42:42,273 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:42,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:42,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1336845703, now seen corresponding path program 1 times [2024-11-08 16:42:42,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:42,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148335822] [2024-11-08 16:42:42,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:42,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:42:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:42:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:42:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,459 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:42:45,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:45,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148335822] [2024-11-08 16:42:45,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148335822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:45,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:45,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 16:42:45,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424127475] [2024-11-08 16:42:45,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:45,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:42:45,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:45,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:42:45,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:42:45,462 INFO L87 Difference]: Start difference. First operand 249 states and 339 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:42:52,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:52,998 INFO L93 Difference]: Finished difference Result 689 states and 941 transitions. [2024-11-08 16:42:52,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 16:42:52,998 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2024-11-08 16:42:52,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:53,001 INFO L225 Difference]: With dead ends: 689 [2024-11-08 16:42:53,001 INFO L226 Difference]: Without dead ends: 443 [2024-11-08 16:42:53,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-11-08 16:42:53,003 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 251 mSDsluCounter, 2638 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 2984 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:53,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 2984 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-08 16:42:53,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-08 16:42:53,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 261. [2024-11-08 16:42:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 236 states have (on average 1.3177966101694916) internal successors, (311), 237 states have internal predecessors, (311), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 16:42:53,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 355 transitions. [2024-11-08 16:42:53,032 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 355 transitions. Word has length 122 [2024-11-08 16:42:53,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:53,032 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 355 transitions. [2024-11-08 16:42:53,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:42:53,032 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 355 transitions. [2024-11-08 16:42:53,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 16:42:53,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:53,034 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:42:53,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 16:42:53,035 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:53,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:53,035 INFO L85 PathProgramCache]: Analyzing trace with hash 663084762, now seen corresponding path program 1 times [2024-11-08 16:42:53,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:53,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138382111] [2024-11-08 16:42:53,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:53,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:42:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:42:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:42:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,585 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:42:53,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:53,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138382111] [2024-11-08 16:42:53,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138382111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:53,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:53,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:42:53,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328244659] [2024-11-08 16:42:53,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:53,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:42:53,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:53,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:42:53,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:42:53,588 INFO L87 Difference]: Start difference. First operand 261 states and 355 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:42:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:53,969 INFO L93 Difference]: Finished difference Result 702 states and 959 transitions. [2024-11-08 16:42:53,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:42:53,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2024-11-08 16:42:53,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:53,973 INFO L225 Difference]: With dead ends: 702 [2024-11-08 16:42:53,973 INFO L226 Difference]: Without dead ends: 444 [2024-11-08 16:42:53,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:42:53,974 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 137 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:53,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 919 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:42:53,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-08 16:42:54,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 263. [2024-11-08 16:42:54,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 238 states have (on average 1.3067226890756303) internal successors, (311), 239 states have internal predecessors, (311), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 16:42:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 355 transitions. [2024-11-08 16:42:54,003 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 355 transitions. Word has length 123 [2024-11-08 16:42:54,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:54,005 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 355 transitions. [2024-11-08 16:42:54,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:42:54,006 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 355 transitions. [2024-11-08 16:42:54,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 16:42:54,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:54,007 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:42:54,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 16:42:54,008 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:54,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:54,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1321550598, now seen corresponding path program 1 times [2024-11-08 16:42:54,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:54,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345177428] [2024-11-08 16:42:54,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:54,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:42:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:42:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:42:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:42:54,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:54,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345177428] [2024-11-08 16:42:54,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345177428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:54,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:54,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:42:54,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354166219] [2024-11-08 16:42:54,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:54,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:42:54,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:54,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:42:54,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:42:54,352 INFO L87 Difference]: Start difference. First operand 263 states and 355 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:42:54,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:54,514 INFO L93 Difference]: Finished difference Result 785 states and 1062 transitions. [2024-11-08 16:42:54,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:42:54,515 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2024-11-08 16:42:54,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:54,518 INFO L225 Difference]: With dead ends: 785 [2024-11-08 16:42:54,518 INFO L226 Difference]: Without dead ends: 525 [2024-11-08 16:42:54,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:42:54,519 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 136 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:54,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1252 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:42:54,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-08 16:42:54,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 520. [2024-11-08 16:42:54,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 471 states have (on average 1.3099787685774946) internal successors, (617), 473 states have internal predecessors, (617), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 16:42:54,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 705 transitions. [2024-11-08 16:42:54,577 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 705 transitions. Word has length 123 [2024-11-08 16:42:54,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:54,578 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 705 transitions. [2024-11-08 16:42:54,578 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:42:54,578 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 705 transitions. [2024-11-08 16:42:54,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 16:42:54,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:54,580 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:42:54,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 16:42:54,580 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:54,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:54,581 INFO L85 PathProgramCache]: Analyzing trace with hash 812077508, now seen corresponding path program 1 times [2024-11-08 16:42:54,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:54,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137278914] [2024-11-08 16:42:54,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:54,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:42:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:42:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:42:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:42:54,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:54,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137278914] [2024-11-08 16:42:54,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137278914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:54,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:54,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:42:54,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653064889] [2024-11-08 16:42:54,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:54,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:42:54,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:54,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:42:54,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:42:54,986 INFO L87 Difference]: Start difference. First operand 520 states and 705 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:42:55,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:55,111 INFO L93 Difference]: Finished difference Result 1041 states and 1410 transitions. [2024-11-08 16:42:55,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:42:55,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2024-11-08 16:42:55,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:55,115 INFO L225 Difference]: With dead ends: 1041 [2024-11-08 16:42:55,115 INFO L226 Difference]: Without dead ends: 524 [2024-11-08 16:42:55,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:42:55,117 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 61 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:55,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 866 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:42:55,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-11-08 16:42:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 520. [2024-11-08 16:42:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 471 states have (on average 1.2929936305732483) internal successors, (609), 473 states have internal predecessors, (609), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 16:42:55,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 697 transitions. [2024-11-08 16:42:55,170 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 697 transitions. Word has length 123 [2024-11-08 16:42:55,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:55,171 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 697 transitions. [2024-11-08 16:42:55,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:42:55,171 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 697 transitions. [2024-11-08 16:42:55,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 16:42:55,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:55,173 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:42:55,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 16:42:55,173 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:55,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:55,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1107830709, now seen corresponding path program 1 times [2024-11-08 16:42:55,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:55,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527572952] [2024-11-08 16:42:55,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:55,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:56,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:56,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:56,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:42:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:56,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:56,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:42:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:56,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:56,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:42:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:56,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:56,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:56,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:56,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:56,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:42:56,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:56,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527572952] [2024-11-08 16:42:56,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527572952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:56,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:56,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:42:56,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310561828] [2024-11-08 16:42:56,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:56,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:42:56,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:56,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:42:56,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:42:56,640 INFO L87 Difference]: Start difference. First operand 520 states and 697 transitions. Second operand has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:42:57,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:57,564 INFO L93 Difference]: Finished difference Result 1232 states and 1656 transitions. [2024-11-08 16:42:57,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:42:57,565 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2024-11-08 16:42:57,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:57,568 INFO L225 Difference]: With dead ends: 1232 [2024-11-08 16:42:57,568 INFO L226 Difference]: Without dead ends: 715 [2024-11-08 16:42:57,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:42:57,570 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 126 mSDsluCounter, 1726 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:57,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1981 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 16:42:57,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-11-08 16:42:57,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 683. [2024-11-08 16:42:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 606 states have (on average 1.301980198019802) internal successors, (789), 610 states have internal predecessors, (789), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-08 16:42:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 925 transitions. [2024-11-08 16:42:57,680 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 925 transitions. Word has length 124 [2024-11-08 16:42:57,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:57,680 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 925 transitions. [2024-11-08 16:42:57,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:42:57,681 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 925 transitions. [2024-11-08 16:42:57,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 16:42:57,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:57,682 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:42:57,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 16:42:57,683 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:57,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:57,683 INFO L85 PathProgramCache]: Analyzing trace with hash -815082227, now seen corresponding path program 1 times [2024-11-08 16:42:57,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:57,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389256334] [2024-11-08 16:42:57,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:57,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:43:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:43:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:43:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:43:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,241 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:43:00,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:00,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389256334] [2024-11-08 16:43:00,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389256334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:00,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:00,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 16:43:00,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359713982] [2024-11-08 16:43:00,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:00,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 16:43:00,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:00,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 16:43:00,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:43:00,244 INFO L87 Difference]: Start difference. First operand 683 states and 925 transitions. Second operand has 13 states, 10 states have (on average 6.7) internal successors, (67), 13 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-08 16:43:02,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:02,526 INFO L93 Difference]: Finished difference Result 1412 states and 1915 transitions. [2024-11-08 16:43:02,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 16:43:02,527 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 6.7) internal successors, (67), 13 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) Word has length 124 [2024-11-08 16:43:02,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:02,531 INFO L225 Difference]: With dead ends: 1412 [2024-11-08 16:43:02,532 INFO L226 Difference]: Without dead ends: 732 [2024-11-08 16:43:02,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:43:02,534 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 119 mSDsluCounter, 2172 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 2422 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:02,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 2422 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 16:43:02,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-11-08 16:43:02,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 655. [2024-11-08 16:43:02,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 578 states have (on average 1.3044982698961938) internal successors, (754), 582 states have internal predecessors, (754), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-08 16:43:02,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 890 transitions. [2024-11-08 16:43:02,688 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 890 transitions. Word has length 124 [2024-11-08 16:43:02,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:02,689 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 890 transitions. [2024-11-08 16:43:02,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 6.7) internal successors, (67), 13 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-08 16:43:02,689 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 890 transitions. [2024-11-08 16:43:02,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 16:43:02,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:02,691 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:02,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 16:43:02,692 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:02,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:02,692 INFO L85 PathProgramCache]: Analyzing trace with hash 948773257, now seen corresponding path program 1 times [2024-11-08 16:43:02,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:02,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975281598] [2024-11-08 16:43:02,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:02,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:43:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:43:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:43:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:43:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:43:05,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:05,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975281598] [2024-11-08 16:43:05,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975281598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:05,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:05,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 16:43:05,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113606502] [2024-11-08 16:43:05,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:05,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 16:43:05,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:05,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 16:43:05,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:43:05,260 INFO L87 Difference]: Start difference. First operand 655 states and 890 transitions. Second operand has 15 states, 13 states have (on average 5.230769230769231) internal successors, (68), 15 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:43:10,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:10,768 INFO L93 Difference]: Finished difference Result 1699 states and 2310 transitions. [2024-11-08 16:43:10,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 16:43:10,769 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.230769230769231) internal successors, (68), 15 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 125 [2024-11-08 16:43:10,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:10,775 INFO L225 Difference]: With dead ends: 1699 [2024-11-08 16:43:10,775 INFO L226 Difference]: Without dead ends: 1047 [2024-11-08 16:43:10,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2024-11-08 16:43:10,778 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 616 mSDsluCounter, 2569 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 2901 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:10,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 2901 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-08 16:43:10,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2024-11-08 16:43:10,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 697. [2024-11-08 16:43:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 620 states have (on average 1.3) internal successors, (806), 624 states have internal predecessors, (806), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-08 16:43:10,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 942 transitions. [2024-11-08 16:43:10,912 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 942 transitions. Word has length 125 [2024-11-08 16:43:10,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:10,913 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 942 transitions. [2024-11-08 16:43:10,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.230769230769231) internal successors, (68), 15 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:43:10,914 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 942 transitions. [2024-11-08 16:43:10,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 16:43:10,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:10,915 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:10,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 16:43:10,916 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:10,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:10,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1650373131, now seen corresponding path program 1 times [2024-11-08 16:43:10,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:10,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614711378] [2024-11-08 16:43:10,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:10,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:43:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:43:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:43:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:43:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,336 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:43:11,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:11,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614711378] [2024-11-08 16:43:11,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614711378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:11,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:11,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:43:11,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844962480] [2024-11-08 16:43:11,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:11,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:43:11,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:11,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:43:11,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:43:11,339 INFO L87 Difference]: Start difference. First operand 697 states and 942 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:11,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:11,540 INFO L93 Difference]: Finished difference Result 1368 states and 1850 transitions. [2024-11-08 16:43:11,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:43:11,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2024-11-08 16:43:11,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:11,545 INFO L225 Difference]: With dead ends: 1368 [2024-11-08 16:43:11,545 INFO L226 Difference]: Without dead ends: 674 [2024-11-08 16:43:11,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:43:11,547 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 70 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:11,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 855 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:43:11,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-11-08 16:43:11,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 670. [2024-11-08 16:43:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 593 states have (on average 1.2951096121416525) internal successors, (768), 597 states have internal predecessors, (768), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-08 16:43:11,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 904 transitions. [2024-11-08 16:43:11,687 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 904 transitions. Word has length 125 [2024-11-08 16:43:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:11,689 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 904 transitions. [2024-11-08 16:43:11,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 904 transitions. [2024-11-08 16:43:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 16:43:11,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:11,691 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:11,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 16:43:11,691 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:11,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:11,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1310813513, now seen corresponding path program 1 times [2024-11-08 16:43:11,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:11,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504908801] [2024-11-08 16:43:11,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:11,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:43:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:43:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:43:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:43:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:43:12,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:12,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504908801] [2024-11-08 16:43:12,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504908801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:12,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:12,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:43:12,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602446697] [2024-11-08 16:43:12,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:12,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:43:12,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:12,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:43:12,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:43:12,565 INFO L87 Difference]: Start difference. First operand 670 states and 904 transitions. Second operand has 8 states, 6 states have (on average 11.333333333333334) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:43:13,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:13,146 INFO L93 Difference]: Finished difference Result 1387 states and 1874 transitions. [2024-11-08 16:43:13,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:43:13,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.333333333333334) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 125 [2024-11-08 16:43:13,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:13,151 INFO L225 Difference]: With dead ends: 1387 [2024-11-08 16:43:13,151 INFO L226 Difference]: Without dead ends: 720 [2024-11-08 16:43:13,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:43:13,155 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 113 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:13,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1524 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:43:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-11-08 16:43:13,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 346. [2024-11-08 16:43:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 307 states have (on average 1.289902280130293) internal successors, (396), 309 states have internal predecessors, (396), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 16:43:13,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 464 transitions. [2024-11-08 16:43:13,243 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 464 transitions. Word has length 125 [2024-11-08 16:43:13,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:13,243 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 464 transitions. [2024-11-08 16:43:13,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.333333333333334) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:43:13,243 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 464 transitions. [2024-11-08 16:43:13,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 16:43:13,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:13,245 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:13,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 16:43:13,245 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:13,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:13,246 INFO L85 PathProgramCache]: Analyzing trace with hash 641001647, now seen corresponding path program 1 times [2024-11-08 16:43:13,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:13,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662091881] [2024-11-08 16:43:13,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:13,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:13,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:13,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:13,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:43:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:13,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:13,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:43:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:13,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:13,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:43:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:13,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:43:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:13,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:13,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:13,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:13,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:43:13,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:13,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662091881] [2024-11-08 16:43:13,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662091881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:13,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:13,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:43:13,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248488548] [2024-11-08 16:43:13,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:13,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:43:13,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:13,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:43:13,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:43:13,800 INFO L87 Difference]: Start difference. First operand 346 states and 464 transitions. Second operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:14,252 INFO L93 Difference]: Finished difference Result 991 states and 1334 transitions. [2024-11-08 16:43:14,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:43:14,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2024-11-08 16:43:14,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:14,256 INFO L225 Difference]: With dead ends: 991 [2024-11-08 16:43:14,256 INFO L226 Difference]: Without dead ends: 648 [2024-11-08 16:43:14,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:43:14,258 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 119 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:14,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1164 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:43:14,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-11-08 16:43:14,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 422. [2024-11-08 16:43:14,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 383 states have (on average 1.2715404699738904) internal successors, (487), 385 states have internal predecessors, (487), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 16:43:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 555 transitions. [2024-11-08 16:43:14,329 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 555 transitions. Word has length 125 [2024-11-08 16:43:14,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:14,329 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 555 transitions. [2024-11-08 16:43:14,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:14,330 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 555 transitions. [2024-11-08 16:43:14,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 16:43:14,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:14,331 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:14,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 16:43:14,332 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:14,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:14,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2029424983, now seen corresponding path program 1 times [2024-11-08 16:43:14,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:14,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793866082] [2024-11-08 16:43:14,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:14,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:43:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:43:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:43:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:43:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:43:14,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:14,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793866082] [2024-11-08 16:43:14,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793866082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:14,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:14,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:43:14,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050346869] [2024-11-08 16:43:14,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:14,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:43:14,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:14,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:43:14,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:43:14,977 INFO L87 Difference]: Start difference. First operand 422 states and 555 transitions. Second operand has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:15,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:15,388 INFO L93 Difference]: Finished difference Result 1067 states and 1422 transitions. [2024-11-08 16:43:15,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:43:15,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 127 [2024-11-08 16:43:15,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:15,392 INFO L225 Difference]: With dead ends: 1067 [2024-11-08 16:43:15,392 INFO L226 Difference]: Without dead ends: 648 [2024-11-08 16:43:15,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:43:15,394 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 116 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:15,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 755 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:43:15,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-11-08 16:43:15,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 422. [2024-11-08 16:43:15,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 383 states have (on average 1.2637075718015667) internal successors, (484), 385 states have internal predecessors, (484), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 16:43:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 552 transitions. [2024-11-08 16:43:15,466 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 552 transitions. Word has length 127 [2024-11-08 16:43:15,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:15,467 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 552 transitions. [2024-11-08 16:43:15,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 552 transitions. [2024-11-08 16:43:15,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 16:43:15,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:15,468 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:15,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 16:43:15,469 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:15,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:15,469 INFO L85 PathProgramCache]: Analyzing trace with hash 152445974, now seen corresponding path program 1 times [2024-11-08 16:43:15,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:15,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220851813] [2024-11-08 16:43:15,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:15,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:16,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:16,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:16,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:43:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:16,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:16,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:43:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:16,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:16,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:43:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:16,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:43:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:16,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:16,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:16,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:16,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:43:16,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:16,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220851813] [2024-11-08 16:43:16,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220851813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:16,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:16,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:43:16,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816088946] [2024-11-08 16:43:16,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:16,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:43:16,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:16,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:43:16,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:43:16,788 INFO L87 Difference]: Start difference. First operand 422 states and 552 transitions. Second operand has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 10 states have internal predecessors, (70), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:17,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:17,819 INFO L93 Difference]: Finished difference Result 1186 states and 1567 transitions. [2024-11-08 16:43:17,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:43:17,820 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 10 states have internal predecessors, (70), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 127 [2024-11-08 16:43:17,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:17,824 INFO L225 Difference]: With dead ends: 1186 [2024-11-08 16:43:17,824 INFO L226 Difference]: Without dead ends: 767 [2024-11-08 16:43:17,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:43:17,827 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 317 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:17,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1881 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 16:43:17,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2024-11-08 16:43:17,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 634. [2024-11-08 16:43:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 571 states have (on average 1.2644483362521892) internal successors, (722), 574 states have internal predecessors, (722), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 16:43:17,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 834 transitions. [2024-11-08 16:43:17,947 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 834 transitions. Word has length 127 [2024-11-08 16:43:17,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:17,948 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 834 transitions. [2024-11-08 16:43:17,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 10 states have internal predecessors, (70), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:17,948 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 834 transitions. [2024-11-08 16:43:17,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 16:43:17,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:17,951 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:17,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 16:43:17,951 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:17,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:17,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1613330007, now seen corresponding path program 1 times [2024-11-08 16:43:17,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:17,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448632381] [2024-11-08 16:43:17,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:17,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:18,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:18,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:18,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:43:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:18,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:18,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:43:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:18,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:18,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:43:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:18,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:43:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:18,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:18,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:18,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:18,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:18,419 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:43:18,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:18,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448632381] [2024-11-08 16:43:18,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448632381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:18,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:18,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:43:18,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174249958] [2024-11-08 16:43:18,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:18,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:43:18,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:18,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:43:18,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:43:18,424 INFO L87 Difference]: Start difference. First operand 634 states and 834 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:18,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:18,616 INFO L93 Difference]: Finished difference Result 1270 states and 1670 transitions. [2024-11-08 16:43:18,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:43:18,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 128 [2024-11-08 16:43:18,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:18,621 INFO L225 Difference]: With dead ends: 1270 [2024-11-08 16:43:18,621 INFO L226 Difference]: Without dead ends: 639 [2024-11-08 16:43:18,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 1 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 16:43:18,623 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:18,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 551 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:43:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-08 16:43:18,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 626. [2024-11-08 16:43:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 563 states have (on average 1.2611012433392539) internal successors, (710), 566 states have internal predecessors, (710), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 16:43:18,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 822 transitions. [2024-11-08 16:43:18,757 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 822 transitions. Word has length 128 [2024-11-08 16:43:18,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:18,758 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 822 transitions. [2024-11-08 16:43:18,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:18,758 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 822 transitions. [2024-11-08 16:43:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 16:43:18,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:18,760 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:18,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 16:43:18,760 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:18,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:18,761 INFO L85 PathProgramCache]: Analyzing trace with hash 445923899, now seen corresponding path program 1 times [2024-11-08 16:43:18,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:18,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870781039] [2024-11-08 16:43:18,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:18,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:19,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:19,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:19,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:43:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:19,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:19,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:43:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:19,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:19,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:43:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:19,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:43:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:19,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:19,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:19,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:19,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:43:19,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:19,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870781039] [2024-11-08 16:43:19,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870781039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:19,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:19,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:43:19,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865593688] [2024-11-08 16:43:19,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:19,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:43:19,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:19,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:43:19,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:43:19,499 INFO L87 Difference]: Start difference. First operand 626 states and 822 transitions. Second operand has 9 states, 8 states have (on average 9.0) internal successors, (72), 9 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:20,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:20,026 INFO L93 Difference]: Finished difference Result 1256 states and 1648 transitions. [2024-11-08 16:43:20,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:43:20,027 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 9 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 129 [2024-11-08 16:43:20,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:20,031 INFO L225 Difference]: With dead ends: 1256 [2024-11-08 16:43:20,031 INFO L226 Difference]: Without dead ends: 633 [2024-11-08 16:43:20,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:43:20,034 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 7 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:20,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 977 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:43:20,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-08 16:43:20,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 621. [2024-11-08 16:43:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 558 states have (on average 1.2455197132616487) internal successors, (695), 561 states have internal predecessors, (695), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 16:43:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 807 transitions. [2024-11-08 16:43:20,145 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 807 transitions. Word has length 129 [2024-11-08 16:43:20,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:20,145 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 807 transitions. [2024-11-08 16:43:20,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 9 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:20,146 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 807 transitions. [2024-11-08 16:43:20,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 16:43:20,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:20,147 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:20,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 16:43:20,148 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:20,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:20,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1832127293, now seen corresponding path program 1 times [2024-11-08 16:43:20,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:20,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33829895] [2024-11-08 16:43:20,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:20,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:21,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:21,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:21,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:43:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:21,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:21,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:43:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:21,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:21,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:43:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:21,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:43:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:21,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:21,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:21,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:21,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:21,047 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:43:21,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:21,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33829895] [2024-11-08 16:43:21,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33829895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:21,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:21,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 16:43:21,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182048732] [2024-11-08 16:43:21,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:21,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 16:43:21,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:21,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 16:43:21,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:43:21,050 INFO L87 Difference]: Start difference. First operand 621 states and 807 transitions. Second operand has 13 states, 11 states have (on average 6.545454545454546) internal successors, (72), 13 states have internal predecessors, (72), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:43:22,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:22,005 INFO L93 Difference]: Finished difference Result 1582 states and 2076 transitions. [2024-11-08 16:43:22,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:43:22,006 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.545454545454546) internal successors, (72), 13 states have internal predecessors, (72), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 129 [2024-11-08 16:43:22,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:22,012 INFO L225 Difference]: With dead ends: 1582 [2024-11-08 16:43:22,012 INFO L226 Difference]: Without dead ends: 964 [2024-11-08 16:43:22,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2024-11-08 16:43:22,015 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 188 mSDsluCounter, 2097 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 2337 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:22,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 2337 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 16:43:22,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2024-11-08 16:43:22,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 684. [2024-11-08 16:43:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 621 states have (on average 1.2351046698872785) internal successors, (767), 624 states have internal predecessors, (767), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 16:43:22,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 879 transitions. [2024-11-08 16:43:22,156 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 879 transitions. Word has length 129 [2024-11-08 16:43:22,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:22,157 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 879 transitions. [2024-11-08 16:43:22,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.545454545454546) internal successors, (72), 13 states have internal predecessors, (72), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:43:22,157 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 879 transitions. [2024-11-08 16:43:22,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 16:43:22,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:22,160 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:22,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 16:43:22,161 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:22,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:22,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1809663643, now seen corresponding path program 1 times [2024-11-08 16:43:22,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:22,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933357704] [2024-11-08 16:43:22,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:22,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:23,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:23,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:23,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:43:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:23,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:23,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:43:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:23,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:23,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:43:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:23,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:43:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:23,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:23,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:23,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:23,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:23,355 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:43:23,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:23,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933357704] [2024-11-08 16:43:23,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933357704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:23,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:23,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 16:43:23,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470031817] [2024-11-08 16:43:23,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:23,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 16:43:23,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:23,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 16:43:23,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:43:23,359 INFO L87 Difference]: Start difference. First operand 684 states and 879 transitions. Second operand has 13 states, 11 states have (on average 6.545454545454546) internal successors, (72), 13 states have internal predecessors, (72), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:43:24,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:24,431 INFO L93 Difference]: Finished difference Result 1660 states and 2167 transitions. [2024-11-08 16:43:24,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:43:24,432 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.545454545454546) internal successors, (72), 13 states have internal predecessors, (72), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 129 [2024-11-08 16:43:24,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:24,435 INFO L225 Difference]: With dead ends: 1660 [2024-11-08 16:43:24,436 INFO L226 Difference]: Without dead ends: 979 [2024-11-08 16:43:24,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2024-11-08 16:43:24,438 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 118 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:24,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1247 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 16:43:24,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-11-08 16:43:24,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 691. [2024-11-08 16:43:24,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 628 states have (on average 1.234076433121019) internal successors, (775), 631 states have internal predecessors, (775), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 16:43:24,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 887 transitions. [2024-11-08 16:43:24,588 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 887 transitions. Word has length 129 [2024-11-08 16:43:24,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:24,588 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 887 transitions. [2024-11-08 16:43:24,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.545454545454546) internal successors, (72), 13 states have internal predecessors, (72), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:43:24,589 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 887 transitions. [2024-11-08 16:43:24,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 16:43:24,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:24,594 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:24,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-08 16:43:24,594 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:24,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:24,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1205256877, now seen corresponding path program 1 times [2024-11-08 16:43:24,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:24,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162505681] [2024-11-08 16:43:24,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:24,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:25,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:25,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:25,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:43:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:25,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:25,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:43:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:25,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:25,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:43:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:25,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:43:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:25,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:25,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:25,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:25,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:43:25,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:25,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162505681] [2024-11-08 16:43:25,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162505681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:25,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:25,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:43:25,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353474669] [2024-11-08 16:43:25,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:25,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:43:25,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:25,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:43:25,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:43:25,076 INFO L87 Difference]: Start difference. First operand 691 states and 887 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:43:25,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:25,287 INFO L93 Difference]: Finished difference Result 764 states and 977 transitions. [2024-11-08 16:43:25,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:43:25,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2024-11-08 16:43:25,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:25,292 INFO L225 Difference]: With dead ends: 764 [2024-11-08 16:43:25,292 INFO L226 Difference]: Without dead ends: 762 [2024-11-08 16:43:25,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:43:25,293 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 95 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:25,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 859 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:43:25,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-11-08 16:43:25,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 761. [2024-11-08 16:43:25,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 687 states have (on average 1.2314410480349345) internal successors, (846), 691 states have internal predecessors, (846), 62 states have call successors, (62), 11 states have call predecessors, (62), 11 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 16:43:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 970 transitions. [2024-11-08 16:43:25,447 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 970 transitions. Word has length 129 [2024-11-08 16:43:25,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:25,449 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 970 transitions. [2024-11-08 16:43:25,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:43:25,449 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 970 transitions. [2024-11-08 16:43:25,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 16:43:25,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:25,451 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:25,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-08 16:43:25,452 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:25,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:25,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1207103919, now seen corresponding path program 1 times [2024-11-08 16:43:25,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:25,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848862087] [2024-11-08 16:43:25,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:25,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:26,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:26,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:26,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:43:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:26,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:26,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:43:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:26,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:26,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:43:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:26,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:43:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:26,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:26,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:26,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:26,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:26,307 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:43:26,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:26,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848862087] [2024-11-08 16:43:26,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848862087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:26,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:26,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:43:26,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134426031] [2024-11-08 16:43:26,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:26,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:43:26,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:26,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:43:26,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:43:26,310 INFO L87 Difference]: Start difference. First operand 761 states and 970 transitions. Second operand has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:26,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:26,929 INFO L93 Difference]: Finished difference Result 1772 states and 2261 transitions. [2024-11-08 16:43:26,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:43:26,929 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 129 [2024-11-08 16:43:26,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:26,935 INFO L225 Difference]: With dead ends: 1772 [2024-11-08 16:43:26,935 INFO L226 Difference]: Without dead ends: 1049 [2024-11-08 16:43:26,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:43:26,940 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 164 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:26,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1022 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:43:26,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2024-11-08 16:43:27,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 875. [2024-11-08 16:43:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 786 states have (on average 1.2340966921119594) internal successors, (970), 791 states have internal predecessors, (970), 74 states have call successors, (74), 14 states have call predecessors, (74), 14 states have return successors, (74), 69 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-08 16:43:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1118 transitions. [2024-11-08 16:43:27,111 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1118 transitions. Word has length 129 [2024-11-08 16:43:27,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:27,112 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1118 transitions. [2024-11-08 16:43:27,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:27,112 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1118 transitions. [2024-11-08 16:43:27,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 16:43:27,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:27,114 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:27,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 16:43:27,114 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:27,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:27,115 INFO L85 PathProgramCache]: Analyzing trace with hash 814076909, now seen corresponding path program 1 times [2024-11-08 16:43:27,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:27,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691857241] [2024-11-08 16:43:27,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:27,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:27,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:27,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:27,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 16:43:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:27,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:27,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:43:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:27,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:27,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:43:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:27,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:43:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,009 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:43:28,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:28,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691857241] [2024-11-08 16:43:28,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691857241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:28,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:28,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:43:28,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377784580] [2024-11-08 16:43:28,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:28,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:43:28,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:28,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:43:28,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:43:28,013 INFO L87 Difference]: Start difference. First operand 875 states and 1118 transitions. Second operand has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:28,733 INFO L93 Difference]: Finished difference Result 1893 states and 2405 transitions. [2024-11-08 16:43:28,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:43:28,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 129 [2024-11-08 16:43:28,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:28,739 INFO L225 Difference]: With dead ends: 1893 [2024-11-08 16:43:28,739 INFO L226 Difference]: Without dead ends: 1056 [2024-11-08 16:43:28,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:43:28,742 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 248 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:28,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 946 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:43:28,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2024-11-08 16:43:28,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 935. [2024-11-08 16:43:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 837 states have (on average 1.2293906810035842) internal successors, (1029), 842 states have internal predecessors, (1029), 76 states have call successors, (76), 21 states have call predecessors, (76), 21 states have return successors, (76), 71 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-08 16:43:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1181 transitions. [2024-11-08 16:43:28,938 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1181 transitions. Word has length 129 [2024-11-08 16:43:28,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:28,938 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1181 transitions. [2024-11-08 16:43:28,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:28,939 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1181 transitions. [2024-11-08 16:43:28,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 16:43:28,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:28,941 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:28,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-08 16:43:28,941 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:28,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:28,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1705883025, now seen corresponding path program 1 times [2024-11-08 16:43:28,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:28,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772115374] [2024-11-08 16:43:28,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:28,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:43:29,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:43:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:43:29,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:43:29,173 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:43:29,175 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:43:29,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-08 16:43:29,183 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:29,334 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:43:29,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:43:29 BoogieIcfgContainer [2024-11-08 16:43:29,341 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:43:29,342 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:43:29,342 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:43:29,342 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:43:29,343 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:42:28" (3/4) ... [2024-11-08 16:43:29,346 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:43:29,347 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:43:29,348 INFO L158 Benchmark]: Toolchain (without parser) took 62571.58ms. Allocated memory was 148.9MB in the beginning and 836.8MB in the end (delta: 687.9MB). Free memory was 111.3MB in the beginning and 658.0MB in the end (delta: -546.7MB). Peak memory consumption was 142.1MB. Max. memory is 16.1GB. [2024-11-08 16:43:29,349 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 111.1MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:43:29,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.91ms. Allocated memory is still 148.9MB. Free memory was 111.3MB in the beginning and 111.3MB in the end (delta: -12.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 16:43:29,350 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.17ms. Allocated memory is still 148.9MB. Free memory was 111.3MB in the beginning and 106.5MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:43:29,352 INFO L158 Benchmark]: Boogie Preprocessor took 99.36ms. Allocated memory is still 148.9MB. Free memory was 106.5MB in the beginning and 100.9MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 16:43:29,353 INFO L158 Benchmark]: RCFGBuilder took 958.06ms. Allocated memory is still 148.9MB. Free memory was 100.9MB in the beginning and 61.7MB in the end (delta: 39.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-08 16:43:29,353 INFO L158 Benchmark]: TraceAbstraction took 60900.02ms. Allocated memory was 148.9MB in the beginning and 836.8MB in the end (delta: 687.9MB). Free memory was 61.0MB in the beginning and 659.1MB in the end (delta: -598.0MB). Peak memory consumption was 91.2MB. Max. memory is 16.1GB. [2024-11-08 16:43:29,353 INFO L158 Benchmark]: Witness Printer took 5.68ms. Allocated memory is still 836.8MB. Free memory was 659.1MB in the beginning and 658.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:43:29,355 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.23ms. Allocated memory is still 111.1MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 516.91ms. Allocated memory is still 148.9MB. Free memory was 111.3MB in the beginning and 111.3MB in the end (delta: -12.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.17ms. Allocated memory is still 148.9MB. Free memory was 111.3MB in the beginning and 106.5MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.36ms. Allocated memory is still 148.9MB. Free memory was 106.5MB in the beginning and 100.9MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 958.06ms. Allocated memory is still 148.9MB. Free memory was 100.9MB in the beginning and 61.7MB in the end (delta: 39.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 60900.02ms. Allocated memory was 148.9MB in the beginning and 836.8MB in the end (delta: 687.9MB). Free memory was 61.0MB in the beginning and 659.1MB in the end (delta: -598.0MB). Peak memory consumption was 91.2MB. Max. memory is 16.1GB. * Witness Printer took 5.68ms. Allocated memory is still 836.8MB. Free memory was 659.1MB in the beginning and 658.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L28-L30] signed char signed_char_Array_0[3] = { 5, 1, 25 }; [L28-L30] signed char signed_char_Array_0[3] = { 5, 1, 25 }; [L28-L30] signed char signed_char_Array_0[3] = { 5, 1, 25 }; [L28-L30] signed char signed_char_Array_0[3] = { 5, 1, 25 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -50 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -50 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 50, 2 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 50, 2 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 50, 2 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 19138, 0 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 19138, 0 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 19138, 0 }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L65] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] double_Array_0[0] = __VERIFIER_nondet_double() [L69] EXPR double_Array_0[0] [L69] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L69] EXPR double_Array_0[0] [L69] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] double_Array_0[1] = __VERIFIER_nondet_double() [L71] EXPR double_Array_0[1] [L71] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L71] EXPR double_Array_0[1] [L71] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] double_Array_0[3] = __VERIFIER_nondet_double() [L73] EXPR double_Array_0[3] [L73] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F [L73] EXPR double_Array_0[3] [L73] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] CALL assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] RET assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] double_Array_0[4] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[4] [L75] EXPR double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] EXPR double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F [L75] EXPR double_Array_0[4] [L75] EXPR double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] EXPR (double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] EXPR (double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] CALL assume_abort_if_not((double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] RET assume_abort_if_not((double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L80] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L83] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] RET updateVariables() [L98] CALL step() [L43] EXPR unsigned_char_Array_0[1] [L43] unsigned_char_Array_0[0] = unsigned_char_Array_0[1] [L44] EXPR signed_char_Array_0[0] [L44] signed_char_Array_0[1] = signed_char_Array_0[0] [L45] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L45] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L48] EXPR BOOL_unsigned_char_Array_0[0] [L48] BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] COND FALSE !(BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) [L51] EXPR unsigned_short_int_Array_0[0] [L51] unsigned short int stepLocal_0 = unsigned_short_int_Array_0[0]; [L52] EXPR unsigned_char_Array_0[0] [L52] EXPR unsigned_char_Array_0[0] [L52] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L52] EXPR unsigned_char_Array_0[0] << unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-49153, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L52] EXPR ((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0])) [L52] EXPR unsigned_char_Array_0[0] [L52] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L52] EXPR unsigned_char_Array_0[0] << unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-49153, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L52] EXPR ((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-49153, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L52] COND FALSE !(stepLocal_0 <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) [L55] EXPR unsigned_char_Array_0[0] [L55] EXPR unsigned_short_int_Array_0[1] [L55] EXPR unsigned_short_int_Array_0[0] [L55] signed_long_int_Array_0[0] = (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])) [L57] EXPR unsigned_char_Array_0[0] [L57] unsigned char stepLocal_1 = unsigned_char_Array_0[0]; [L58] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] COND FALSE !(unsigned_char_Array_0[0] < stepLocal_1) [L61] EXPR double_Array_0[4] [L61] EXPR double_Array_0[0] [L61] EXPR double_Array_0[1] [L61] double_Array_0[2] = ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]) [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1 [L89] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1) [L89] EXPR BOOL_unsigned_char_Array_0[0] [L89] EXPR BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1 [L89] EXPR (BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0]))))) [L89] EXPR unsigned_short_int_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR unsigned_char_Array_0[0] << unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0])) [L89] EXPR unsigned_char_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR unsigned_char_Array_0[0] << unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))) [L89] EXPR signed_long_int_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] [L89] EXPR unsigned_short_int_Array_0[1] [L89] EXPR unsigned_short_int_Array_0[0] [L89] EXPR (unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1])))) [L89] EXPR unsigned_char_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))) [L89] EXPR double_Array_0[2] [L89] EXPR double_Array_0[4] [L89] EXPR double_Array_0[0] [L89] EXPR double_Array_0[1] [L89] EXPR (unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89-L90] return (((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.7s, OverallIterations: 35, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 28.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3974 SdHoareTripleChecker+Valid, 18.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3944 mSDsluCounter, 38258 SdHoareTripleChecker+Invalid, 16.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31425 mSDsCounter, 262 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9097 IncrementalHoareTripleChecker+Invalid, 9359 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 262 mSolverCounterUnsat, 6833 mSDtfsCounter, 9097 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1233 GetRequests, 964 SyntacticMatches, 2 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=935occurred in iteration=34, InterpolantAutomatonStates: 283, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 3201 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 26.4s InterpolantComputationTime, 4314 NumberOfCodeBlocks, 4314 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 4151 ConstructedInterpolants, 0 QuantifiedInterpolants, 18901 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 8976/8976 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 16:43:29,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 f2cb36cc0f0fd05117e5167c95d28ca6a711637d120a8a77c2820981a0c818fc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:43:31,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:43:32,019 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:43:32,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:43:32,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:43:32,060 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:43:32,061 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:43:32,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:43:32,062 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:43:32,063 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:43:32,063 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:43:32,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:43:32,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:43:32,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:43:32,066 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:43:32,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:43:32,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:43:32,067 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:43:32,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:43:32,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:43:32,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:43:32,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:43:32,072 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:43:32,072 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:43:32,072 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:43:32,073 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:43:32,073 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:43:32,074 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:43:32,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:43:32,074 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:43:32,075 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:43:32,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:43:32,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:43:32,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:43:32,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:43:32,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:43:32,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:43:32,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:43:32,078 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 16:43:32,078 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:43:32,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:43:32,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:43:32,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:43:32,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:43:32,080 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_51e319ad-a601-4486-8a0e-78ba0c676ca8/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_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 -> f2cb36cc0f0fd05117e5167c95d28ca6a711637d120a8a77c2820981a0c818fc [2024-11-08 16:43:32,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:43:32,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:43:32,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:43:32,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:43:32,550 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:43:32,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i Unable to find full path for "g++" [2024-11-08 16:43:35,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:43:35,410 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:43:35,413 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i [2024-11-08 16:43:35,425 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/data/963798cd4/cc4219b0dcf44599a4355750abc8d672/FLAGc655a41b4 [2024-11-08 16:43:35,444 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/data/963798cd4/cc4219b0dcf44599a4355750abc8d672 [2024-11-08 16:43:35,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:43:35,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:43:35,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:43:35,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:43:35,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:43:35,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:43:35" (1/1) ... [2024-11-08 16:43:35,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@95aac22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:43:35, skipping insertion in model container [2024-11-08 16:43:35,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:43:35" (1/1) ... [2024-11-08 16:43:35,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:43:35,800 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_51e319ad-a601-4486-8a0e-78ba0c676ca8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i[916,929] [2024-11-08 16:43:35,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:43:35,966 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:43:35,990 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_51e319ad-a601-4486-8a0e-78ba0c676ca8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i[916,929] [2024-11-08 16:43:36,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:43:36,129 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:43:36,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:43:36 WrapperNode [2024-11-08 16:43:36,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:43:36,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:43:36,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:43:36,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:43:36,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:43:36" (1/1) ... [2024-11-08 16:43:36,176 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:43:36" (1/1) ... [2024-11-08 16:43:36,244 INFO L138 Inliner]: procedures = 36, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 494 [2024-11-08 16:43:36,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:43:36,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:43:36,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:43:36,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:43:36,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:43:36" (1/1) ... [2024-11-08 16:43:36,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:43:36" (1/1) ... [2024-11-08 16:43:36,281 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:43:36" (1/1) ... [2024-11-08 16:43:36,337 INFO L175 MemorySlicer]: Split 132 memory accesses to 7 slices as follows [2, 8, 39, 12, 5, 41, 25]. 31 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 3, 1, 2, 2]. The 16 writes are split as follows [0, 1, 6, 3, 2, 2, 2]. [2024-11-08 16:43:36,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:43:36" (1/1) ... [2024-11-08 16:43:36,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:43:36" (1/1) ... [2024-11-08 16:43:36,401 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:43:36" (1/1) ... [2024-11-08 16:43:36,410 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:43:36" (1/1) ... [2024-11-08 16:43:36,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:43:36" (1/1) ... [2024-11-08 16:43:36,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:43:36" (1/1) ... [2024-11-08 16:43:36,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:43:36,454 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:43:36,454 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:43:36,455 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:43:36,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:43:36" (1/1) ... [2024-11-08 16:43:36,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:43:36,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:43:36,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:43:36,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:43:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:43:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-08 16:43:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-08 16:43:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-08 16:43:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-08 16:43:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-08 16:43:36,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-08 16:43:36,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-08 16:43:36,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-08 16:43:36,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-08 16:43:36,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-08 16:43:36,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-08 16:43:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-08 16:43:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-08 16:43:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-08 16:43:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 16:43:36,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 16:43:36,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-08 16:43:36,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-08 16:43:36,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-08 16:43:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-08 16:43:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-08 16:43:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-08 16:43:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-08 16:43:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-08 16:43:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-08 16:43:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-08 16:43:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-08 16:43:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-08 16:43:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:43:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 16:43:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 16:43:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-08 16:43:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-08 16:43:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-08 16:43:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-08 16:43:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-08 16:43:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-08 16:43:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-08 16:43:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-08 16:43:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-08 16:43:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-08 16:43:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-08 16:43:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-08 16:43:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-08 16:43:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-08 16:43:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-08 16:43:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-08 16:43:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-08 16:43:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-08 16:43:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 16:43:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 16:43:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-08 16:43:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-08 16:43:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-08 16:43:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-08 16:43:36,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-08 16:43:36,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 16:43:36,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 16:43:36,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-08 16:43:36,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-08 16:43:36,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-08 16:43:36,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-08 16:43:36,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-08 16:43:36,665 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:43:36,665 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:43:36,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:43:36,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:43:36,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 16:43:36,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 16:43:36,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-08 16:43:36,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-08 16:43:36,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-08 16:43:36,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-08 16:43:36,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-08 16:43:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 16:43:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 16:43:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-08 16:43:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-08 16:43:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-08 16:43:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-08 16:43:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-08 16:43:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 16:43:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 16:43:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-08 16:43:36,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-08 16:43:36,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-08 16:43:36,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-08 16:43:36,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-08 16:43:36,927 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:43:36,930 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:43:39,339 INFO L? ?]: Removed 135 outVars from TransFormulas that were not future-live. [2024-11-08 16:43:39,339 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:43:39,353 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:43:39,354 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:43:39,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:43:39 BoogieIcfgContainer [2024-11-08 16:43:39,354 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:43:39,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:43:39,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:43:39,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:43:39,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:43:35" (1/3) ... [2024-11-08 16:43:39,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ebf186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:43:39, skipping insertion in model container [2024-11-08 16:43:39,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:43:36" (2/3) ... [2024-11-08 16:43:39,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ebf186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:43:39, skipping insertion in model container [2024-11-08 16:43:39,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:43:39" (3/3) ... [2024-11-08 16:43:39,363 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-70.i [2024-11-08 16:43:39,382 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:43:39,382 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:43:39,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:43:39,466 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;@5bf2c3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:43:39,466 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:43:39,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 86 states have (on average 1.441860465116279) internal successors, (124), 87 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:43:39,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 16:43:39,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:39,483 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:39,483 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:39,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:39,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1349067299, now seen corresponding path program 1 times [2024-11-08 16:43:39,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:43:39,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128866574] [2024-11-08 16:43:39,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:39,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:39,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:43:39,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:43:39,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 16:43:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:40,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 16:43:40,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:43:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-11-08 16:43:40,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:43:40,099 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:43:40,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128866574] [2024-11-08 16:43:40,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128866574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:40,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:40,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:43:40,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987982687] [2024-11-08 16:43:40,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:40,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:43:40,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:43:40,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:43:40,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:43:40,153 INFO L87 Difference]: Start difference. First operand has 101 states, 86 states have (on average 1.441860465116279) internal successors, (124), 87 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:40,184 INFO L93 Difference]: Finished difference Result 195 states and 302 transitions. [2024-11-08 16:43:40,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:43:40,187 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-08 16:43:40,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:40,193 INFO L225 Difference]: With dead ends: 195 [2024-11-08 16:43:40,194 INFO L226 Difference]: Without dead ends: 97 [2024-11-08 16:43:40,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:43:40,200 INFO L432 NwaCegarLoop]: 141 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, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:40,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:43:40,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-08 16:43:40,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-08 16:43:40,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 83 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:43:40,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2024-11-08 16:43:40,258 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 115 [2024-11-08 16:43:40,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:40,259 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2024-11-08 16:43:40,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2024-11-08 16:43:40,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 16:43:40,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:40,264 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:40,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 16:43:40,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:40,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:40,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:40,466 INFO L85 PathProgramCache]: Analyzing trace with hash 238939981, now seen corresponding path program 1 times [2024-11-08 16:43:40,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:43:40,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078714654] [2024-11-08 16:43:40,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:40,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:40,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:43:40,471 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:43:40,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 16:43:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:40,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:43:40,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:43:40,990 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-08 16:43:40,990 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:43:40,994 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:43:40,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078714654] [2024-11-08 16:43:40,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078714654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:40,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:40,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:43:40,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59402511] [2024-11-08 16:43:40,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:40,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:43:40,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:43:40,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:43:41,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:43:41,003 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:41,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:41,137 INFO L93 Difference]: Finished difference Result 193 states and 282 transitions. [2024-11-08 16:43:41,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:43:41,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-08 16:43:41,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:41,143 INFO L225 Difference]: With dead ends: 193 [2024-11-08 16:43:41,145 INFO L226 Difference]: Without dead ends: 99 [2024-11-08 16:43:41,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:43:41,148 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:41,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:43:41,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-08 16:43:41,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-08 16:43:41,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.4) internal successors, (119), 85 states have internal predecessors, (119), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:43:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 143 transitions. [2024-11-08 16:43:41,172 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 143 transitions. Word has length 115 [2024-11-08 16:43:41,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:41,174 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 143 transitions. [2024-11-08 16:43:41,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:41,175 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 143 transitions. [2024-11-08 16:43:41,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 16:43:41,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:41,179 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:41,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 16:43:41,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:41,380 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:41,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:41,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1206290635, now seen corresponding path program 1 times [2024-11-08 16:43:41,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:43:41,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347770744] [2024-11-08 16:43:41,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:41,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:41,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:43:41,386 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:43:41,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 16:43:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:41,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 16:43:41,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:43:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-08 16:43:42,512 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:43:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:43:42,772 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:43:42,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347770744] [2024-11-08 16:43:42,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347770744] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:43:42,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:43:42,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-08 16:43:42,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635373236] [2024-11-08 16:43:42,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:42,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:43:42,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:43:42,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:43:42,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:43:42,778 INFO L87 Difference]: Start difference. First operand 99 states and 143 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:43:42,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:42,962 INFO L93 Difference]: Finished difference Result 238 states and 346 transitions. [2024-11-08 16:43:42,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:43:42,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-08 16:43:42,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:42,965 INFO L225 Difference]: With dead ends: 238 [2024-11-08 16:43:42,965 INFO L226 Difference]: Without dead ends: 142 [2024-11-08 16:43:42,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:43:42,967 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 61 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:42,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 523 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:43:42,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-08 16:43:42,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 102. [2024-11-08 16:43:42,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:43:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 146 transitions. [2024-11-08 16:43:42,979 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 146 transitions. Word has length 115 [2024-11-08 16:43:42,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:42,980 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 146 transitions. [2024-11-08 16:43:42,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:43:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 146 transitions. [2024-11-08 16:43:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 16:43:42,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:42,983 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:42,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 16:43:43,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:43,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:43,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:43,185 INFO L85 PathProgramCache]: Analyzing trace with hash -380292981, now seen corresponding path program 1 times [2024-11-08 16:43:43,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:43:43,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15509933] [2024-11-08 16:43:43,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:43,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:43,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:43:43,189 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:43:43,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 16:43:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:43,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:43:43,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:43:43,657 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:43:43,661 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:43:43,662 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:43:43,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15509933] [2024-11-08 16:43:43,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [15509933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:43,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:43,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:43:43,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268632710] [2024-11-08 16:43:43,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:43,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:43:43,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:43:43,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:43:43,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:43:43,668 INFO L87 Difference]: Start difference. First operand 102 states and 146 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:43:43,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:43,726 INFO L93 Difference]: Finished difference Result 203 states and 292 transitions. [2024-11-08 16:43:43,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:43:43,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-08 16:43:43,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:43,729 INFO L225 Difference]: With dead ends: 203 [2024-11-08 16:43:43,729 INFO L226 Difference]: Without dead ends: 104 [2024-11-08 16:43:43,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:43:43,730 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:43,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:43:43,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-08 16:43:43,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-08 16:43:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:43:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 148 transitions. [2024-11-08 16:43:43,740 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 148 transitions. Word has length 115 [2024-11-08 16:43:43,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:43,740 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 148 transitions. [2024-11-08 16:43:43,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:43:43,741 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 148 transitions. [2024-11-08 16:43:43,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 16:43:43,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:43,743 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:43,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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)] Forceful destruction successful, exit code 0 [2024-11-08 16:43:43,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:43,944 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:43,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:43,945 INFO L85 PathProgramCache]: Analyzing trace with hash -185741178, now seen corresponding path program 1 times [2024-11-08 16:43:43,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:43:43,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433992426] [2024-11-08 16:43:43,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:43,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:43,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:43:43,949 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:43:43,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 16:43:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:44,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:43:44,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:43:44,972 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-08 16:43:44,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:43:45,209 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:43:45,209 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:43:45,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433992426] [2024-11-08 16:43:45,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433992426] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:43:45,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:43:45,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-08 16:43:45,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97768382] [2024-11-08 16:43:45,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:45,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:43:45,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:43:45,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:43:45,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:43:45,213 INFO L87 Difference]: Start difference. First operand 104 states and 148 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:43:45,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:45,329 INFO L93 Difference]: Finished difference Result 243 states and 346 transitions. [2024-11-08 16:43:45,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:43:45,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-08 16:43:45,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:45,332 INFO L225 Difference]: With dead ends: 243 [2024-11-08 16:43:45,332 INFO L226 Difference]: Without dead ends: 142 [2024-11-08 16:43:45,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:43:45,334 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 94 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:45,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 395 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:43:45,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-08 16:43:45,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 114. [2024-11-08 16:43:45,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:43:45,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-11-08 16:43:45,344 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 117 [2024-11-08 16:43:45,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:45,344 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-11-08 16:43:45,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:43:45,344 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-11-08 16:43:45,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 16:43:45,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:45,346 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:45,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 16:43:45,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:45,551 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:45,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:45,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1049765808, now seen corresponding path program 1 times [2024-11-08 16:43:45,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:43:45,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013509767] [2024-11-08 16:43:45,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:45,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:45,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:43:45,556 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:43:45,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 16:43:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:45,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 16:43:45,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:43:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-08 16:43:46,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:43:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:43:46,937 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:43:46,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013509767] [2024-11-08 16:43:46,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013509767] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:43:46,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:43:46,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-08 16:43:46,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135540239] [2024-11-08 16:43:46,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:46,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:43:46,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:43:46,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:43:46,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:43:46,940 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:43:47,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:47,085 INFO L93 Difference]: Finished difference Result 254 states and 361 transitions. [2024-11-08 16:43:47,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:43:47,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-08 16:43:47,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:47,087 INFO L225 Difference]: With dead ends: 254 [2024-11-08 16:43:47,087 INFO L226 Difference]: Without dead ends: 143 [2024-11-08 16:43:47,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:43:47,089 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 43 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:47,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 522 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:43:47,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-08 16:43:47,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 118. [2024-11-08 16:43:47,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 104 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:43:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2024-11-08 16:43:47,099 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 118 [2024-11-08 16:43:47,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:47,099 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2024-11-08 16:43:47,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:43:47,100 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2024-11-08 16:43:47,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 16:43:47,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:47,102 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:47,117 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-08 16:43:47,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:47,304 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:47,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:47,304 INFO L85 PathProgramCache]: Analyzing trace with hash 954220560, now seen corresponding path program 1 times [2024-11-08 16:43:47,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:43:47,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [531491012] [2024-11-08 16:43:47,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:47,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:47,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:43:47,307 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:43:47,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-08 16:43:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:47,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:43:47,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:43:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:43:47,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:43:47,913 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:43:47,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [531491012] [2024-11-08 16:43:47,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [531491012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:47,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:47,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:43:47,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746795619] [2024-11-08 16:43:47,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:47,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:43:47,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:43:47,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:43:47,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:43:47,916 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:43:47,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:47,994 INFO L93 Difference]: Finished difference Result 236 states and 333 transitions. [2024-11-08 16:43:47,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:43:47,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-08 16:43:47,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:47,996 INFO L225 Difference]: With dead ends: 236 [2024-11-08 16:43:47,996 INFO L226 Difference]: Without dead ends: 121 [2024-11-08 16:43:47,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 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 16:43:47,997 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:47,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:43:47,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-08 16:43:48,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-08 16:43:48,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 107 states have (on average 1.355140186915888) internal successors, (145), 107 states have internal predecessors, (145), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:43:48,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 169 transitions. [2024-11-08 16:43:48,006 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 169 transitions. Word has length 118 [2024-11-08 16:43:48,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:48,007 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 169 transitions. [2024-11-08 16:43:48,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:43:48,008 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 169 transitions. [2024-11-08 16:43:48,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 16:43:48,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:48,010 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:48,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-08 16:43:48,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:48,214 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:48,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:48,215 INFO L85 PathProgramCache]: Analyzing trace with hash 485051969, now seen corresponding path program 1 times [2024-11-08 16:43:48,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:43:48,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148777159] [2024-11-08 16:43:48,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:48,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:48,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:43:48,220 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:43:48,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-08 16:43:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:48,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 16:43:48,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:43:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:43:48,697 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:43:48,698 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:43:48,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148777159] [2024-11-08 16:43:48,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148777159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:48,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:48,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:43:48,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408382375] [2024-11-08 16:43:48,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:48,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:43:48,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:43:48,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:43:48,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:43:48,700 INFO L87 Difference]: Start difference. First operand 121 states and 169 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:43:48,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:48,829 INFO L93 Difference]: Finished difference Result 246 states and 345 transitions. [2024-11-08 16:43:48,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:43:48,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-08 16:43:48,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:48,831 INFO L225 Difference]: With dead ends: 246 [2024-11-08 16:43:48,831 INFO L226 Difference]: Without dead ends: 128 [2024-11-08 16:43:48,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:43:48,833 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:48,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 652 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:43:48,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-08 16:43:48,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2024-11-08 16:43:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.336283185840708) internal successors, (151), 113 states have internal predecessors, (151), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:43:48,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 175 transitions. [2024-11-08 16:43:48,847 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 175 transitions. Word has length 119 [2024-11-08 16:43:48,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:48,847 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 175 transitions. [2024-11-08 16:43:48,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:43:48,848 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 175 transitions. [2024-11-08 16:43:48,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 16:43:48,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:48,850 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:48,864 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-08 16:43:49,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:49,054 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:49,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:49,054 INFO L85 PathProgramCache]: Analyzing trace with hash -2034907965, now seen corresponding path program 1 times [2024-11-08 16:43:49,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:43:49,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657255310] [2024-11-08 16:43:49,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:49,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:49,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:43:49,057 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:43:49,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-08 16:43:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:49,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 16:43:49,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:43:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:43:49,564 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:43:49,564 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:43:49,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657255310] [2024-11-08 16:43:49,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657255310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:49,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:49,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:43:49,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126387901] [2024-11-08 16:43:49,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:49,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:43:49,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:43:49,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:43:49,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:43:49,568 INFO L87 Difference]: Start difference. First operand 127 states and 175 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:43:49,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:49,708 INFO L93 Difference]: Finished difference Result 254 states and 351 transitions. [2024-11-08 16:43:49,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:43:49,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-08 16:43:49,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:49,710 INFO L225 Difference]: With dead ends: 254 [2024-11-08 16:43:49,710 INFO L226 Difference]: Without dead ends: 130 [2024-11-08 16:43:49,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:43:49,711 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:49,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 776 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:43:49,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-08 16:43:49,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2024-11-08 16:43:49,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 115 states have internal predecessors, (153), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:43:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 177 transitions. [2024-11-08 16:43:49,720 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 177 transitions. Word has length 119 [2024-11-08 16:43:49,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:49,720 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 177 transitions. [2024-11-08 16:43:49,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:43:49,721 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 177 transitions. [2024-11-08 16:43:49,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 16:43:49,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:49,722 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:49,734 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 16:43:49,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:49,923 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:49,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:49,923 INFO L85 PathProgramCache]: Analyzing trace with hash -2033060923, now seen corresponding path program 1 times [2024-11-08 16:43:49,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:43:49,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473946807] [2024-11-08 16:43:49,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:49,924 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:49,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:43:49,925 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:43:49,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-08 16:43:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:50,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:43:50,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:43:50,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:43:50,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2024-11-08 16:43:50,588 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-08 16:43:50,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:43:50,589 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:43:50,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473946807] [2024-11-08 16:43:50,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473946807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:50,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:50,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:43:50,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150449879] [2024-11-08 16:43:50,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:50,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:43:50,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:43:50,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:43:50,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:43:50,592 INFO L87 Difference]: Start difference. First operand 129 states and 177 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:53,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:53,647 INFO L93 Difference]: Finished difference Result 256 states and 352 transitions. [2024-11-08 16:43:53,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:43:53,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2024-11-08 16:43:53,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:53,658 INFO L225 Difference]: With dead ends: 256 [2024-11-08 16:43:53,658 INFO L226 Difference]: Without dead ends: 130 [2024-11-08 16:43:53,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:43:53,659 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 126 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:53,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 440 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 16:43:53,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-08 16:43:53,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2024-11-08 16:43:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 115 states have (on average 1.3217391304347825) internal successors, (152), 115 states have internal predecessors, (152), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:43:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 176 transitions. [2024-11-08 16:43:53,666 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 176 transitions. Word has length 119 [2024-11-08 16:43:53,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:53,667 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 176 transitions. [2024-11-08 16:43:53,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 176 transitions. [2024-11-08 16:43:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:43:53,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:53,668 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:53,679 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-08 16:43:53,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:53,869 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:53,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:53,870 INFO L85 PathProgramCache]: Analyzing trace with hash 396824223, now seen corresponding path program 1 times [2024-11-08 16:43:53,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:43:53,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607785012] [2024-11-08 16:43:53,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:53,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:53,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:43:53,874 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:43:53,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 16:43:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:54,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:43:54,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:43:54,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:43:54,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-08 16:43:54,578 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-08 16:43:54,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:43:54,579 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:43:54,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607785012] [2024-11-08 16:43:54,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607785012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:54,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:54,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:43:54,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983173074] [2024-11-08 16:43:54,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:54,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:43:54,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:43:54,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:43:54,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:43:54,582 INFO L87 Difference]: Start difference. First operand 129 states and 176 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:58,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:43:58,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:58,227 INFO L93 Difference]: Finished difference Result 256 states and 350 transitions. [2024-11-08 16:43:58,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:43:58,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2024-11-08 16:43:58,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:58,239 INFO L225 Difference]: With dead ends: 256 [2024-11-08 16:43:58,239 INFO L226 Difference]: Without dead ends: 130 [2024-11-08 16:43:58,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:43:58,240 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 118 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:58,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 436 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-08 16:43:58,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-08 16:43:58,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2024-11-08 16:43:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 115 states have (on average 1.3130434782608695) internal successors, (151), 115 states have internal predecessors, (151), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:43:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 175 transitions. [2024-11-08 16:43:58,246 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 175 transitions. Word has length 121 [2024-11-08 16:43:58,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:58,247 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 175 transitions. [2024-11-08 16:43:58,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:43:58,247 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 175 transitions. [2024-11-08 16:43:58,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 16:43:58,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:58,248 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:58,259 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 16:43:58,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:58,449 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:58,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:58,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1535857347, now seen corresponding path program 1 times [2024-11-08 16:43:58,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:43:58,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300718752] [2024-11-08 16:43:58,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:58,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:58,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:43:58,451 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:43:58,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-08 16:43:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:58,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 16:43:58,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:43:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-08 16:43:58,983 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:43:58,983 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:43:58,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300718752] [2024-11-08 16:43:58,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300718752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:58,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:58,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:43:58,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321901586] [2024-11-08 16:43:58,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:58,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:43:58,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:43:58,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:43:58,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:43:58,985 INFO L87 Difference]: Start difference. First operand 129 states and 175 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:43:59,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:59,268 INFO L93 Difference]: Finished difference Result 259 states and 352 transitions. [2024-11-08 16:43:59,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:43:59,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 123 [2024-11-08 16:43:59,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:59,270 INFO L225 Difference]: With dead ends: 259 [2024-11-08 16:43:59,270 INFO L226 Difference]: Without dead ends: 131 [2024-11-08 16:43:59,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:43:59,272 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:59,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 584 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:43:59,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-08 16:43:59,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-11-08 16:43:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 115 states have (on average 1.3043478260869565) internal successors, (150), 115 states have internal predecessors, (150), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:43:59,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 174 transitions. [2024-11-08 16:43:59,279 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 174 transitions. Word has length 123 [2024-11-08 16:43:59,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:59,280 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 174 transitions. [2024-11-08 16:43:59,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:43:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 174 transitions. [2024-11-08 16:43:59,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 16:43:59,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:59,282 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:43:59,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-08 16:43:59,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:59,482 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:59,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:59,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1564357637, now seen corresponding path program 1 times [2024-11-08 16:43:59,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:43:59,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394896049] [2024-11-08 16:43:59,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:59,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:43:59,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:43:59,485 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:43:59,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-08 16:43:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:59,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:43:59,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:44:00,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:44:00,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-08 16:44:00,239 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-08 16:44:00,239 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:44:00,239 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:44:00,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394896049] [2024-11-08 16:44:00,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394896049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:44:00,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:44:00,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:44:00,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392886748] [2024-11-08 16:44:00,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:44:00,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:44:00,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:44:00,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:44:00,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:44:00,242 INFO L87 Difference]: Start difference. First operand 129 states and 174 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:44:02,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:44:03,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:44:04,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:04,256 INFO L93 Difference]: Finished difference Result 256 states and 346 transitions. [2024-11-08 16:44:04,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:44:04,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2024-11-08 16:44:04,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:04,270 INFO L225 Difference]: With dead ends: 256 [2024-11-08 16:44:04,270 INFO L226 Difference]: Without dead ends: 130 [2024-11-08 16:44:04,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:44:04,272 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 108 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:04,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 428 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-08 16:44:04,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-08 16:44:04,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2024-11-08 16:44:04,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 115 states have (on average 1.2956521739130435) internal successors, (149), 115 states have internal predecessors, (149), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:44:04,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 173 transitions. [2024-11-08 16:44:04,280 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 173 transitions. Word has length 123 [2024-11-08 16:44:04,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:04,280 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 173 transitions. [2024-11-08 16:44:04,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:44:04,281 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 173 transitions. [2024-11-08 16:44:04,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 16:44:04,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:04,282 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:44:04,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-08 16:44:04,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:44:04,483 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:44:04,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:04,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1591487265, now seen corresponding path program 1 times [2024-11-08 16:44:04,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:44:04,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410294867] [2024-11-08 16:44:04,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:04,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:44:04,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:44:04,487 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:44:04,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-08 16:44:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:04,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:44:04,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:44:05,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:44:05,341 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 175 treesize of output 67 [2024-11-08 16:44:05,401 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-08 16:44:05,401 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:44:05,402 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:44:05,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410294867] [2024-11-08 16:44:05,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410294867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:44:05,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:44:05,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:44:05,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932506008] [2024-11-08 16:44:05,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:44:05,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:44:05,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:44:05,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:44:05,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:44:05,406 INFO L87 Difference]: Start difference. First operand 129 states and 173 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:44:07,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:44:09,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:44:09,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:09,839 INFO L93 Difference]: Finished difference Result 255 states and 343 transitions. [2024-11-08 16:44:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:44:09,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2024-11-08 16:44:09,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:09,854 INFO L225 Difference]: With dead ends: 255 [2024-11-08 16:44:09,854 INFO L226 Difference]: Without dead ends: 129 [2024-11-08 16:44:09,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:44:09,855 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 99 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:09,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 421 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-08 16:44:09,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-08 16:44:09,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2024-11-08 16:44:09,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:44:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 170 transitions. [2024-11-08 16:44:09,864 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 170 transitions. Word has length 125 [2024-11-08 16:44:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:09,864 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 170 transitions. [2024-11-08 16:44:09,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:44:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 170 transitions. [2024-11-08 16:44:09,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 16:44:09,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:09,867 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:44:09,877 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-08 16:44:10,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:44:10,068 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:44:10,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:10,068 INFO L85 PathProgramCache]: Analyzing trace with hash 674177351, now seen corresponding path program 1 times [2024-11-08 16:44:10,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:44:10,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719328612] [2024-11-08 16:44:10,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:10,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:44:10,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:44:10,070 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:44:10,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-08 16:44:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:10,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:44:10,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:44:10,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-08 16:44:10,733 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:44:10,733 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:44:10,733 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:44:10,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719328612] [2024-11-08 16:44:10,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719328612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:44:10,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:44:10,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:44:10,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023829318] [2024-11-08 16:44:10,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:44:10,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:44:10,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:44:10,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:44:10,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:44:10,736 INFO L87 Difference]: Start difference. First operand 127 states and 170 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:44:12,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:44:12,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:12,299 INFO L93 Difference]: Finished difference Result 251 states and 337 transitions. [2024-11-08 16:44:12,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:44:12,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2024-11-08 16:44:12,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:12,301 INFO L225 Difference]: With dead ends: 251 [2024-11-08 16:44:12,301 INFO L226 Difference]: Without dead ends: 127 [2024-11-08 16:44:12,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:44:12,302 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:12,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 16:44:12,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-08 16:44:12,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-08 16:44:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.2743362831858407) internal successors, (144), 113 states have internal predecessors, (144), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:44:12,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 168 transitions. [2024-11-08 16:44:12,311 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 168 transitions. Word has length 127 [2024-11-08 16:44:12,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:12,311 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 168 transitions. [2024-11-08 16:44:12,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:44:12,312 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 168 transitions. [2024-11-08 16:44:12,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 16:44:12,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:12,313 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:44:12,326 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-08 16:44:12,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:44:12,515 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:44:12,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:12,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1014766391, now seen corresponding path program 1 times [2024-11-08 16:44:12,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:44:12,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67317666] [2024-11-08 16:44:12,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:12,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:44:12,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:44:12,519 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:44:12,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-08 16:44:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:13,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 16:44:13,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:44:13,308 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 26 treesize of output 22 [2024-11-08 16:44:13,962 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 33 treesize of output 21 [2024-11-08 16:44:14,337 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 116 treesize of output 80 [2024-11-08 16:44:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:44:14,488 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:44:14,488 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:44:14,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67317666] [2024-11-08 16:44:14,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67317666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:44:14,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:44:14,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 16:44:14,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384829810] [2024-11-08 16:44:14,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:44:14,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:44:14,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:44:14,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:44:14,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:44:14,492 INFO L87 Difference]: Start difference. First operand 127 states and 168 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:44:18,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:18,033 INFO L93 Difference]: Finished difference Result 459 states and 610 transitions. [2024-11-08 16:44:18,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 16:44:18,034 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2024-11-08 16:44:18,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:18,037 INFO L225 Difference]: With dead ends: 459 [2024-11-08 16:44:18,037 INFO L226 Difference]: Without dead ends: 335 [2024-11-08 16:44:18,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:44:18,039 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 322 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:18,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1494 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 16:44:18,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-08 16:44:18,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 141. [2024-11-08 16:44:18,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 127 states have (on average 1.2913385826771653) internal successors, (164), 127 states have internal predecessors, (164), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:44:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 188 transitions. [2024-11-08 16:44:18,058 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 188 transitions. Word has length 127 [2024-11-08 16:44:18,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:18,059 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 188 transitions. [2024-11-08 16:44:18,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:44:18,059 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 188 transitions. [2024-11-08 16:44:18,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 16:44:18,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:18,061 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:44:18,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 16:44:18,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:44:18,262 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:44:18,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:18,262 INFO L85 PathProgramCache]: Analyzing trace with hash -2035834745, now seen corresponding path program 1 times [2024-11-08 16:44:18,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:44:18,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034974547] [2024-11-08 16:44:18,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:18,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:44:18,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:44:18,265 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:44:18,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-08 16:44:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:18,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 16:44:18,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:44:19,028 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 22 [2024-11-08 16:44:19,035 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 22 treesize of output 18 [2024-11-08 16:44:19,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:44:19,473 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 47 treesize of output 27 [2024-11-08 16:44:19,589 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:44:19,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:44:19,589 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:44:19,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034974547] [2024-11-08 16:44:19,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034974547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:44:19,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:44:19,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:44:19,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202192059] [2024-11-08 16:44:19,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:44:19,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:44:19,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:44:19,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:44:19,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:44:19,592 INFO L87 Difference]: Start difference. First operand 141 states and 188 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:44:21,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:21,610 INFO L93 Difference]: Finished difference Result 502 states and 669 transitions. [2024-11-08 16:44:21,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:44:21,612 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2024-11-08 16:44:21,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:21,615 INFO L225 Difference]: With dead ends: 502 [2024-11-08 16:44:21,615 INFO L226 Difference]: Without dead ends: 364 [2024-11-08 16:44:21,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:44:21,617 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 323 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:21,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 920 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 16:44:21,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-08 16:44:21,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 242. [2024-11-08 16:44:21,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 217 states have (on average 1.2857142857142858) internal successors, (279), 218 states have internal predecessors, (279), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 16:44:21,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 323 transitions. [2024-11-08 16:44:21,661 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 323 transitions. Word has length 127 [2024-11-08 16:44:21,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:21,662 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 323 transitions. [2024-11-08 16:44:21,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:44:21,663 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 323 transitions. [2024-11-08 16:44:21,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 16:44:21,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:21,665 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:44:21,682 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-08 16:44:21,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:44:21,866 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:44:21,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:21,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1233621109, now seen corresponding path program 1 times [2024-11-08 16:44:21,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:44:21,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333684607] [2024-11-08 16:44:21,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:21,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:44:21,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:44:21,871 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:44:21,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-08 16:44:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:22,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 16:44:22,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:44:22,555 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 26 treesize of output 22 [2024-11-08 16:44:22,978 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 33 treesize of output 21 [2024-11-08 16:44:23,205 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 96 treesize of output 68 [2024-11-08 16:44:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:44:23,316 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:44:23,316 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:44:23,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333684607] [2024-11-08 16:44:23,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [333684607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:44:23,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:44:23,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:44:23,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841439760] [2024-11-08 16:44:23,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:44:23,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:44:23,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:44:23,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:44:23,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:44:23,319 INFO L87 Difference]: Start difference. First operand 242 states and 323 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:44:26,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:26,539 INFO L93 Difference]: Finished difference Result 776 states and 1034 transitions. [2024-11-08 16:44:26,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 16:44:26,541 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2024-11-08 16:44:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:26,547 INFO L225 Difference]: With dead ends: 776 [2024-11-08 16:44:26,549 INFO L226 Difference]: Without dead ends: 537 [2024-11-08 16:44:26,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:44:26,550 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 238 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:26,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 1823 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 16:44:26,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-11-08 16:44:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 247. [2024-11-08 16:44:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 222 states have (on average 1.2927927927927927) internal successors, (287), 223 states have internal predecessors, (287), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 16:44:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 331 transitions. [2024-11-08 16:44:26,582 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 331 transitions. Word has length 127 [2024-11-08 16:44:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:26,586 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 331 transitions. [2024-11-08 16:44:26,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:44:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 331 transitions. [2024-11-08 16:44:26,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 16:44:26,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:26,588 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:44:26,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 16:44:26,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:44:26,789 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:44:26,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:26,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2125119045, now seen corresponding path program 1 times [2024-11-08 16:44:26,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:44:26,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039065708] [2024-11-08 16:44:26,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:26,790 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:44:26,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:44:26,792 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:44:26,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 16:44:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:27,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 16:44:27,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:44:27,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 16:44:27,579 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 38 treesize of output 18 [2024-11-08 16:44:27,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 16:44:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-08 16:44:27,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:44:27,740 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:44:27,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039065708] [2024-11-08 16:44:27,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039065708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:44:27,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:44:27,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:44:27,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665746514] [2024-11-08 16:44:27,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:44:27,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:44:27,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:44:27,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:44:27,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:44:27,742 INFO L87 Difference]: Start difference. First operand 247 states and 331 transitions. Second operand has 9 states, 8 states have (on average 9.125) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:44:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:29,279 INFO L93 Difference]: Finished difference Result 595 states and 792 transitions. [2024-11-08 16:44:29,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 16:44:29,280 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 127 [2024-11-08 16:44:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:29,282 INFO L225 Difference]: With dead ends: 595 [2024-11-08 16:44:29,282 INFO L226 Difference]: Without dead ends: 351 [2024-11-08 16:44:29,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:44:29,284 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 217 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:29,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 1152 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 16:44:29,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-08 16:44:29,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 155. [2024-11-08 16:44:29,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 140 states have (on average 1.2857142857142858) internal successors, (180), 140 states have internal predecessors, (180), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:44:29,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 204 transitions. [2024-11-08 16:44:29,305 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 204 transitions. Word has length 127 [2024-11-08 16:44:29,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:29,305 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 204 transitions. [2024-11-08 16:44:29,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:44:29,306 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 204 transitions. [2024-11-08 16:44:29,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 16:44:29,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:29,308 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:44:29,321 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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)] Ended with exit code 0 [2024-11-08 16:44:29,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:44:29,509 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:44:29,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:29,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1524239481, now seen corresponding path program 1 times [2024-11-08 16:44:29,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:44:29,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38509515] [2024-11-08 16:44:29,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:29,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:44:29,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:44:29,512 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:44:29,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 [2024-11-08 16:44:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:30,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 16:44:30,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:44:30,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-08 16:44:30,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 38 treesize of output 18 [2024-11-08 16:44:30,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 16:44:30,869 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-08 16:44:30,870 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:44:30,870 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:44:30,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38509515] [2024-11-08 16:44:30,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38509515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:44:30,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:44:30,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:44:30,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331320548] [2024-11-08 16:44:30,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:44:30,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:44:30,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:44:30,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:44:30,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:44:30,872 INFO L87 Difference]: Start difference. First operand 155 states and 204 transitions. Second operand has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 10 states have internal predecessors, (76), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:44:32,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:32,550 INFO L93 Difference]: Finished difference Result 398 states and 523 transitions. [2024-11-08 16:44:32,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 16:44:32,551 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 10 states have internal predecessors, (76), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 127 [2024-11-08 16:44:32,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:32,553 INFO L225 Difference]: With dead ends: 398 [2024-11-08 16:44:32,553 INFO L226 Difference]: Without dead ends: 246 [2024-11-08 16:44:32,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:44:32,555 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 277 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:32,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 830 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 16:44:32,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-08 16:44:32,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 155. [2024-11-08 16:44:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 140 states have internal predecessors, (179), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:44:32,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 203 transitions. [2024-11-08 16:44:32,586 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 203 transitions. Word has length 127 [2024-11-08 16:44:32,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:32,587 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 203 transitions. [2024-11-08 16:44:32,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 10 states have internal predecessors, (76), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:44:32,587 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 203 transitions. [2024-11-08 16:44:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 16:44:32,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:32,589 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:44:32,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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)] Ended with exit code 0 [2024-11-08 16:44:32,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:44:32,789 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:44:32,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:32,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1749659461, now seen corresponding path program 1 times [2024-11-08 16:44:32,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:44:32,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050864548] [2024-11-08 16:44:32,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:32,791 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:44:32,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:44:32,802 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:44:32,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (22)] Waiting until timeout for monitored process [2024-11-08 16:44:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:33,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-08 16:44:33,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:44:33,897 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 52 treesize of output 43 [2024-11-08 16:44:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-08 16:44:34,255 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:44:34,256 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:44:34,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050864548] [2024-11-08 16:44:34,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050864548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:44:34,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:44:34,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 16:44:34,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392482211] [2024-11-08 16:44:34,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:44:34,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 16:44:34,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:44:34,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 16:44:34,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:44:34,258 INFO L87 Difference]: Start difference. First operand 155 states and 203 transitions. Second operand has 14 states, 12 states have (on average 6.333333333333333) internal successors, (76), 13 states have internal predecessors, (76), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:44:37,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:37,364 INFO L93 Difference]: Finished difference Result 402 states and 524 transitions. [2024-11-08 16:44:37,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 16:44:37,366 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.333333333333333) internal successors, (76), 13 states have internal predecessors, (76), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 127 [2024-11-08 16:44:37,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:37,368 INFO L225 Difference]: With dead ends: 402 [2024-11-08 16:44:37,368 INFO L226 Difference]: Without dead ends: 250 [2024-11-08 16:44:37,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2024-11-08 16:44:37,370 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 337 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:37,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1309 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 16:44:37,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-08 16:44:37,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 158. [2024-11-08 16:44:37,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 142 states have (on average 1.267605633802817) internal successors, (180), 142 states have internal predecessors, (180), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:44:37,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 204 transitions. [2024-11-08 16:44:37,405 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 204 transitions. Word has length 127 [2024-11-08 16:44:37,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:37,407 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 204 transitions. [2024-11-08 16:44:37,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.333333333333333) internal successors, (76), 13 states have internal predecessors, (76), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:44:37,408 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 204 transitions. [2024-11-08 16:44:37,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 16:44:37,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:37,410 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:44:37,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (22)] Ended with exit code 0 [2024-11-08 16:44:37,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:44:37,611 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:44:37,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:37,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1615645955, now seen corresponding path program 1 times [2024-11-08 16:44:37,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:44:37,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900300126] [2024-11-08 16:44:37,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:37,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:44:37,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:44:37,614 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:44:37,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (23)] Waiting until timeout for monitored process [2024-11-08 16:44:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:38,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-08 16:44:38,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:44:38,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-08 16:44:39,439 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 61 treesize of output 48 [2024-11-08 16:44:41,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:44:41,040 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 88 treesize of output 60 [2024-11-08 16:44:41,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 98 [2024-11-08 16:44:41,477 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-08 16:44:41,478 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:44:41,478 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:44:41,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900300126] [2024-11-08 16:44:41,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900300126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:44:41,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:44:41,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-08 16:44:41,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524406153] [2024-11-08 16:44:41,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:44:41,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 16:44:41,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:44:41,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 16:44:41,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-11-08 16:44:41,481 INFO L87 Difference]: Start difference. First operand 158 states and 204 transitions. Second operand has 21 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:44:52,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:52,333 INFO L93 Difference]: Finished difference Result 499 states and 647 transitions. [2024-11-08 16:44:52,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-08 16:44:52,335 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 127 [2024-11-08 16:44:52,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:52,337 INFO L225 Difference]: With dead ends: 499 [2024-11-08 16:44:52,337 INFO L226 Difference]: Without dead ends: 344 [2024-11-08 16:44:52,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=245, Invalid=1237, Unknown=0, NotChecked=0, Total=1482 [2024-11-08 16:44:52,339 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 446 mSDsluCounter, 2867 mSDsCounter, 0 mSdLazyCounter, 1932 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 3094 SdHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:52,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 3094 Invalid, 1961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1932 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2024-11-08 16:44:52,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-08 16:44:52,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 164. [2024-11-08 16:44:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 148 states have (on average 1.2702702702702702) internal successors, (188), 148 states have internal predecessors, (188), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:44:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 212 transitions. [2024-11-08 16:44:52,372 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 212 transitions. Word has length 127 [2024-11-08 16:44:52,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:52,373 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 212 transitions. [2024-11-08 16:44:52,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:44:52,373 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 212 transitions. [2024-11-08 16:44:52,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 16:44:52,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:52,375 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:44:52,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (23)] Forceful destruction successful, exit code 0 [2024-11-08 16:44:52,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:44:52,576 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:44:52,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:52,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1396791237, now seen corresponding path program 1 times [2024-11-08 16:44:52,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:44:52,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930489224] [2024-11-08 16:44:52,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:52,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:44:52,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:44:52,581 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:44:52,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (24)] Waiting until timeout for monitored process [2024-11-08 16:44:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:53,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-08 16:44:53,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:44:53,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-08 16:44:54,576 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 60 treesize of output 47 [2024-11-08 16:44:55,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:44:55,779 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 64 treesize of output 40 [2024-11-08 16:44:55,975 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 107 treesize of output 83 [2024-11-08 16:44:56,148 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-08 16:44:56,148 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:44:56,148 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:44:56,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930489224] [2024-11-08 16:44:56,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930489224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:44:56,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:44:56,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-08 16:44:56,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701069400] [2024-11-08 16:44:56,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:44:56,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 16:44:56,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:44:56,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 16:44:56,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2024-11-08 16:44:56,152 INFO L87 Difference]: Start difference. First operand 164 states and 212 transitions. Second operand has 20 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:45:04,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:04,641 INFO L93 Difference]: Finished difference Result 515 states and 667 transitions. [2024-11-08 16:45:04,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-08 16:45:04,642 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 127 [2024-11-08 16:45:04,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:04,644 INFO L225 Difference]: With dead ends: 515 [2024-11-08 16:45:04,644 INFO L226 Difference]: Without dead ends: 354 [2024-11-08 16:45:04,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=240, Invalid=1166, Unknown=0, NotChecked=0, Total=1406 [2024-11-08 16:45:04,646 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 522 mSDsluCounter, 2484 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 2740 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:04,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 2740 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-11-08 16:45:04,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-08 16:45:04,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 166. [2024-11-08 16:45:04,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 150 states have internal predecessors, (191), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:45:04,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 215 transitions. [2024-11-08 16:45:04,676 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 215 transitions. Word has length 127 [2024-11-08 16:45:04,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:04,676 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 215 transitions. [2024-11-08 16:45:04,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:45:04,677 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 215 transitions. [2024-11-08 16:45:04,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 16:45:04,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:04,678 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:45:04,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (24)] Ended with exit code 0 [2024-11-08 16:45:04,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:04,879 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:04,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:04,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1549199093, now seen corresponding path program 1 times [2024-11-08 16:45:04,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:45:04,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086681186] [2024-11-08 16:45:04,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:04,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:04,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:45:04,882 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:45:04,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (25)] Waiting until timeout for monitored process [2024-11-08 16:45:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:05,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:45:05,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:45:05,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 16:45:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-08 16:45:06,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:45:06,299 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:45:06,299 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:45:06,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086681186] [2024-11-08 16:45:06,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086681186] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:45:06,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:45:06,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-08 16:45:06,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077501056] [2024-11-08 16:45:06,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:06,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:45:06,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:45:06,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:45:06,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:45:06,302 INFO L87 Difference]: Start difference. First operand 166 states and 215 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:45:06,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:06,412 INFO L93 Difference]: Finished difference Result 358 states and 463 transitions. [2024-11-08 16:45:06,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:45:06,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-08 16:45:06,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:06,414 INFO L225 Difference]: With dead ends: 358 [2024-11-08 16:45:06,414 INFO L226 Difference]: Without dead ends: 195 [2024-11-08 16:45:06,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:45:06,415 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 102 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:06,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 439 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:45:06,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-08 16:45:06,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 166. [2024-11-08 16:45:06,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 150 states have (on average 1.2466666666666666) internal successors, (187), 150 states have internal predecessors, (187), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:45:06,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 211 transitions. [2024-11-08 16:45:06,441 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 211 transitions. Word has length 128 [2024-11-08 16:45:06,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:06,441 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 211 transitions. [2024-11-08 16:45:06,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:45:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 211 transitions. [2024-11-08 16:45:06,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 16:45:06,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:06,443 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:45:06,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (25)] Ended with exit code 0 [2024-11-08 16:45:06,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:06,643 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:06,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:06,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1085181540, now seen corresponding path program 1 times [2024-11-08 16:45:06,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:45:06,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601407459] [2024-11-08 16:45:06,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:06,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:06,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:45:06,648 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:45:06,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (26)] Waiting until timeout for monitored process [2024-11-08 16:45:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:07,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 16:45:07,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:45:07,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2024-11-08 16:45:07,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:45:07,985 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 76 treesize of output 50 [2024-11-08 16:45:08,216 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 115 treesize of output 87 [2024-11-08 16:45:08,331 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:45:08,331 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:45:08,331 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:45:08,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601407459] [2024-11-08 16:45:08,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601407459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:08,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:08,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 16:45:08,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679347062] [2024-11-08 16:45:08,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:08,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 16:45:08,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:45:08,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 16:45:08,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:45:08,333 INFO L87 Difference]: Start difference. First operand 166 states and 211 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:45:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:12,392 INFO L93 Difference]: Finished difference Result 614 states and 789 transitions. [2024-11-08 16:45:12,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 16:45:12,393 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2024-11-08 16:45:12,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:12,395 INFO L225 Difference]: With dead ends: 614 [2024-11-08 16:45:12,395 INFO L226 Difference]: Without dead ends: 451 [2024-11-08 16:45:12,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:45:12,397 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 366 mSDsluCounter, 2203 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:12,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 2570 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-08 16:45:12,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-08 16:45:12,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 168. [2024-11-08 16:45:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 152 states have (on average 1.25) internal successors, (190), 152 states have internal predecessors, (190), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:45:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 214 transitions. [2024-11-08 16:45:12,426 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 214 transitions. Word has length 129 [2024-11-08 16:45:12,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:12,426 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 214 transitions. [2024-11-08 16:45:12,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:45:12,427 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 214 transitions. [2024-11-08 16:45:12,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 16:45:12,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:12,428 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:45:12,440 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (26)] Ended with exit code 0 [2024-11-08 16:45:12,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:12,629 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:12,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:12,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1147221154, now seen corresponding path program 1 times [2024-11-08 16:45:12,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:45:12,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705111811] [2024-11-08 16:45:12,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:12,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:12,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:45:12,631 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:45:12,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (27)] Waiting until timeout for monitored process [2024-11-08 16:45:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:13,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 16:45:13,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:45:13,181 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 26 treesize of output 22 [2024-11-08 16:45:13,520 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 33 treesize of output 21 [2024-11-08 16:45:13,702 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 69 [2024-11-08 16:45:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:45:13,788 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:45:13,788 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:45:13,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705111811] [2024-11-08 16:45:13,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705111811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:13,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:13,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:45:13,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235493513] [2024-11-08 16:45:13,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:13,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:45:13,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:45:13,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:45:13,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:45:13,791 INFO L87 Difference]: Start difference. First operand 168 states and 214 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:45:15,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:15,808 INFO L93 Difference]: Finished difference Result 536 states and 683 transitions. [2024-11-08 16:45:15,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:45:15,809 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2024-11-08 16:45:15,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:15,811 INFO L225 Difference]: With dead ends: 536 [2024-11-08 16:45:15,811 INFO L226 Difference]: Without dead ends: 371 [2024-11-08 16:45:15,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:45:15,813 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 307 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:15,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 1576 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 16:45:15,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-08 16:45:15,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 158. [2024-11-08 16:45:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 142 states have (on average 1.2464788732394365) internal successors, (177), 142 states have internal predecessors, (177), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:45:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 201 transitions. [2024-11-08 16:45:15,848 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 201 transitions. Word has length 129 [2024-11-08 16:45:15,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:15,849 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 201 transitions. [2024-11-08 16:45:15,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:45:15,849 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 201 transitions. [2024-11-08 16:45:15,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 16:45:15,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:15,850 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:45:15,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (27)] Forceful destruction successful, exit code 0 [2024-11-08 16:45:16,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:16,051 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:16,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:16,051 INFO L85 PathProgramCache]: Analyzing trace with hash 148785054, now seen corresponding path program 1 times [2024-11-08 16:45:16,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:45:16,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52106848] [2024-11-08 16:45:16,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:16,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:16,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:45:16,053 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:45:16,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (28)] Waiting until timeout for monitored process [2024-11-08 16:45:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:16,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-08 16:45:16,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:45:16,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 16:45:17,189 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 53 treesize of output 44 [2024-11-08 16:45:18,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:45:18,491 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 91 treesize of output 59 [2024-11-08 16:45:18,690 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 104 treesize of output 80 [2024-11-08 16:45:18,869 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-08 16:45:18,870 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:45:18,870 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:45:18,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52106848] [2024-11-08 16:45:18,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52106848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:18,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:18,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-08 16:45:18,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446670333] [2024-11-08 16:45:18,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:18,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 16:45:18,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:45:18,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 16:45:18,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-11-08 16:45:18,872 INFO L87 Difference]: Start difference. First operand 158 states and 201 transitions. Second operand has 20 states, 18 states have (on average 4.333333333333333) internal successors, (78), 19 states have internal predecessors, (78), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:45:27,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:27,262 INFO L93 Difference]: Finished difference Result 480 states and 618 transitions. [2024-11-08 16:45:27,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-08 16:45:27,263 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 4.333333333333333) internal successors, (78), 19 states have internal predecessors, (78), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 129 [2024-11-08 16:45:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:27,265 INFO L225 Difference]: With dead ends: 480 [2024-11-08 16:45:27,265 INFO L226 Difference]: Without dead ends: 325 [2024-11-08 16:45:27,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=195, Invalid=1065, Unknown=0, NotChecked=0, Total=1260 [2024-11-08 16:45:27,267 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 310 mSDsluCounter, 3217 mSDsCounter, 0 mSdLazyCounter, 2155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 3469 SdHoareTripleChecker+Invalid, 2162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:27,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 3469 Invalid, 2162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2155 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-08 16:45:27,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-08 16:45:27,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 145. [2024-11-08 16:45:27,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 129 states have (on average 1.248062015503876) internal successors, (161), 129 states have internal predecessors, (161), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:45:27,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 185 transitions. [2024-11-08 16:45:27,303 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 185 transitions. Word has length 129 [2024-11-08 16:45:27,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:27,304 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 185 transitions. [2024-11-08 16:45:27,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 4.333333333333333) internal successors, (78), 19 states have internal predecessors, (78), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:45:27,305 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 185 transitions. [2024-11-08 16:45:27,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 16:45:27,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:27,306 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:45:27,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (28)] Ended with exit code 0 [2024-11-08 16:45:27,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:27,506 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:27,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:27,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2111472004, now seen corresponding path program 1 times [2024-11-08 16:45:27,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:45:27,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658836274] [2024-11-08 16:45:27,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:27,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:27,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:45:27,509 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:45:27,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (29)] Waiting until timeout for monitored process [2024-11-08 16:45:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:28,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 16:45:28,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:45:28,716 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 34 treesize of output 30 [2024-11-08 16:45:29,808 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-08 16:45:29,808 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:45:29,808 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:45:29,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658836274] [2024-11-08 16:45:29,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658836274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:29,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:29,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 16:45:29,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996448450] [2024-11-08 16:45:29,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:29,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 16:45:29,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:45:29,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 16:45:29,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:45:29,811 INFO L87 Difference]: Start difference. First operand 145 states and 185 transitions. Second operand has 17 states, 15 states have (on average 5.2) internal successors, (78), 16 states have internal predecessors, (78), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:45:33,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:33,800 INFO L93 Difference]: Finished difference Result 397 states and 507 transitions. [2024-11-08 16:45:33,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-08 16:45:33,801 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 5.2) internal successors, (78), 16 states have internal predecessors, (78), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 129 [2024-11-08 16:45:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:33,803 INFO L225 Difference]: With dead ends: 397 [2024-11-08 16:45:33,803 INFO L226 Difference]: Without dead ends: 255 [2024-11-08 16:45:33,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2024-11-08 16:45:33,805 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 334 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:33,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1782 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 16:45:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-08 16:45:33,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 182. [2024-11-08 16:45:33,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 166 states have (on average 1.2349397590361446) internal successors, (205), 166 states have internal predecessors, (205), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:45:33,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 229 transitions. [2024-11-08 16:45:33,839 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 229 transitions. Word has length 129 [2024-11-08 16:45:33,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:33,840 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 229 transitions. [2024-11-08 16:45:33,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 5.2) internal successors, (78), 16 states have internal predecessors, (78), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:45:33,840 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 229 transitions. [2024-11-08 16:45:33,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 16:45:33,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:33,842 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:45:33,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (29)] Ended with exit code 0 [2024-11-08 16:45:34,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:34,042 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:34,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:34,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2121455678, now seen corresponding path program 1 times [2024-11-08 16:45:34,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:45:34,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852446615] [2024-11-08 16:45:34,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:34,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:34,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:45:34,045 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:45:34,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (30)] Waiting until timeout for monitored process [2024-11-08 16:45:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:34,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:45:34,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:45:34,799 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 48 treesize of output 24 [2024-11-08 16:45:34,862 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:45:34,863 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:45:34,863 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:45:34,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852446615] [2024-11-08 16:45:34,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852446615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:34,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:34,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:45:34,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800662027] [2024-11-08 16:45:34,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:34,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:45:34,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:45:34,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:45:34,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:45:34,865 INFO L87 Difference]: Start difference. First operand 182 states and 229 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:45:35,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:35,469 INFO L93 Difference]: Finished difference Result 480 states and 603 transitions. [2024-11-08 16:45:35,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:45:35,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2024-11-08 16:45:35,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:35,471 INFO L225 Difference]: With dead ends: 480 [2024-11-08 16:45:35,471 INFO L226 Difference]: Without dead ends: 301 [2024-11-08 16:45:35,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:45:35,472 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 106 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:35,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 509 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:45:35,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-08 16:45:35,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 218. [2024-11-08 16:45:35,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 202 states have (on average 1.2227722772277227) internal successors, (247), 202 states have internal predecessors, (247), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:45:35,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 271 transitions. [2024-11-08 16:45:35,507 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 271 transitions. Word has length 129 [2024-11-08 16:45:35,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:35,507 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 271 transitions. [2024-11-08 16:45:35,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:45:35,507 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 271 transitions. [2024-11-08 16:45:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 16:45:35,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:35,509 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:45:35,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (30)] Forceful destruction successful, exit code 0 [2024-11-08 16:45:35,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:35,710 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:35,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:35,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1586705604, now seen corresponding path program 1 times [2024-11-08 16:45:35,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:45:35,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311226222] [2024-11-08 16:45:35,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:35,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:35,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:45:35,715 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:45:35,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (31)] Waiting until timeout for monitored process [2024-11-08 16:45:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:36,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 16:45:36,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:45:36,325 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 34 treesize of output 30 [2024-11-08 16:45:36,533 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:45:36,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:45:36,533 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:45:36,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311226222] [2024-11-08 16:45:36,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311226222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:36,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:36,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:45:36,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19900375] [2024-11-08 16:45:36,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:36,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:45:36,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:45:36,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:45:36,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:45:36,535 INFO L87 Difference]: Start difference. First operand 218 states and 271 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:45:37,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:37,183 INFO L93 Difference]: Finished difference Result 536 states and 668 transitions. [2024-11-08 16:45:37,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:45:37,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2024-11-08 16:45:37,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:37,186 INFO L225 Difference]: With dead ends: 536 [2024-11-08 16:45:37,186 INFO L226 Difference]: Without dead ends: 321 [2024-11-08 16:45:37,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:45:37,188 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 95 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:37,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 795 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:45:37,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-08 16:45:37,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 248. [2024-11-08 16:45:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 232 states have (on average 1.206896551724138) internal successors, (280), 232 states have internal predecessors, (280), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:45:37,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 304 transitions. [2024-11-08 16:45:37,230 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 304 transitions. Word has length 129 [2024-11-08 16:45:37,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:37,230 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 304 transitions. [2024-11-08 16:45:37,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:45:37,231 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 304 transitions. [2024-11-08 16:45:37,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 16:45:37,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:37,232 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:45:37,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (31)] Ended with exit code 0 [2024-11-08 16:45:37,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:37,433 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:37,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:37,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1811792678, now seen corresponding path program 1 times [2024-11-08 16:45:37,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:45:37,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181491417] [2024-11-08 16:45:37,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:37,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:37,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:45:37,438 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:45:37,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (32)] Waiting until timeout for monitored process [2024-11-08 16:45:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:45:38,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:45:38,054 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 14 treesize of output 10 [2024-11-08 16:45:38,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2024-11-08 16:45:38,224 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:45:38,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:45:38,225 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:45:38,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181491417] [2024-11-08 16:45:38,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181491417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:38,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:38,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:45:38,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252218790] [2024-11-08 16:45:38,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:38,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:45:38,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:45:38,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:45:38,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:45:38,227 INFO L87 Difference]: Start difference. First operand 248 states and 304 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:45:38,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:38,576 INFO L93 Difference]: Finished difference Result 736 states and 904 transitions. [2024-11-08 16:45:38,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:45:38,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 130 [2024-11-08 16:45:38,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:38,580 INFO L225 Difference]: With dead ends: 736 [2024-11-08 16:45:38,580 INFO L226 Difference]: Without dead ends: 491 [2024-11-08 16:45:38,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:45:38,581 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 115 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:38,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1083 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:45:38,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-08 16:45:38,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 477. [2024-11-08 16:45:38,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 446 states have (on average 1.2062780269058295) internal successors, (538), 446 states have internal predecessors, (538), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 16:45:38,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 586 transitions. [2024-11-08 16:45:38,666 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 586 transitions. Word has length 130 [2024-11-08 16:45:38,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:38,667 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 586 transitions. [2024-11-08 16:45:38,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:45:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 586 transitions. [2024-11-08 16:45:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 16:45:38,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:38,669 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:45:38,684 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (32)] Ended with exit code 0 [2024-11-08 16:45:38,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:38,870 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:38,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:38,870 INFO L85 PathProgramCache]: Analyzing trace with hash 111435356, now seen corresponding path program 1 times [2024-11-08 16:45:38,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:45:38,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851418406] [2024-11-08 16:45:38,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:38,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:38,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:45:38,872 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:45:38,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (33)] Waiting until timeout for monitored process [2024-11-08 16:45:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 16:45:39,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:45:39,530 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 26 treesize of output 22 [2024-11-08 16:45:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:45:41,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:45:41,309 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:45:41,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851418406] [2024-11-08 16:45:41,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851418406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:41,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:41,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 16:45:41,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997281785] [2024-11-08 16:45:41,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:41,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 16:45:41,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:45:41,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 16:45:41,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:45:41,311 INFO L87 Difference]: Start difference. First operand 477 states and 586 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:45:46,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:46,073 INFO L93 Difference]: Finished difference Result 1631 states and 2038 transitions. [2024-11-08 16:45:46,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 16:45:46,074 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 130 [2024-11-08 16:45:46,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:46,077 INFO L225 Difference]: With dead ends: 1631 [2024-11-08 16:45:46,077 INFO L226 Difference]: Without dead ends: 1157 [2024-11-08 16:45:46,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:45:46,078 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 318 mSDsluCounter, 2106 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 2469 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:46,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 2469 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-08 16:45:46,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-11-08 16:45:46,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 565. [2024-11-08 16:45:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 534 states have (on average 1.205992509363296) internal successors, (644), 534 states have internal predecessors, (644), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 16:45:46,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 692 transitions. [2024-11-08 16:45:46,145 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 692 transitions. Word has length 130 [2024-11-08 16:45:46,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:46,145 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 692 transitions. [2024-11-08 16:45:46,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:45:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 692 transitions. [2024-11-08 16:45:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 16:45:46,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:46,147 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:45:46,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (33)] Ended with exit code 0 [2024-11-08 16:45:46,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:46,349 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:46,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:46,349 INFO L85 PathProgramCache]: Analyzing trace with hash -398037734, now seen corresponding path program 1 times [2024-11-08 16:45:46,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:45:46,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121225480] [2024-11-08 16:45:46,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:46,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:46,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:45:46,354 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:45:46,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (34)] Waiting until timeout for monitored process [2024-11-08 16:45:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:46,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 16:45:46,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:45:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-08 16:45:47,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:45:47,911 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:45:47,912 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:45:47,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121225480] [2024-11-08 16:45:47,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121225480] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:45:47,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:45:47,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2024-11-08 16:45:47,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400811885] [2024-11-08 16:45:47,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:47,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:45:47,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:45:47,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:45:47,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:45:47,914 INFO L87 Difference]: Start difference. First operand 565 states and 692 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:45:48,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:48,107 INFO L93 Difference]: Finished difference Result 1191 states and 1457 transitions. [2024-11-08 16:45:48,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:45:48,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 130 [2024-11-08 16:45:48,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:48,110 INFO L225 Difference]: With dead ends: 1191 [2024-11-08 16:45:48,110 INFO L226 Difference]: Without dead ends: 629 [2024-11-08 16:45:48,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:45:48,112 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 57 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:48,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 547 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:45:48,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-08 16:45:48,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 535. [2024-11-08 16:45:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 504 states have (on average 1.2003968253968254) internal successors, (605), 504 states have internal predecessors, (605), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 16:45:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 653 transitions. [2024-11-08 16:45:48,199 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 653 transitions. Word has length 130 [2024-11-08 16:45:48,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:48,199 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 653 transitions. [2024-11-08 16:45:48,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:45:48,199 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 653 transitions. [2024-11-08 16:45:48,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 16:45:48,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:48,201 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:45:48,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (34)] Ended with exit code 0 [2024-11-08 16:45:48,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:48,402 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:48,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:48,402 INFO L85 PathProgramCache]: Analyzing trace with hash -875908512, now seen corresponding path program 1 times [2024-11-08 16:45:48,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:45:48,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059986148] [2024-11-08 16:45:48,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:48,403 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:48,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:45:48,405 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:45:48,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (35)] Waiting until timeout for monitored process [2024-11-08 16:45:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:49,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 16:45:49,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:45:49,878 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 89 treesize of output 77 [2024-11-08 16:45:49,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:45:49,888 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 87 treesize of output 53 [2024-11-08 16:45:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:45:49,968 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:45:49,968 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:45:49,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059986148] [2024-11-08 16:45:49,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059986148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:49,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:49,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:45:49,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444148552] [2024-11-08 16:45:49,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:49,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:45:49,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:45:49,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:45:49,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:45:49,970 INFO L87 Difference]: Start difference. First operand 535 states and 653 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:45:53,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:53,487 INFO L93 Difference]: Finished difference Result 1437 states and 1775 transitions. [2024-11-08 16:45:53,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:45:53,488 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 130 [2024-11-08 16:45:53,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:53,490 INFO L225 Difference]: With dead ends: 1437 [2024-11-08 16:45:53,491 INFO L226 Difference]: Without dead ends: 905 [2024-11-08 16:45:53,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:45:53,492 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 193 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:53,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1817 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 16:45:53,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-11-08 16:45:53,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 277. [2024-11-08 16:45:53,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 261 states have (on average 1.1954022988505748) internal successors, (312), 261 states have internal predecessors, (312), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:45:53,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 336 transitions. [2024-11-08 16:45:53,521 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 336 transitions. Word has length 130 [2024-11-08 16:45:53,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:53,522 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 336 transitions. [2024-11-08 16:45:53,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:45:53,523 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 336 transitions. [2024-11-08 16:45:53,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 16:45:53,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:53,524 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:45:53,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (35)] Ended with exit code 0 [2024-11-08 16:45:53,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:53,725 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:53,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:53,725 INFO L85 PathProgramCache]: Analyzing trace with hash 475587927, now seen corresponding path program 1 times [2024-11-08 16:45:53,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:45:53,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463978673] [2024-11-08 16:45:53,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:53,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:53,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:45:53,728 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:45:53,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (36)] Waiting until timeout for monitored process [2024-11-08 16:45:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:54,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 16:45:54,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:45:55,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 34 [2024-11-08 16:45:55,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-11-08 16:45:55,704 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-08 16:45:55,704 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:45:55,704 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:45:55,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463978673] [2024-11-08 16:45:55,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1463978673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:55,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:55,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 16:45:55,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630555289] [2024-11-08 16:45:55,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:55,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 16:45:55,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:45:55,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 16:45:55,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:45:55,707 INFO L87 Difference]: Start difference. First operand 277 states and 336 transitions. Second operand has 15 states, 13 states have (on average 6.153846153846154) internal successors, (80), 14 states have internal predecessors, (80), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:45:59,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:59,226 INFO L93 Difference]: Finished difference Result 624 states and 765 transitions. [2024-11-08 16:45:59,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 16:45:59,227 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.153846153846154) internal successors, (80), 14 states have internal predecessors, (80), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 131 [2024-11-08 16:45:59,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:59,228 INFO L225 Difference]: With dead ends: 624 [2024-11-08 16:45:59,228 INFO L226 Difference]: Without dead ends: 350 [2024-11-08 16:45:59,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2024-11-08 16:45:59,229 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 201 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:59,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1500 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 16:45:59,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-08 16:45:59,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 278. [2024-11-08 16:45:59,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 262 states have (on average 1.1946564885496183) internal successors, (313), 262 states have internal predecessors, (313), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:45:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 337 transitions. [2024-11-08 16:45:59,263 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 337 transitions. Word has length 131 [2024-11-08 16:45:59,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:59,263 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 337 transitions. [2024-11-08 16:45:59,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.153846153846154) internal successors, (80), 14 states have internal predecessors, (80), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:45:59,264 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 337 transitions. [2024-11-08 16:45:59,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 16:45:59,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:59,265 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:45:59,283 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (36)] Ended with exit code 0 [2024-11-08 16:45:59,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:59,466 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:59,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:59,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1062393941, now seen corresponding path program 1 times [2024-11-08 16:45:59,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:45:59,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353164665] [2024-11-08 16:45:59,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:59,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:59,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:45:59,469 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:45:59,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (37)] Waiting until timeout for monitored process [2024-11-08 16:46:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:00,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:46:00,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:00,223 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 49 treesize of output 25 [2024-11-08 16:46:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:46:00,284 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:46:00,284 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:00,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353164665] [2024-11-08 16:46:00,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353164665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:00,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:00,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:46:00,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131722708] [2024-11-08 16:46:00,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:00,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:46:00,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:00,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:46:00,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:46:00,286 INFO L87 Difference]: Start difference. First operand 278 states and 337 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:46:00,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:00,892 INFO L93 Difference]: Finished difference Result 637 states and 777 transitions. [2024-11-08 16:46:00,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:46:00,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 131 [2024-11-08 16:46:00,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:00,896 INFO L225 Difference]: With dead ends: 637 [2024-11-08 16:46:00,896 INFO L226 Difference]: Without dead ends: 362 [2024-11-08 16:46:00,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:46:00,897 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 101 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:00,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 619 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:46:00,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-08 16:46:00,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 278. [2024-11-08 16:46:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 262 states have (on average 1.1908396946564885) internal successors, (312), 262 states have internal predecessors, (312), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:46:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 336 transitions. [2024-11-08 16:46:00,936 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 336 transitions. Word has length 131 [2024-11-08 16:46:00,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:00,936 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 336 transitions. [2024-11-08 16:46:00,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:46:00,937 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 336 transitions. [2024-11-08 16:46:00,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 16:46:00,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:00,938 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:46:00,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (37)] Ended with exit code 0 [2024-11-08 16:46:01,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:01,140 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:01,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:01,140 INFO L85 PathProgramCache]: Analyzing trace with hash -562062399, now seen corresponding path program 1 times [2024-11-08 16:46:01,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:01,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446173043] [2024-11-08 16:46:01,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:01,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:01,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:01,146 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:46:01,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (38)] Waiting until timeout for monitored process [2024-11-08 16:46:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:01,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 16:46:01,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:02,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2024-11-08 16:46:03,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 33 [2024-11-08 16:46:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-08 16:46:03,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:46:03,168 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:03,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446173043] [2024-11-08 16:46:03,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446173043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:03,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:03,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 16:46:03,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732688151] [2024-11-08 16:46:03,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:03,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 16:46:03,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:03,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 16:46:03,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:46:03,171 INFO L87 Difference]: Start difference. First operand 278 states and 336 transitions. Second operand has 15 states, 13 states have (on average 6.153846153846154) internal successors, (80), 14 states have internal predecessors, (80), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:46:05,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:05,956 INFO L93 Difference]: Finished difference Result 621 states and 757 transitions. [2024-11-08 16:46:05,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 16:46:05,957 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.153846153846154) internal successors, (80), 14 states have internal predecessors, (80), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 131 [2024-11-08 16:46:05,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:05,958 INFO L225 Difference]: With dead ends: 621 [2024-11-08 16:46:05,958 INFO L226 Difference]: Without dead ends: 346 [2024-11-08 16:46:05,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2024-11-08 16:46:05,959 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 424 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:05,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 880 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 16:46:05,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-08 16:46:06,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 279. [2024-11-08 16:46:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 263 states have (on average 1.1901140684410647) internal successors, (313), 263 states have internal predecessors, (313), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:46:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 337 transitions. [2024-11-08 16:46:06,002 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 337 transitions. Word has length 131 [2024-11-08 16:46:06,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:06,002 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 337 transitions. [2024-11-08 16:46:06,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.153846153846154) internal successors, (80), 14 states have internal predecessors, (80), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:46:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 337 transitions. [2024-11-08 16:46:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 16:46:06,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:06,004 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:46:06,021 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (38)] Ended with exit code 0 [2024-11-08 16:46:06,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:06,205 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:06,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:06,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1166469165, now seen corresponding path program 1 times [2024-11-08 16:46:06,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:06,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [928636342] [2024-11-08 16:46:06,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:06,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:06,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:06,210 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:46:06,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (39)] Waiting until timeout for monitored process [2024-11-08 16:46:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:06,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:46:06,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:06,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-08 16:46:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:46:07,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:46:07,033 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:07,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [928636342] [2024-11-08 16:46:07,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [928636342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:07,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:07,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:46:07,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434421291] [2024-11-08 16:46:07,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:07,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:46:07,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:07,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:46:07,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:46:07,039 INFO L87 Difference]: Start difference. First operand 279 states and 337 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:46:08,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:08,070 INFO L93 Difference]: Finished difference Result 555 states and 671 transitions. [2024-11-08 16:46:08,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:46:08,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 131 [2024-11-08 16:46:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:08,073 INFO L225 Difference]: With dead ends: 555 [2024-11-08 16:46:08,074 INFO L226 Difference]: Without dead ends: 279 [2024-11-08 16:46:08,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:46:08,075 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:08,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 16:46:08,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-08 16:46:08,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2024-11-08 16:46:08,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 263 states have (on average 1.1863117870722433) internal successors, (312), 263 states have internal predecessors, (312), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:46:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 336 transitions. [2024-11-08 16:46:08,123 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 336 transitions. Word has length 131 [2024-11-08 16:46:08,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:08,123 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 336 transitions. [2024-11-08 16:46:08,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:46:08,124 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 336 transitions. [2024-11-08 16:46:08,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 16:46:08,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:08,125 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:46:08,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (39)] Forceful destruction successful, exit code 0 [2024-11-08 16:46:08,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:08,326 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:08,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:08,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1559496175, now seen corresponding path program 1 times [2024-11-08 16:46:08,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:08,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979688177] [2024-11-08 16:46:08,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:08,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:08,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:08,328 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:46:08,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (40)] Waiting until timeout for monitored process [2024-11-08 16:46:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:09,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 16:46:09,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:09,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-08 16:46:09,612 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 28 treesize of output 23 [2024-11-08 16:46:09,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:46:09,993 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 62 treesize of output 32 [2024-11-08 16:46:10,070 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-08 16:46:10,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:46:10,070 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:10,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979688177] [2024-11-08 16:46:10,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1979688177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:10,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:10,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:46:10,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57996374] [2024-11-08 16:46:10,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:10,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:46:10,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:10,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:46:10,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:46:10,072 INFO L87 Difference]: Start difference. First operand 279 states and 336 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:46:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:10,446 INFO L93 Difference]: Finished difference Result 322 states and 391 transitions. [2024-11-08 16:46:10,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:46:10,446 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 131 [2024-11-08 16:46:10,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:10,448 INFO L225 Difference]: With dead ends: 322 [2024-11-08 16:46:10,448 INFO L226 Difference]: Without dead ends: 320 [2024-11-08 16:46:10,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:46:10,448 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 131 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:10,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 726 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:46:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-08 16:46:10,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 319. [2024-11-08 16:46:10,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 296 states have (on average 1.1891891891891893) internal successors, (352), 297 states have internal predecessors, (352), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:46:10,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 388 transitions. [2024-11-08 16:46:10,495 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 388 transitions. Word has length 131 [2024-11-08 16:46:10,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:10,496 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 388 transitions. [2024-11-08 16:46:10,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:46:10,496 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 388 transitions. [2024-11-08 16:46:10,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 16:46:10,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:10,497 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:46:10,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (40)] Forceful destruction successful, exit code 0 [2024-11-08 16:46:10,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:10,698 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:10,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:10,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1557649133, now seen corresponding path program 1 times [2024-11-08 16:46:10,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:10,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653795311] [2024-11-08 16:46:10,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:10,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:10,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:10,701 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:46:10,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (41)] Waiting until timeout for monitored process [2024-11-08 16:46:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:11,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 16:46:11,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:11,765 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 16:46:11,844 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 16:46:11,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-08 16:46:13,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:46:13,120 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 120 treesize of output 62 [2024-11-08 16:46:13,251 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-08 16:46:13,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:46:13,251 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:13,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653795311] [2024-11-08 16:46:13,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653795311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:13,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:13,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 16:46:13,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793511045] [2024-11-08 16:46:13,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:13,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 16:46:13,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:13,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 16:46:13,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:46:13,253 INFO L87 Difference]: Start difference. First operand 319 states and 388 transitions. Second operand has 14 states, 13 states have (on average 5.923076923076923) internal successors, (77), 14 states have internal predecessors, (77), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:46:17,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:17,256 INFO L93 Difference]: Finished difference Result 683 states and 824 transitions. [2024-11-08 16:46:17,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 16:46:17,257 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.923076923076923) internal successors, (77), 14 states have internal predecessors, (77), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 131 [2024-11-08 16:46:17,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:17,258 INFO L225 Difference]: With dead ends: 683 [2024-11-08 16:46:17,259 INFO L226 Difference]: Without dead ends: 400 [2024-11-08 16:46:17,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 16:46:17,259 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 299 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:17,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1390 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 16:46:17,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-08 16:46:17,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 327. [2024-11-08 16:46:17,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 301 states have (on average 1.1827242524916943) internal successors, (356), 302 states have internal predecessors, (356), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 16:46:17,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 396 transitions. [2024-11-08 16:46:17,339 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 396 transitions. Word has length 131 [2024-11-08 16:46:17,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:17,340 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 396 transitions. [2024-11-08 16:46:17,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.923076923076923) internal successors, (77), 14 states have internal predecessors, (77), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:46:17,340 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 396 transitions. [2024-11-08 16:46:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 16:46:17,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:17,341 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:46:17,359 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (41)] Ended with exit code 0 [2024-11-08 16:46:17,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:17,542 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:17,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:17,542 INFO L85 PathProgramCache]: Analyzing trace with hash 217358229, now seen corresponding path program 1 times [2024-11-08 16:46:17,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:17,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734853391] [2024-11-08 16:46:17,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:17,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:17,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:17,544 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:46:17,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51e319ad-a601-4486-8a0e-78ba0c676ca8/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 (42)] Waiting until timeout for monitored process