./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya --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 d61c0dafed482002b011add1f5476de4fd21f0cbe5ef1ca0c06dd442b2a70902 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:21:00,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:21:00,142 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:21:00,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:21:00,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:21:00,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:21:00,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:21:00,171 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:21:00,172 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:21:00,172 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:21:00,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:21:00,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:21:00,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:21:00,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:21:00,175 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:21:00,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:21:00,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:21:00,176 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:21:00,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:21:00,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:21:00,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:21:00,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:21:00,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:21:00,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:21:00,179 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:21:00,180 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:21:00,180 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:21:00,180 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:21:00,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:21:00,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:21:00,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:21:00,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:21:00,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:21:00,182 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:21:00,183 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:21:00,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:21:00,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:21:00,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:21:00,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:21:00,184 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:21:00,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:21:00,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:21:00,184 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_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/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_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya 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 -> d61c0dafed482002b011add1f5476de4fd21f0cbe5ef1ca0c06dd442b2a70902 [2023-11-29 04:21:00,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:21:00,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:21:00,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:21:00,449 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:21:00,450 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:21:00,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i [2023-11-29 04:21:03,155 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:21:03,330 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:21:03,331 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i [2023-11-29 04:21:03,341 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/data/dbdbb4c49/17800a4f63de417ea9be5e7101d3c395/FLAG150059211 [2023-11-29 04:21:03,357 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/data/dbdbb4c49/17800a4f63de417ea9be5e7101d3c395 [2023-11-29 04:21:03,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:21:03,361 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:21:03,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:21:03,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:21:03,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:21:03,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:21:03" (1/1) ... [2023-11-29 04:21:03,370 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78e339de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:03, skipping insertion in model container [2023-11-29 04:21:03,370 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:21:03" (1/1) ... [2023-11-29 04:21:03,399 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:21:03,548 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i[915,928] [2023-11-29 04:21:03,592 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:21:03,605 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:21:03,619 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i[915,928] [2023-11-29 04:21:03,640 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:21:03,658 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:21:03,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:03 WrapperNode [2023-11-29 04:21:03,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:21:03,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:21:03,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:21:03,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:21:03,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:03" (1/1) ... [2023-11-29 04:21:03,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:03" (1/1) ... [2023-11-29 04:21:03,741 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2023-11-29 04:21:03,741 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:21:03,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:21:03,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:21:03,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:21:03,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:03" (1/1) ... [2023-11-29 04:21:03,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:03" (1/1) ... [2023-11-29 04:21:03,758 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:03" (1/1) ... [2023-11-29 04:21:03,772 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 04:21:03,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:03" (1/1) ... [2023-11-29 04:21:03,773 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:03" (1/1) ... [2023-11-29 04:21:03,780 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:03" (1/1) ... [2023-11-29 04:21:03,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:03" (1/1) ... [2023-11-29 04:21:03,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:03" (1/1) ... [2023-11-29 04:21:03,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:03" (1/1) ... [2023-11-29 04:21:03,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:21:03,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:21:03,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:21:03,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:21:03,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:03" (1/1) ... [2023-11-29 04:21:03,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:21:03,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:21:03,827 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:21:03,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:21:03,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:21:03,859 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:21:03,859 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:21:03,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:21:03,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:21:03,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:21:03,932 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:21:03,934 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:21:04,174 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:21:04,210 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:21:04,210 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:21:04,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:21:04 BoogieIcfgContainer [2023-11-29 04:21:04,211 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:21:04,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:21:04,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:21:04,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:21:04,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:21:03" (1/3) ... [2023-11-29 04:21:04,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320d1e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:21:04, skipping insertion in model container [2023-11-29 04:21:04,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:03" (2/3) ... [2023-11-29 04:21:04,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320d1e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:21:04, skipping insertion in model container [2023-11-29 04:21:04,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:21:04" (3/3) ... [2023-11-29 04:21:04,218 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-81.i [2023-11-29 04:21:04,232 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:21:04,233 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:21:04,274 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:21:04,280 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@20f2ab36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:21:04,280 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:21:04,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 38 states have (on average 1.5) internal successors, (57), 39 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:21:04,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 04:21:04,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:04,296 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:04,297 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:04,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:04,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1807602556, now seen corresponding path program 1 times [2023-11-29 04:21:04,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:04,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815504139] [2023-11-29 04:21:04,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:04,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:04,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:21:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:04,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:21:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:04,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:21:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:04,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:21:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:04,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 04:21:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:04,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 04:21:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:04,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:21:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:04,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:21:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:04,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:21:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:04,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:21:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:04,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:21:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:04,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:21:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:04,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 04:21:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:04,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 04:21:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:04,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 04:21:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:04,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:21:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:21:04,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:04,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815504139] [2023-11-29 04:21:04,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815504139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:04,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:04,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:21:04,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959585887] [2023-11-29 04:21:04,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:04,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:21:04,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:04,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:21:04,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:21:04,627 INFO L87 Difference]: Start difference. First operand has 57 states, 38 states have (on average 1.5) internal successors, (57), 39 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:21:04,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:04,668 INFO L93 Difference]: Finished difference Result 113 states and 193 transitions. [2023-11-29 04:21:04,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:21:04,670 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2023-11-29 04:21:04,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:04,678 INFO L225 Difference]: With dead ends: 113 [2023-11-29 04:21:04,679 INFO L226 Difference]: Without dead ends: 55 [2023-11-29 04:21:04,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:21:04,685 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:04,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:21:04,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-29 04:21:04,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-29 04:21:04,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:21:04,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2023-11-29 04:21:04,729 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 104 [2023-11-29 04:21:04,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:04,729 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2023-11-29 04:21:04,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:21:04,730 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2023-11-29 04:21:04,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 04:21:04,733 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:04,733 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:04,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:21:04,734 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:04,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:04,735 INFO L85 PathProgramCache]: Analyzing trace with hash -575632252, now seen corresponding path program 1 times [2023-11-29 04:21:04,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:04,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324086354] [2023-11-29 04:21:04,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:04,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:21:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:21:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:21:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:21:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 04:21:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 04:21:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:21:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:21:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:21:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:21:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:21:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:21:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 04:21:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 04:21:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 04:21:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:21:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,378 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:21:05,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:05,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324086354] [2023-11-29 04:21:05,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324086354] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:05,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:05,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:21:05,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013774234] [2023-11-29 04:21:05,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:05,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:21:05,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:05,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:21:05,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:21:05,384 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:21:05,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:05,619 INFO L93 Difference]: Finished difference Result 155 states and 230 transitions. [2023-11-29 04:21:05,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:21:05,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2023-11-29 04:21:05,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:05,623 INFO L225 Difference]: With dead ends: 155 [2023-11-29 04:21:05,623 INFO L226 Difference]: Without dead ends: 101 [2023-11-29 04:21:05,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:21:05,625 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 66 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:05,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 207 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:21:05,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-29 04:21:05,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2023-11-29 04:21:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 69 states have internal predecessors, (93), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 04:21:05,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 141 transitions. [2023-11-29 04:21:05,653 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 141 transitions. Word has length 104 [2023-11-29 04:21:05,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:05,654 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 141 transitions. [2023-11-29 04:21:05,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:21:05,654 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 141 transitions. [2023-11-29 04:21:05,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 04:21:05,657 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:05,657 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:05,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:21:05,658 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:05,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:05,658 INFO L85 PathProgramCache]: Analyzing trace with hash -317466814, now seen corresponding path program 1 times [2023-11-29 04:21:05,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:05,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043706232] [2023-11-29 04:21:05,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:05,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:21:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:21:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:21:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:21:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 04:21:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 04:21:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:21:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:21:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:21:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:21:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:21:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:21:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 04:21:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 04:21:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 04:21:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:21:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,883 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:21:05,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:05,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043706232] [2023-11-29 04:21:05,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043706232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:05,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:05,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:21:05,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485623701] [2023-11-29 04:21:05,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:05,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:21:05,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:05,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:21:05,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:21:05,887 INFO L87 Difference]: Start difference. First operand 95 states and 141 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:21:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:05,954 INFO L93 Difference]: Finished difference Result 197 states and 294 transitions. [2023-11-29 04:21:05,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:21:05,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2023-11-29 04:21:05,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:05,959 INFO L225 Difference]: With dead ends: 197 [2023-11-29 04:21:05,959 INFO L226 Difference]: Without dead ends: 103 [2023-11-29 04:21:05,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:21:05,962 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 5 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:05,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 193 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:21:05,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-29 04:21:05,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2023-11-29 04:21:05,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 71 states have internal predecessors, (95), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 04:21:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2023-11-29 04:21:05,983 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 104 [2023-11-29 04:21:05,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:05,984 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2023-11-29 04:21:05,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:21:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2023-11-29 04:21:05,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 04:21:05,987 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:05,987 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:05,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:21:05,987 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:05,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:05,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1256768779, now seen corresponding path program 1 times [2023-11-29 04:21:05,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:05,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122812650] [2023-11-29 04:21:05,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:05,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:21:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:21:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:21:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:21:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 04:21:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 04:21:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:21:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:21:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:21:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:21:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:21:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:21:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 04:21:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 04:21:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 04:21:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:21:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,215 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:21:06,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:06,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122812650] [2023-11-29 04:21:06,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122812650] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:06,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:06,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:21:06,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617522569] [2023-11-29 04:21:06,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:06,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:21:06,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:06,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:21:06,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:21:06,219 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:21:06,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:06,399 INFO L93 Difference]: Finished difference Result 262 states and 385 transitions. [2023-11-29 04:21:06,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:21:06,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2023-11-29 04:21:06,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:06,403 INFO L225 Difference]: With dead ends: 262 [2023-11-29 04:21:06,403 INFO L226 Difference]: Without dead ends: 166 [2023-11-29 04:21:06,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:21:06,405 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 104 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:06,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 291 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:21:06,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-11-29 04:21:06,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 151. [2023-11-29 04:21:06,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 108 states have internal predecessors, (144), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-29 04:21:06,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 224 transitions. [2023-11-29 04:21:06,439 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 224 transitions. Word has length 105 [2023-11-29 04:21:06,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:06,440 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 224 transitions. [2023-11-29 04:21:06,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:21:06,441 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 224 transitions. [2023-11-29 04:21:06,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 04:21:06,442 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:06,442 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:06,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:21:06,443 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:06,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:06,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1843574793, now seen corresponding path program 1 times [2023-11-29 04:21:06,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:06,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053093524] [2023-11-29 04:21:06,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:06,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:21:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:21:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:21:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:21:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 04:21:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 04:21:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:21:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:21:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:21:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:21:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:21:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:21:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 04:21:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 04:21:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 04:21:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:21:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,748 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-29 04:21:06,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:06,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053093524] [2023-11-29 04:21:06,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053093524] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:21:06,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598745210] [2023-11-29 04:21:06,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:06,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:21:06,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:21:06,753 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:21:06,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 04:21:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:06,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 04:21:06,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:21:06,979 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 145 proven. 6 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2023-11-29 04:21:06,980 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:21:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-29 04:21:07,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598745210] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:21:07,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:21:07,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2023-11-29 04:21:07,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275510258] [2023-11-29 04:21:07,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:21:07,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:21:07,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:07,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:21:07,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:21:07,155 INFO L87 Difference]: Start difference. First operand 151 states and 224 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 04:21:07,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:07,593 INFO L93 Difference]: Finished difference Result 433 states and 626 transitions. [2023-11-29 04:21:07,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 04:21:07,594 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 105 [2023-11-29 04:21:07,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:07,597 INFO L225 Difference]: With dead ends: 433 [2023-11-29 04:21:07,597 INFO L226 Difference]: Without dead ends: 283 [2023-11-29 04:21:07,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 237 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2023-11-29 04:21:07,599 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 240 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:07,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 180 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:21:07,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-11-29 04:21:07,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 263. [2023-11-29 04:21:07,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 190 states have (on average 1.305263157894737) internal successors, (248), 192 states have internal predecessors, (248), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2023-11-29 04:21:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 376 transitions. [2023-11-29 04:21:07,654 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 376 transitions. Word has length 105 [2023-11-29 04:21:07,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:07,654 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 376 transitions. [2023-11-29 04:21:07,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 04:21:07,655 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 376 transitions. [2023-11-29 04:21:07,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 04:21:07,656 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:07,656 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:07,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:21:07,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:21:07,858 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:07,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:07,859 INFO L85 PathProgramCache]: Analyzing trace with hash -11309129, now seen corresponding path program 1 times [2023-11-29 04:21:07,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:07,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599688266] [2023-11-29 04:21:07,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:07,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:07,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:21:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:07,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:21:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:07,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:21:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:07,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:21:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:07,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 04:21:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:07,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 04:21:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:07,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:21:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:07,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:21:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:07,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:21:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:07,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:21:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:07,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:21:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:07,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:21:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:07,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 04:21:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:07,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 04:21:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:07,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 04:21:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:07,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:21:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:21:07,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:07,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599688266] [2023-11-29 04:21:07,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599688266] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:07,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:07,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:21:07,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262960374] [2023-11-29 04:21:07,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:07,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:21:07,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:07,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:21:07,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:21:07,990 INFO L87 Difference]: Start difference. First operand 263 states and 376 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:21:08,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:08,070 INFO L93 Difference]: Finished difference Result 555 states and 791 transitions. [2023-11-29 04:21:08,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:21:08,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2023-11-29 04:21:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:08,074 INFO L225 Difference]: With dead ends: 555 [2023-11-29 04:21:08,075 INFO L226 Difference]: Without dead ends: 293 [2023-11-29 04:21:08,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:21:08,076 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 84 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:08,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 229 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:21:08,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2023-11-29 04:21:08,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 263. [2023-11-29 04:21:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 190 states have (on average 1.2894736842105263) internal successors, (245), 192 states have internal predecessors, (245), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2023-11-29 04:21:08,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 373 transitions. [2023-11-29 04:21:08,121 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 373 transitions. Word has length 105 [2023-11-29 04:21:08,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:08,122 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 373 transitions. [2023-11-29 04:21:08,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:21:08,122 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 373 transitions. [2023-11-29 04:21:08,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 04:21:08,124 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:08,124 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:08,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:21:08,124 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:08,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:08,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1393246940, now seen corresponding path program 1 times [2023-11-29 04:21:08,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:08,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182377264] [2023-11-29 04:21:08,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:08,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:14,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:21:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:14,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:21:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:14,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:21:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:14,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:21:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:14,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 04:21:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:14,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 04:21:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:14,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:21:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:14,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:21:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:14,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:21:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:14,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:21:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:14,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:21:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:14,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:21:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:14,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 04:21:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:14,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 04:21:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:14,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 04:21:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:14,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:21:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:14,219 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:21:14,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:14,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182377264] [2023-11-29 04:21:14,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182377264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:14,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:14,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 04:21:14,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422679637] [2023-11-29 04:21:14,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:14,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 04:21:14,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:14,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 04:21:14,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:21:14,223 INFO L87 Difference]: Start difference. First operand 263 states and 373 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:21:16,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:16,351 INFO L93 Difference]: Finished difference Result 367 states and 497 transitions. [2023-11-29 04:21:16,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 04:21:16,352 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2023-11-29 04:21:16,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:16,355 INFO L225 Difference]: With dead ends: 367 [2023-11-29 04:21:16,355 INFO L226 Difference]: Without dead ends: 365 [2023-11-29 04:21:16,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=210, Invalid=492, Unknown=0, NotChecked=0, Total=702 [2023-11-29 04:21:16,356 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 244 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:16,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 447 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 04:21:16,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2023-11-29 04:21:16,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 292. [2023-11-29 04:21:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 212 states have (on average 1.278301886792453) internal successors, (271), 215 states have internal predecessors, (271), 70 states have call successors, (70), 9 states have call predecessors, (70), 9 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2023-11-29 04:21:16,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 411 transitions. [2023-11-29 04:21:16,389 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 411 transitions. Word has length 107 [2023-11-29 04:21:16,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:16,390 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 411 transitions. [2023-11-29 04:21:16,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:21:16,390 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 411 transitions. [2023-11-29 04:21:16,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 04:21:16,391 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:16,391 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:16,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:21:16,392 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:16,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:16,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1715703058, now seen corresponding path program 1 times [2023-11-29 04:21:16,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:16,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893485130] [2023-11-29 04:21:16,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:16,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:16,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:21:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:16,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:21:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:16,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:21:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:16,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:21:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:16,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 04:21:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:16,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 04:21:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:16,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:21:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:16,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:21:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:16,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:21:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:16,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:21:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:16,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:21:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:16,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:21:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:16,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 04:21:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:16,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 04:21:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:16,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 04:21:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:16,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:21:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:21:16,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:16,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893485130] [2023-11-29 04:21:16,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893485130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:16,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:16,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:21:16,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036012732] [2023-11-29 04:21:16,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:16,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:21:16,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:16,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:21:16,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:21:16,659 INFO L87 Difference]: Start difference. First operand 292 states and 411 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:21:16,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:16,888 INFO L93 Difference]: Finished difference Result 800 states and 1124 transitions. [2023-11-29 04:21:16,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:21:16,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2023-11-29 04:21:16,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:16,893 INFO L225 Difference]: With dead ends: 800 [2023-11-29 04:21:16,894 INFO L226 Difference]: Without dead ends: 520 [2023-11-29 04:21:16,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:21:16,896 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 88 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:16,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 254 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:21:16,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2023-11-29 04:21:16,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 388. [2023-11-29 04:21:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 289 states have (on average 1.2387543252595157) internal successors, (358), 293 states have internal predecessors, (358), 86 states have call successors, (86), 12 states have call predecessors, (86), 12 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2023-11-29 04:21:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 530 transitions. [2023-11-29 04:21:16,964 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 530 transitions. Word has length 107 [2023-11-29 04:21:16,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:16,965 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 530 transitions. [2023-11-29 04:21:16,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:21:16,965 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 530 transitions. [2023-11-29 04:21:16,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 04:21:16,966 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:16,966 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:16,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:21:16,967 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:16,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:16,967 INFO L85 PathProgramCache]: Analyzing trace with hash 317189482, now seen corresponding path program 1 times [2023-11-29 04:21:16,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:16,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386366703] [2023-11-29 04:21:16,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:16,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:21:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:21:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:21:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:21:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 04:21:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 04:21:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:21:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:21:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:21:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:21:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:21:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:21:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 04:21:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 04:21:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 04:21:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:21:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,048 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:21:17,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:17,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386366703] [2023-11-29 04:21:17,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386366703] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:17,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:17,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:21:17,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175712427] [2023-11-29 04:21:17,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:17,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:21:17,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:17,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:21:17,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:21:17,051 INFO L87 Difference]: Start difference. First operand 388 states and 530 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:21:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:17,181 INFO L93 Difference]: Finished difference Result 962 states and 1312 transitions. [2023-11-29 04:21:17,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:21:17,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2023-11-29 04:21:17,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:17,186 INFO L225 Difference]: With dead ends: 962 [2023-11-29 04:21:17,187 INFO L226 Difference]: Without dead ends: 586 [2023-11-29 04:21:17,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:21:17,189 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 59 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:17,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 139 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:21:17,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2023-11-29 04:21:17,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 375. [2023-11-29 04:21:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 276 states have (on average 1.1920289855072463) internal successors, (329), 280 states have internal predecessors, (329), 86 states have call successors, (86), 12 states have call predecessors, (86), 12 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2023-11-29 04:21:17,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 501 transitions. [2023-11-29 04:21:17,256 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 501 transitions. Word has length 108 [2023-11-29 04:21:17,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:17,256 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 501 transitions. [2023-11-29 04:21:17,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:21:17,257 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 501 transitions. [2023-11-29 04:21:17,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 04:21:17,258 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:17,258 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:17,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:21:17,258 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:17,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:17,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1062082448, now seen corresponding path program 1 times [2023-11-29 04:21:17,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:17,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061204128] [2023-11-29 04:21:17,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:17,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:21:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:21:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:21:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:21:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 04:21:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 04:21:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:21:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:21:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:21:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:21:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:21:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:21:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 04:21:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 04:21:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 04:21:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:21:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,408 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:21:17,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:17,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061204128] [2023-11-29 04:21:17,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061204128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:17,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:17,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:21:17,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062567604] [2023-11-29 04:21:17,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:17,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:21:17,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:17,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:21:17,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:21:17,410 INFO L87 Difference]: Start difference. First operand 375 states and 501 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:21:17,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:17,615 INFO L93 Difference]: Finished difference Result 765 states and 1033 transitions. [2023-11-29 04:21:17,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:21:17,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2023-11-29 04:21:17,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:17,620 INFO L225 Difference]: With dead ends: 765 [2023-11-29 04:21:17,621 INFO L226 Difference]: Without dead ends: 545 [2023-11-29 04:21:17,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:21:17,622 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 67 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:17,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 191 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:21:17,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2023-11-29 04:21:17,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 375. [2023-11-29 04:21:17,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 276 states have (on average 1.1666666666666667) internal successors, (322), 280 states have internal predecessors, (322), 86 states have call successors, (86), 12 states have call predecessors, (86), 12 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2023-11-29 04:21:17,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 494 transitions. [2023-11-29 04:21:17,692 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 494 transitions. Word has length 108 [2023-11-29 04:21:17,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:17,692 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 494 transitions. [2023-11-29 04:21:17,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:21:17,693 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 494 transitions. [2023-11-29 04:21:17,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 04:21:17,694 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:17,694 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:17,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:21:17,694 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:17,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:17,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1812858892, now seen corresponding path program 1 times [2023-11-29 04:21:17,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:17,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479986734] [2023-11-29 04:21:17,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:17,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:20,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:21:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:20,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:21:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:20,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:21:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:20,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:21:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:20,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 04:21:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:20,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 04:21:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:20,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:21:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:20,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:21:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:20,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:21:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:20,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:21:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:20,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:21:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:20,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:21:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:20,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 04:21:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:20,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 04:21:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:20,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 04:21:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:20,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:21:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:21:20,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:20,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479986734] [2023-11-29 04:21:20,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479986734] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:20,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:20,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 04:21:20,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488060053] [2023-11-29 04:21:20,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:20,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 04:21:20,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:20,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 04:21:20,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-11-29 04:21:20,512 INFO L87 Difference]: Start difference. First operand 375 states and 494 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:21:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:21,717 INFO L93 Difference]: Finished difference Result 801 states and 1041 transitions. [2023-11-29 04:21:21,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 04:21:21,718 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2023-11-29 04:21:21,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:21,720 INFO L225 Difference]: With dead ends: 801 [2023-11-29 04:21:21,720 INFO L226 Difference]: Without dead ends: 438 [2023-11-29 04:21:21,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2023-11-29 04:21:21,723 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 142 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:21,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 412 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 04:21:21,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2023-11-29 04:21:21,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 375. [2023-11-29 04:21:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 276 states have (on average 1.1630434782608696) internal successors, (321), 280 states have internal predecessors, (321), 86 states have call successors, (86), 12 states have call predecessors, (86), 12 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2023-11-29 04:21:21,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 493 transitions. [2023-11-29 04:21:21,789 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 493 transitions. Word has length 108 [2023-11-29 04:21:21,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:21,790 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 493 transitions. [2023-11-29 04:21:21,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:21:21,790 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 493 transitions. [2023-11-29 04:21:21,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 04:21:21,792 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:21,792 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:21,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:21:21,792 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:21,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:21,793 INFO L85 PathProgramCache]: Analyzing trace with hash 843144329, now seen corresponding path program 1 times [2023-11-29 04:21:21,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:21,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313507825] [2023-11-29 04:21:21,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:21,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:21:21,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:21:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:21:21,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:21:21,895 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:21:21,896 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:21:21,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 04:21:21,901 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:21,904 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:21:21,954 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 04:21:21,956 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short16 could not be translated [2023-11-29 04:21:21,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:21:21 BoogieIcfgContainer [2023-11-29 04:21:21,972 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:21:21,973 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:21:21,973 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:21:21,973 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:21:21,974 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:21:04" (3/4) ... [2023-11-29 04:21:21,976 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 04:21:21,976 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:21:21,977 INFO L158 Benchmark]: Toolchain (without parser) took 18616.39ms. Allocated memory was 169.9MB in the beginning and 432.0MB in the end (delta: 262.1MB). Free memory was 107.7MB in the beginning and 316.2MB in the end (delta: -208.5MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2023-11-29 04:21:21,977 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 123.7MB. Free memory is still 96.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:21:21,978 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.33ms. Allocated memory is still 169.9MB. Free memory was 107.4MB in the beginning and 94.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 04:21:21,978 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.99ms. Allocated memory is still 169.9MB. Free memory was 94.8MB in the beginning and 138.4MB in the end (delta: -43.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 04:21:21,978 INFO L158 Benchmark]: Boogie Preprocessor took 49.62ms. Allocated memory is still 169.9MB. Free memory was 138.4MB in the beginning and 136.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:21:21,979 INFO L158 Benchmark]: RCFGBuilder took 418.18ms. Allocated memory is still 169.9MB. Free memory was 135.7MB in the beginning and 118.0MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 04:21:21,979 INFO L158 Benchmark]: TraceAbstraction took 17759.64ms. Allocated memory was 169.9MB in the beginning and 432.0MB in the end (delta: 262.1MB). Free memory was 116.8MB in the beginning and 316.2MB in the end (delta: -199.4MB). Peak memory consumption was 64.0MB. Max. memory is 16.1GB. [2023-11-29 04:21:21,979 INFO L158 Benchmark]: Witness Printer took 3.59ms. Allocated memory is still 432.0MB. Free memory is still 316.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:21:21,981 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.14ms. Allocated memory is still 123.7MB. Free memory is still 96.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.33ms. Allocated memory is still 169.9MB. Free memory was 107.4MB in the beginning and 94.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.99ms. Allocated memory is still 169.9MB. Free memory was 94.8MB in the beginning and 138.4MB in the end (delta: -43.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.62ms. Allocated memory is still 169.9MB. Free memory was 138.4MB in the beginning and 136.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 418.18ms. Allocated memory is still 169.9MB. Free memory was 135.7MB in the beginning and 118.0MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17759.64ms. Allocated memory was 169.9MB in the beginning and 432.0MB in the end (delta: 262.1MB). Free memory was 116.8MB in the beginning and 316.2MB in the end (delta: -199.4MB). Peak memory consumption was 64.0MB. Max. memory is 16.1GB. * Witness Printer took 3.59ms. Allocated memory is still 432.0MB. Free memory is still 316.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short16 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9999.5; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 4.5; [L25] double var_1_4 = 2.5; [L26] double var_1_5 = 0.0; [L27] double var_1_6 = 999999999999.3; [L28] signed char var_1_7 = -128; [L29] signed char var_1_11 = -64; [L30] signed char var_1_12 = 5; [L31] signed char var_1_13 = 50; [L32] unsigned char var_1_14 = 0; [L33] unsigned char var_1_15 = 0; [L34] unsigned char var_1_16 = 0; [L35] unsigned char var_1_17 = 0; [L36] signed char last_1_var_1_7 = -128; [L107] isInitial = 1 [L108] FCALL initially() [L109] int k_loop; [L110] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L110] COND TRUE k_loop < 1 [L111] CALL updateLastVariables() [L100] last_1_var_1_7 = var_1_7 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L73] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L74] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L74] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L75] var_1_3 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L76] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L77] var_1_4 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L78] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L79] var_1_5 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_6=9999999999993/10, var_1_7=-128] [L80] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_6=9999999999993/10, var_1_7=-128] [L81] var_1_6 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L82] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L83] var_1_11 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L84] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L85] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L85] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L87] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L88] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L88] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L89] var_1_15 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L90] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L91] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L91] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L92] var_1_16 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L93] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L94] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L94] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L95] var_1_17 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L96] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L97] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L97] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L112] RET updateVariables() [L113] CALL step() [L40] signed long int stepLocal_1 = ((((last_1_var_1_7) < (last_1_var_1_7)) ? (last_1_var_1_7) : (last_1_var_1_7))) + last_1_var_1_7; VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L41] COND FALSE !(last_1_var_1_7 <= stepLocal_1) [L44] var_1_12 = var_1_11 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L46] unsigned char stepLocal_3 = var_1_2; [L47] unsigned long int stepLocal_2 = (((25u) > (var_1_12)) ? (25u) : (var_1_12)); VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=4294967271, stepLocal_3=0, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L48] COND TRUE stepLocal_3 || var_1_15 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=4294967271, stepLocal_3=0, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L49] COND TRUE stepLocal_2 <= var_1_12 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=4294967271, stepLocal_3=0, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L50] COND FALSE !(\read(var_1_2)) [L53] var_1_14 = var_1_17 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=4294967271, stepLocal_3=0, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L59] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=4294967271, stepLocal_3=0, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L59] signed long int stepLocal_0 = var_1_12 ^ var_1_12; [L60] COND TRUE ((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != stepLocal_0 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_0=0, stepLocal_1=-256, stepLocal_2=4294967271, stepLocal_3=0, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L61] COND TRUE \read(var_1_14) [L62] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_0=0, stepLocal_1=-256, stepLocal_2=4294967271, stepLocal_3=0, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-25] [L67] COND TRUE \read(var_1_14) [L68] var_1_1 = ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))) VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_0=0, stepLocal_1=-256, stepLocal_2=4294967271, stepLocal_3=0, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000004, var_1_2=0, var_1_3=1000000000004, var_1_7=-25] [L113] RET step() [L114] CALL, EXPR property() [L103] EXPR (var_1_14 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != (var_1_12 ^ var_1_12)) ? (var_1_14 ? (var_1_7 == ((signed char) var_1_11)) : 1) : (var_1_7 == ((signed char) var_1_11))) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000004, var_1_2=0, var_1_3=1000000000004, var_1_7=-25] [L103-L104] return (((var_1_14 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != (var_1_12 ^ var_1_12)) ? (var_1_14 ? (var_1_7 == ((signed char) var_1_11)) : 1) : (var_1_7 == ((signed char) var_1_11)))) && ((last_1_var_1_7 <= (((((last_1_var_1_7) < (last_1_var_1_7)) ? (last_1_var_1_7) : (last_1_var_1_7))) + last_1_var_1_7)) ? (var_1_12 == ((signed char) (var_1_13 - 1))) : (var_1_12 == ((signed char) var_1_11)))) && ((var_1_2 || var_1_15) ? ((((((25u) > (var_1_12)) ? (25u) : (var_1_12))) <= var_1_12) ? (var_1_2 ? (var_1_14 == ((unsigned char) var_1_16)) : (var_1_14 == ((unsigned char) var_1_17))) : 1) : (var_1_14 == ((unsigned char) var_1_16))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000004, var_1_2=0, var_1_3=1000000000004, var_1_7=-25] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000004, var_1_2=0, var_1_3=1000000000004, var_1_7=-25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 12, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1113 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1099 mSDsluCounter, 2622 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1680 mSDsCounter, 314 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1533 IncrementalHoareTripleChecker+Invalid, 1847 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 314 mSolverCounterUnsat, 942 mSDtfsCounter, 1533 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 695 GetRequests, 604 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=388occurred in iteration=8, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 726 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 1379 NumberOfCodeBlocks, 1379 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1362 ConstructedInterpolants, 0 QuantifiedInterpolants, 5253 SizeOfPredicates, 4 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 6222/6240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 04:21:22,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya --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 d61c0dafed482002b011add1f5476de4fd21f0cbe5ef1ca0c06dd442b2a70902 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:21:23,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:21:24,013 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 04:21:24,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:21:24,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:21:24,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:21:24,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:21:24,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:21:24,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:21:24,048 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:21:24,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:21:24,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:21:24,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:21:24,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:21:24,051 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:21:24,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:21:24,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:21:24,053 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:21:24,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:21:24,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:21:24,055 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:21:24,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:21:24,056 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:21:24,056 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:21:24,056 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:21:24,057 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:21:24,057 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:21:24,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:21:24,058 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:21:24,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:21:24,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:21:24,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:21:24,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:21:24,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:21:24,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:21:24,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:21:24,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:21:24,061 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:21:24,061 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:21:24,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:21:24,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:21:24,062 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:21:24,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:21:24,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:21:24,063 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:21:24,063 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_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/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_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya 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 -> d61c0dafed482002b011add1f5476de4fd21f0cbe5ef1ca0c06dd442b2a70902 [2023-11-29 04:21:24,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:21:24,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:21:24,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:21:24,382 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:21:24,382 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:21:24,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i [2023-11-29 04:21:27,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:21:27,330 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:21:27,331 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i [2023-11-29 04:21:27,340 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/data/0fa3a5e80/2420d148bd2c4fb3953f430014924299/FLAG1ca00f456 [2023-11-29 04:21:27,355 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/data/0fa3a5e80/2420d148bd2c4fb3953f430014924299 [2023-11-29 04:21:27,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:21:27,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:21:27,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:21:27,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:21:27,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:21:27,367 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:21:27" (1/1) ... [2023-11-29 04:21:27,368 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e0c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:27, skipping insertion in model container [2023-11-29 04:21:27,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:21:27" (1/1) ... [2023-11-29 04:21:27,397 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:21:27,550 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i[915,928] [2023-11-29 04:21:27,594 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:21:27,611 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:21:27,624 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i[915,928] [2023-11-29 04:21:27,647 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:21:27,666 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:21:27,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:27 WrapperNode [2023-11-29 04:21:27,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:21:27,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:21:27,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:21:27,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:21:27,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:27" (1/1) ... [2023-11-29 04:21:27,688 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:27" (1/1) ... [2023-11-29 04:21:27,716 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2023-11-29 04:21:27,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:21:27,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:21:27,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:21:27,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:21:27,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:27" (1/1) ... [2023-11-29 04:21:27,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:27" (1/1) ... [2023-11-29 04:21:27,734 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:27" (1/1) ... [2023-11-29 04:21:27,748 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 04:21:27,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:27" (1/1) ... [2023-11-29 04:21:27,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:27" (1/1) ... [2023-11-29 04:21:27,759 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:27" (1/1) ... [2023-11-29 04:21:27,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:27" (1/1) ... [2023-11-29 04:21:27,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:27" (1/1) ... [2023-11-29 04:21:27,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:27" (1/1) ... [2023-11-29 04:21:27,772 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:21:27,779 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:21:27,780 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:21:27,780 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:21:27,781 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:27" (1/1) ... [2023-11-29 04:21:27,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:21:27,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:21:27,827 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:21:27,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:21:27,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:21:27,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:21:27,863 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:21:27,863 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:21:27,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:21:27,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:21:27,941 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:21:27,944 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:21:29,793 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:21:29,839 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:21:29,840 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:21:29,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:21:29 BoogieIcfgContainer [2023-11-29 04:21:29,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:21:29,843 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:21:29,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:21:29,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:21:29,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:21:27" (1/3) ... [2023-11-29 04:21:29,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1398d339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:21:29, skipping insertion in model container [2023-11-29 04:21:29,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:27" (2/3) ... [2023-11-29 04:21:29,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1398d339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:21:29, skipping insertion in model container [2023-11-29 04:21:29,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:21:29" (3/3) ... [2023-11-29 04:21:29,851 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-81.i [2023-11-29 04:21:29,871 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:21:29,871 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:21:29,914 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:21:29,920 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5abe3ec7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:21:29,921 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:21:29,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:21:29,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-29 04:21:29,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:29,938 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:29,938 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:29,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:29,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1365061803, now seen corresponding path program 1 times [2023-11-29 04:21:29,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:21:29,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103796661] [2023-11-29 04:21:29,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:29,958 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:21:29,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:21:29,960 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:21:29,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 04:21:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:30,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 04:21:30,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:21:30,302 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2023-11-29 04:21:30,302 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:21:30,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:21:30,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103796661] [2023-11-29 04:21:30,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103796661] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:30,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:30,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:21:30,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007652723] [2023-11-29 04:21:30,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:30,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:21:30,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:21:30,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:21:30,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:21:30,339 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:21:31,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 04:21:31,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:31,654 INFO L93 Difference]: Finished difference Result 95 states and 161 transitions. [2023-11-29 04:21:31,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:21:31,656 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 101 [2023-11-29 04:21:31,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:31,663 INFO L225 Difference]: With dead ends: 95 [2023-11-29 04:21:31,663 INFO L226 Difference]: Without dead ends: 46 [2023-11-29 04:21:31,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:21:31,670 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 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.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:31,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 04:21:31,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-29 04:21:31,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-11-29 04:21:31,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:21:31,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2023-11-29 04:21:31,708 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 101 [2023-11-29 04:21:31,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:31,708 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2023-11-29 04:21:31,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:21:31,709 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2023-11-29 04:21:31,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-29 04:21:31,713 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:31,714 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:31,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:21:31,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:21:31,915 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:31,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:31,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1537864525, now seen corresponding path program 1 times [2023-11-29 04:21:31,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:21:31,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889304965] [2023-11-29 04:21:31,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:31,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:21:31,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:21:31,918 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:21:31,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 04:21:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:21:32,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:21:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:21:32,556 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:21:32,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:21:32,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889304965] [2023-11-29 04:21:32,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889304965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:32,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:32,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:21:32,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663619310] [2023-11-29 04:21:32,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:32,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:21:32,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:21:32,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:21:32,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:21:32,561 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:21:34,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:34,659 INFO L93 Difference]: Finished difference Result 143 states and 210 transitions. [2023-11-29 04:21:34,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:21:34,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2023-11-29 04:21:34,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:34,662 INFO L225 Difference]: With dead ends: 143 [2023-11-29 04:21:34,662 INFO L226 Difference]: Without dead ends: 98 [2023-11-29 04:21:34,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:21:34,665 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 67 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:34,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 208 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 04:21:34,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-29 04:21:34,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2023-11-29 04:21:34,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 54 states have internal predecessors, (69), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 04:21:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 133 transitions. [2023-11-29 04:21:34,692 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 133 transitions. Word has length 101 [2023-11-29 04:21:34,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:34,693 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 133 transitions. [2023-11-29 04:21:34,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:21:34,693 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 133 transitions. [2023-11-29 04:21:34,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-29 04:21:34,696 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:34,696 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:34,702 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 04:21:34,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:21:34,897 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:34,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:34,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2077044401, now seen corresponding path program 1 times [2023-11-29 04:21:34,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:21:34,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826755752] [2023-11-29 04:21:34,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:34,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:21:34,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:21:34,900 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:21:34,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 04:21:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:35,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 04:21:35,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:21:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:21:35,177 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:21:35,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:21:35,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826755752] [2023-11-29 04:21:35,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826755752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:35,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:35,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:21:35,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364314943] [2023-11-29 04:21:35,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:35,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:21:35,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:21:35,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:21:35,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:21:35,181 INFO L87 Difference]: Start difference. First operand 89 states and 133 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:21:36,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 04:21:36,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:36,439 INFO L93 Difference]: Finished difference Result 134 states and 200 transitions. [2023-11-29 04:21:36,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:21:36,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2023-11-29 04:21:36,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:36,442 INFO L225 Difference]: With dead ends: 134 [2023-11-29 04:21:36,442 INFO L226 Difference]: Without dead ends: 89 [2023-11-29 04:21:36,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:21:36,444 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:36,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 113 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 04:21:36,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-29 04:21:36,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-29 04:21:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 54 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 04:21:36,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 131 transitions. [2023-11-29 04:21:36,461 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 131 transitions. Word has length 101 [2023-11-29 04:21:36,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:36,461 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 131 transitions. [2023-11-29 04:21:36,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:21:36,462 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 131 transitions. [2023-11-29 04:21:36,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-29 04:21:36,463 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:36,463 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:36,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 04:21:36,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:21:36,664 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:36,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:36,665 INFO L85 PathProgramCache]: Analyzing trace with hash -203296266, now seen corresponding path program 1 times [2023-11-29 04:21:36,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:21:36,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428899599] [2023-11-29 04:21:36,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:36,665 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:21:36,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:21:36,667 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:21:36,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 04:21:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:36,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:21:36,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:21:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 145 proven. 6 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2023-11-29 04:21:37,004 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:21:37,210 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-29 04:21:37,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:21:37,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428899599] [2023-11-29 04:21:37,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1428899599] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:21:37,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:21:37,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-11-29 04:21:37,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296062283] [2023-11-29 04:21:37,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:21:37,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:21:37,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:21:37,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:21:37,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:21:37,215 INFO L87 Difference]: Start difference. First operand 89 states and 131 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 04:21:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:40,505 INFO L93 Difference]: Finished difference Result 249 states and 352 transitions. [2023-11-29 04:21:40,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 04:21:40,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 102 [2023-11-29 04:21:40,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:40,508 INFO L225 Difference]: With dead ends: 249 [2023-11-29 04:21:40,509 INFO L226 Difference]: Without dead ends: 161 [2023-11-29 04:21:40,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2023-11-29 04:21:40,511 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 164 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:40,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 129 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-29 04:21:40,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-11-29 04:21:40,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 146. [2023-11-29 04:21:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 91 states have (on average 1.1758241758241759) internal successors, (107), 91 states have internal predecessors, (107), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 04:21:40,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 203 transitions. [2023-11-29 04:21:40,542 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 203 transitions. Word has length 102 [2023-11-29 04:21:40,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:40,543 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 203 transitions. [2023-11-29 04:21:40,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 04:21:40,544 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 203 transitions. [2023-11-29 04:21:40,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-29 04:21:40,546 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:40,546 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:40,554 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-29 04:21:40,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:21:40,754 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:40,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:40,755 INFO L85 PathProgramCache]: Analyzing trace with hash -201389642, now seen corresponding path program 1 times [2023-11-29 04:21:40,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:21:40,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097698432] [2023-11-29 04:21:40,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:40,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:21:40,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:21:40,756 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:21:40,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82dcc8d-41d8-4dc9-a8d9-3e7a65c13d96/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 04:21:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:41,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 04:21:41,036 INFO L285 TraceCheckSpWp]: Computing forward predicates...