./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/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_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-5.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/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_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/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 ea5a8604b55ac7b733e3a58d5b1561195fe1a5472f19acdcc847503296ba06a2 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:43:40,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:43:40,435 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:43:40,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:43:40,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:43:40,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:43:40,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:43:40,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:43:40,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:43:40,467 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:43:40,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:43:40,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:43:40,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:43:40,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:43:40,470 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:43:40,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:43:40,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:43:40,471 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:43:40,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:43:40,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:43:40,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:43:40,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:43:40,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:43:40,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:43:40,477 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:43:40,477 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:43:40,477 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:43:40,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:43:40,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:43:40,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:43:40,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:43:40,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:43:40,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:43:40,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:43:40,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:43:40,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:43:40,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:43:40,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:43:40,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:43:40,481 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:43:40,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:43:40,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:43:40,482 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_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/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_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/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 -> ea5a8604b55ac7b733e3a58d5b1561195fe1a5472f19acdcc847503296ba06a2 [2023-11-29 00:43:40,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:43:40,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:43:40,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:43:40,734 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:43:40,734 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:43:40,735 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-5.i [2023-11-29 00:43:43,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:43:43,636 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:43:43,636 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-5.i [2023-11-29 00:43:43,643 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/bin/uautomizer-verify-BQ2R08f2Ya/data/461c19e3d/f1c570883d90421a8bf789d0feb6e6ae/FLAG8c649a30f [2023-11-29 00:43:43,654 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/bin/uautomizer-verify-BQ2R08f2Ya/data/461c19e3d/f1c570883d90421a8bf789d0feb6e6ae [2023-11-29 00:43:43,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:43:43,657 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:43:43,658 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:43:43,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:43:43,662 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:43:43,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:43:43" (1/1) ... [2023-11-29 00:43:43,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63318d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:43, skipping insertion in model container [2023-11-29 00:43:43,664 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:43:43" (1/1) ... [2023-11-29 00:43:43,688 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:43:43,810 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_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-5.i[914,927] [2023-11-29 00:43:43,852 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:43:43,863 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:43:43,874 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_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-5.i[914,927] [2023-11-29 00:43:43,897 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:43:43,910 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:43:43,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:43 WrapperNode [2023-11-29 00:43:43,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:43:43,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:43:43,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:43:43,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:43:43,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:43" (1/1) ... [2023-11-29 00:43:43,927 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:43" (1/1) ... [2023-11-29 00:43:43,961 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2023-11-29 00:43:43,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:43:43,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:43:43,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:43:43,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:43:43,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:43" (1/1) ... [2023-11-29 00:43:43,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:43" (1/1) ... [2023-11-29 00:43:43,976 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:43" (1/1) ... [2023-11-29 00:43:43,991 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 00:43:43,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:43" (1/1) ... [2023-11-29 00:43:43,992 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:43" (1/1) ... [2023-11-29 00:43:43,998 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:43" (1/1) ... [2023-11-29 00:43:44,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:43" (1/1) ... [2023-11-29 00:43:44,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:43" (1/1) ... [2023-11-29 00:43:44,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:43" (1/1) ... [2023-11-29 00:43:44,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:43:44,011 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:43:44,011 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:43:44,011 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:43:44,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:43" (1/1) ... [2023-11-29 00:43:44,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:43:44,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:43:44,041 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:43:44,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:43:44,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:43:44,079 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 00:43:44,079 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 00:43:44,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:43:44,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:43:44,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:43:44,158 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:43:44,160 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:43:44,386 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:43:44,425 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:43:44,425 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 00:43:44,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:43:44 BoogieIcfgContainer [2023-11-29 00:43:44,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:43:44,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:43:44,429 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:43:44,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:43:44,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:43:43" (1/3) ... [2023-11-29 00:43:44,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b61e374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:43:44, skipping insertion in model container [2023-11-29 00:43:44,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:43" (2/3) ... [2023-11-29 00:43:44,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b61e374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:43:44, skipping insertion in model container [2023-11-29 00:43:44,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:43:44" (3/3) ... [2023-11-29 00:43:44,438 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-5.i [2023-11-29 00:43:44,453 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:43:44,453 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:43:44,497 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:43:44,504 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;@6ab563e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:43:44,504 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:43:44,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 00:43:44,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-29 00:43:44,518 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:43:44,519 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:43:44,519 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:43:44,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:43:44,524 INFO L85 PathProgramCache]: Analyzing trace with hash 603172873, now seen corresponding path program 1 times [2023-11-29 00:43:44,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:43:44,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165353321] [2023-11-29 00:43:44,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:44,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:43:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:44,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:43:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:44,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:43:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:44,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:43:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:44,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:43:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:44,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:43:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:44,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:43:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:44,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:43:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:44,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:43:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:44,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:43:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:44,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:43:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:44,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:43:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:44,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:43:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:44,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:43:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:44,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:43:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 00:43:44,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:43:44,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165353321] [2023-11-29 00:43:44,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165353321] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:43:44,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:43:44,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:43:44,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161298095] [2023-11-29 00:43:44,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:43:44,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:43:44,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:43:44,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:43:44,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:43:44,844 INFO L87 Difference]: Start difference. First operand has 43 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 00:43:44,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:43:44,896 INFO L93 Difference]: Finished difference Result 83 states and 142 transitions. [2023-11-29 00:43:44,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:43:44,899 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 89 [2023-11-29 00:43:44,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:43:44,907 INFO L225 Difference]: With dead ends: 83 [2023-11-29 00:43:44,907 INFO L226 Difference]: Without dead ends: 41 [2023-11-29 00:43:44,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:43:44,914 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:43:44,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:43:44,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-29 00:43:44,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-29 00:43:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 00:43:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2023-11-29 00:43:44,955 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 89 [2023-11-29 00:43:44,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:43:44,956 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2023-11-29 00:43:44,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 00:43:44,956 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2023-11-29 00:43:44,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-29 00:43:44,961 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:43:44,961 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:43:44,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:43:44,961 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:43:44,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:43:44,962 INFO L85 PathProgramCache]: Analyzing trace with hash 425733833, now seen corresponding path program 1 times [2023-11-29 00:43:44,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:43:44,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433139111] [2023-11-29 00:43:44,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:44,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:43:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:45,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:43:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:45,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:43:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:45,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:43:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:45,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:43:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:45,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:43:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:45,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:43:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:45,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:43:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:45,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:43:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:45,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:43:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:45,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:43:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:45,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:43:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:45,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:43:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:45,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:43:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:45,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:43:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:45,914 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 00:43:45,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:43:45,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433139111] [2023-11-29 00:43:45,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433139111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:43:45,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:43:45,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:43:45,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714067347] [2023-11-29 00:43:45,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:43:45,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:43:45,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:43:45,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:43:45,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:43:45,919 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:43:46,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:43:46,073 INFO L93 Difference]: Finished difference Result 110 states and 159 transitions. [2023-11-29 00:43:46,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:43:46,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2023-11-29 00:43:46,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:43:46,077 INFO L225 Difference]: With dead ends: 110 [2023-11-29 00:43:46,077 INFO L226 Difference]: Without dead ends: 70 [2023-11-29 00:43:46,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:43:46,079 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 36 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:43:46,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 144 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:43:46,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-29 00:43:46,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2023-11-29 00:43:46,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 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 00:43:46,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 97 transitions. [2023-11-29 00:43:46,109 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 97 transitions. Word has length 89 [2023-11-29 00:43:46,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:43:46,110 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 97 transitions. [2023-11-29 00:43:46,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:43:46,111 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 97 transitions. [2023-11-29 00:43:46,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-29 00:43:46,113 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:43:46,113 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:43:46,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:43:46,114 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:43:46,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:43:46,114 INFO L85 PathProgramCache]: Analyzing trace with hash 425793415, now seen corresponding path program 1 times [2023-11-29 00:43:46,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:43:46,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687954453] [2023-11-29 00:43:46,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:46,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:43:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:47,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:43:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:47,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:43:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:47,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:43:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:47,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:43:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:47,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:43:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:47,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:43:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:47,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:43:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:47,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:43:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:47,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:43:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:47,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:43:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:47,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:43:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:47,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:43:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:47,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:43:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:47,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:43:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 00:43:47,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:43:47,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687954453] [2023-11-29 00:43:47,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687954453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:43:47,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:43:47,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 00:43:47,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108146140] [2023-11-29 00:43:47,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:43:47,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:43:47,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:43:47,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:43:47,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:43:47,608 INFO L87 Difference]: Start difference. First operand 67 states and 97 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:43:48,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:43:48,334 INFO L93 Difference]: Finished difference Result 161 states and 221 transitions. [2023-11-29 00:43:48,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:43:48,335 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2023-11-29 00:43:48,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:43:48,339 INFO L225 Difference]: With dead ends: 161 [2023-11-29 00:43:48,339 INFO L226 Difference]: Without dead ends: 159 [2023-11-29 00:43:48,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2023-11-29 00:43:48,342 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 81 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:43:48,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 285 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 00:43:48,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-11-29 00:43:48,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 141. [2023-11-29 00:43:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.186046511627907) internal successors, (102), 88 states have internal predecessors, (102), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 00:43:48,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 198 transitions. [2023-11-29 00:43:48,393 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 198 transitions. Word has length 89 [2023-11-29 00:43:48,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:43:48,394 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 198 transitions. [2023-11-29 00:43:48,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:43:48,394 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 198 transitions. [2023-11-29 00:43:48,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-29 00:43:48,397 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:43:48,397 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:43:48,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:43:48,397 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:43:48,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:43:48,398 INFO L85 PathProgramCache]: Analyzing trace with hash 483051717, now seen corresponding path program 1 times [2023-11-29 00:43:48,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:43:48,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732295981] [2023-11-29 00:43:48,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:48,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:43:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:43:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:43:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:43:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:43:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:43:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:43:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:43:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:43:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:43:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:43:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:43:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:43:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:43:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:43:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,508 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 00:43:48,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:43:48,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732295981] [2023-11-29 00:43:48,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732295981] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:43:48,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:43:48,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:43:48,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420674567] [2023-11-29 00:43:48,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:43:48,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:43:48,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:43:48,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:43:48,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:43:48,511 INFO L87 Difference]: Start difference. First operand 141 states and 198 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:43:48,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:43:48,551 INFO L93 Difference]: Finished difference Result 277 states and 390 transitions. [2023-11-29 00:43:48,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:43:48,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2023-11-29 00:43:48,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:43:48,554 INFO L225 Difference]: With dead ends: 277 [2023-11-29 00:43:48,554 INFO L226 Difference]: Without dead ends: 137 [2023-11-29 00:43:48,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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 00:43:48,557 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:43:48,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 105 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:43:48,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-29 00:43:48,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2023-11-29 00:43:48,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 84 states have internal predecessors, (93), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 00:43:48,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 189 transitions. [2023-11-29 00:43:48,596 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 189 transitions. Word has length 89 [2023-11-29 00:43:48,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:43:48,597 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 189 transitions. [2023-11-29 00:43:48,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:43:48,597 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 189 transitions. [2023-11-29 00:43:48,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-29 00:43:48,598 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:43:48,599 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:43:48,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:43:48,599 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:43:48,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:43:48,600 INFO L85 PathProgramCache]: Analyzing trace with hash -383612793, now seen corresponding path program 1 times [2023-11-29 00:43:48,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:43:48,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44797332] [2023-11-29 00:43:48,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:48,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:43:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:43:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:43:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:43:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:43:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:43:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:43:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:43:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:43:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:43:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:43:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:43:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:43:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:43:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:43:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 00:43:48,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:43:48,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44797332] [2023-11-29 00:43:48,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44797332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:43:48,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:43:48,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:43:48,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700850732] [2023-11-29 00:43:48,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:43:48,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:43:48,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:43:48,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:43:48,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:43:48,700 INFO L87 Difference]: Start difference. First operand 137 states and 189 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:43:48,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:43:48,732 INFO L93 Difference]: Finished difference Result 244 states and 334 transitions. [2023-11-29 00:43:48,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:43:48,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2023-11-29 00:43:48,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:43:48,735 INFO L225 Difference]: With dead ends: 244 [2023-11-29 00:43:48,735 INFO L226 Difference]: Without dead ends: 108 [2023-11-29 00:43:48,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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 00:43:48,737 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:43:48,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 100 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:43:48,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-29 00:43:48,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-11-29 00:43:48,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 64 states have internal predecessors, (68), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-29 00:43:48,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 144 transitions. [2023-11-29 00:43:48,762 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 144 transitions. Word has length 89 [2023-11-29 00:43:48,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:43:48,763 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 144 transitions. [2023-11-29 00:43:48,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:43:48,763 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 144 transitions. [2023-11-29 00:43:48,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-29 00:43:48,764 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:43:48,764 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:43:48,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:43:48,765 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:43:48,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:43:48,765 INFO L85 PathProgramCache]: Analyzing trace with hash 647397850, now seen corresponding path program 1 times [2023-11-29 00:43:48,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:43:48,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815048076] [2023-11-29 00:43:48,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:48,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:43:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:52,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:43:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:52,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:43:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:52,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:43:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:52,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:43:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:52,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:43:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:52,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:43:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:52,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:43:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:52,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:43:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:52,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:43:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:52,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:43:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:52,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:43:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:52,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:43:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:52,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:43:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:52,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:43:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:52,961 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 00:43:52,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:43:52,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815048076] [2023-11-29 00:43:52,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815048076] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:43:52,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:43:52,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:43:52,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778555195] [2023-11-29 00:43:52,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:43:52,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:43:52,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:43:52,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:43:52,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:43:52,964 INFO L87 Difference]: Start difference. First operand 108 states and 144 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:43:53,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:43:53,255 INFO L93 Difference]: Finished difference Result 127 states and 163 transitions. [2023-11-29 00:43:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:43:53,256 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 90 [2023-11-29 00:43:53,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:43:53,258 INFO L225 Difference]: With dead ends: 127 [2023-11-29 00:43:53,258 INFO L226 Difference]: Without dead ends: 125 [2023-11-29 00:43:53,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:43:53,259 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 29 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:43:53,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 224 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:43:53,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-29 00:43:53,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 116. [2023-11-29 00:43:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 72 states have internal predecessors, (76), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-29 00:43:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 152 transitions. [2023-11-29 00:43:53,285 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 152 transitions. Word has length 90 [2023-11-29 00:43:53,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:43:53,285 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 152 transitions. [2023-11-29 00:43:53,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:43:53,286 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 152 transitions. [2023-11-29 00:43:53,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-29 00:43:53,287 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:43:53,287 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:43:53,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:43:53,287 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:43:53,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:43:53,288 INFO L85 PathProgramCache]: Analyzing trace with hash 2012962002, now seen corresponding path program 1 times [2023-11-29 00:43:53,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:43:53,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975389039] [2023-11-29 00:43:53,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:53,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:43:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:55,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:43:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:55,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:43:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:55,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:43:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:55,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:43:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:55,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:43:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:55,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:43:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:55,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:43:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:55,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:43:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:55,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:43:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:55,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:43:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:55,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:43:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:55,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:43:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:55,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:43:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:55,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:43:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:55,600 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 00:43:55,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:43:55,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975389039] [2023-11-29 00:43:55,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975389039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:43:55,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:43:55,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 00:43:55,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310884846] [2023-11-29 00:43:55,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:43:55,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:43:55,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:43:55,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:43:55,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:43:55,602 INFO L87 Difference]: Start difference. First operand 116 states and 152 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:43:55,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:43:55,894 INFO L93 Difference]: Finished difference Result 138 states and 174 transitions. [2023-11-29 00:43:55,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 00:43:55,894 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2023-11-29 00:43:55,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:43:55,896 INFO L225 Difference]: With dead ends: 138 [2023-11-29 00:43:55,896 INFO L226 Difference]: Without dead ends: 136 [2023-11-29 00:43:55,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2023-11-29 00:43:55,898 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 35 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:43:55,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 237 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:43:55,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-29 00:43:55,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 116. [2023-11-29 00:43:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 72 states have internal predecessors, (76), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-29 00:43:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 152 transitions. [2023-11-29 00:43:55,920 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 152 transitions. Word has length 91 [2023-11-29 00:43:55,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:43:55,921 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 152 transitions. [2023-11-29 00:43:55,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:43:55,921 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 152 transitions. [2023-11-29 00:43:55,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-11-29 00:43:55,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:43:55,924 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:43:55,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:43:55,924 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:43:55,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:43:55,925 INFO L85 PathProgramCache]: Analyzing trace with hash -678138280, now seen corresponding path program 1 times [2023-11-29 00:43:55,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:43:55,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302084634] [2023-11-29 00:43:55,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:55,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:43:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:43:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:43:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:43:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:43:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:43:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:43:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:43:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:43:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:43:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:43:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:43:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:43:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:43:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:43:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 00:43:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:43:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 00:43:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:43:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:43:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 00:43:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:43:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-29 00:43:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:43:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-29 00:43:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-29 00:43:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-29 00:43:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-29 00:43:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-29 00:43:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1543 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1535 trivial. 0 not checked. [2023-11-29 00:43:58,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:43:58,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302084634] [2023-11-29 00:43:58,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302084634] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:43:58,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138648636] [2023-11-29 00:43:58,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:58,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:43:58,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:43:58,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:43:58,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:43:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-29 00:43:58,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:44:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1543 backedges. 180 proven. 538 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2023-11-29 00:44:29,416 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:44:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1543 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1535 trivial. 0 not checked. [2023-11-29 00:44:35,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138648636] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 00:44:35,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:44:35,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7, 14] total 25 [2023-11-29 00:44:35,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410709217] [2023-11-29 00:44:35,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:44:35,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:44:35,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:44:35,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:44:35,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2023-11-29 00:44:35,489 INFO L87 Difference]: Start difference. First operand 116 states and 152 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:44:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:44:35,771 INFO L93 Difference]: Finished difference Result 128 states and 167 transitions. [2023-11-29 00:44:35,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:44:35,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 178 [2023-11-29 00:44:35,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:44:35,772 INFO L225 Difference]: With dead ends: 128 [2023-11-29 00:44:35,772 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 00:44:35,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2023-11-29 00:44:35,774 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 52 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:44:35,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 234 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:44:35,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 00:44:35,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 00:44:35,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 00:44:35,776 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2023-11-29 00:44:35,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:44:35,776 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 00:44:35,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:44:35,777 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 00:44:35,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 00:44:35,779 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 00:44:35,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:44:35,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:35,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 00:44:36,809 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse3 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse3 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= 0 .cse3) (<= ~var_1_8~0 10) (= (* (div ~var_1_9~0 256) 256) ~var_1_9~0)) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)))))) [2023-11-29 00:44:36,809 INFO L895 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (let ((.cse3 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse3 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= 0 .cse3) (<= ~var_1_8~0 10) (= (* (div ~var_1_9~0 256) 256) ~var_1_9~0)) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)))))) [2023-11-29 00:44:36,809 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 00:44:36,809 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 00:44:36,809 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 00:44:36,809 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-11-29 00:44:36,810 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse3 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse3 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (and (<= 0 .cse3) (<= ~var_1_8~0 10)))))) [2023-11-29 00:44:36,810 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (let ((.cse3 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse3 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (and (<= 0 .cse3) (<= ~var_1_8~0 10)))))) [2023-11-29 00:44:36,810 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 44) no Hoare annotation was computed. [2023-11-29 00:44:36,810 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 61) no Hoare annotation was computed. [2023-11-29 00:44:36,810 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-11-29 00:44:36,810 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 00:44:36,810 INFO L902 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: true [2023-11-29 00:44:36,810 INFO L902 garLoopResultBuilder]: At program point L82-1(line 82) the Hoare annotation is: true [2023-11-29 00:44:36,810 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-11-29 00:44:36,811 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (let ((.cse3 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse3 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (and (<= 0 .cse3) (<= ~var_1_8~0 10)))))) [2023-11-29 00:44:36,811 INFO L895 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: (let ((.cse3 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse3 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (and (<= 0 .cse3) (<= ~var_1_8~0 10)))))) [2023-11-29 00:44:36,811 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 00:44:36,811 INFO L895 garLoopResultBuilder]: At program point L95-2(lines 95 101) the Hoare annotation is: (let ((.cse3 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse3 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= 0 .cse3) (<= ~var_1_8~0 10) (= (* (div ~var_1_9~0 256) 256) ~var_1_9~0)) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)))))) [2023-11-29 00:44:36,811 INFO L899 garLoopResultBuilder]: For program point L95-3(lines 95 101) no Hoare annotation was computed. [2023-11-29 00:44:36,811 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2023-11-29 00:44:36,811 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 56) no Hoare annotation was computed. [2023-11-29 00:44:36,811 INFO L899 garLoopResultBuilder]: For program point L54-2(lines 54 56) no Hoare annotation was computed. [2023-11-29 00:44:36,811 INFO L899 garLoopResultBuilder]: For program point L83(lines 62 84) no Hoare annotation was computed. [2023-11-29 00:44:36,811 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 52) no Hoare annotation was computed. [2023-11-29 00:44:36,811 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 52) no Hoare annotation was computed. [2023-11-29 00:44:36,812 INFO L902 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: true [2023-11-29 00:44:36,812 INFO L902 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: true [2023-11-29 00:44:36,812 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 00:44:36,812 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-11-29 00:44:36,812 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 48) no Hoare annotation was computed. [2023-11-29 00:44:36,812 INFO L899 garLoopResultBuilder]: For program point L38-1(lines 38 48) no Hoare annotation was computed. [2023-11-29 00:44:36,812 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse3 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse3 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= 0 .cse3) (<= ~var_1_8~0 10) (= (* (div ~var_1_9~0 256) 256) ~var_1_9~0)) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)))))) [2023-11-29 00:44:36,812 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse3 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse3 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= 0 .cse3) (<= ~var_1_8~0 10) (= (* (div ~var_1_9~0 256) 256) ~var_1_9~0)) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)))))) [2023-11-29 00:44:36,812 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-11-29 00:44:36,812 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse3 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse3 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (and (<= 0 .cse3) (<= ~var_1_8~0 10)))))) [2023-11-29 00:44:36,813 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (let ((.cse3 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse3 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (and (<= 0 .cse3) (<= ~var_1_8~0 10)))))) [2023-11-29 00:44:36,813 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 47) no Hoare annotation was computed. [2023-11-29 00:44:36,813 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-11-29 00:44:36,813 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 00:44:36,813 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 00:44:36,813 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 00:44:36,813 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 00:44:36,816 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:44:36,817 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:44:36,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:44:36 BoogieIcfgContainer [2023-11-29 00:44:36,829 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:44:36,829 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:44:36,829 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:44:36,830 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:44:36,830 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:43:44" (3/4) ... [2023-11-29 00:44:36,832 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 00:44:36,836 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 00:44:36,841 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-11-29 00:44:36,842 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 00:44:36,842 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 00:44:36,842 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 00:44:36,929 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 00:44:36,929 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 00:44:36,929 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:44:36,930 INFO L158 Benchmark]: Toolchain (without parser) took 53273.44ms. Allocated memory was 148.9MB in the beginning and 545.3MB in the end (delta: 396.4MB). Free memory was 114.2MB in the beginning and 462.8MB in the end (delta: -348.5MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. [2023-11-29 00:44:36,931 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 148.9MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:44:36,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.63ms. Allocated memory is still 148.9MB. Free memory was 113.7MB in the beginning and 101.2MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 00:44:36,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.80ms. Allocated memory is still 148.9MB. Free memory was 101.2MB in the beginning and 98.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:44:36,932 INFO L158 Benchmark]: Boogie Preprocessor took 47.67ms. Allocated memory is still 148.9MB. Free memory was 98.6MB in the beginning and 93.9MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 00:44:36,932 INFO L158 Benchmark]: RCFGBuilder took 415.49ms. Allocated memory is still 148.9MB. Free memory was 93.9MB in the beginning and 76.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 00:44:36,932 INFO L158 Benchmark]: TraceAbstraction took 52399.76ms. Allocated memory was 148.9MB in the beginning and 545.3MB in the end (delta: 396.4MB). Free memory was 75.0MB in the beginning and 468.0MB in the end (delta: -393.0MB). Peak memory consumption was 285.9MB. Max. memory is 16.1GB. [2023-11-29 00:44:36,933 INFO L158 Benchmark]: Witness Printer took 100.25ms. Allocated memory is still 545.3MB. Free memory was 468.0MB in the beginning and 462.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:44:36,934 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.22ms. Allocated memory is still 148.9MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.63ms. Allocated memory is still 148.9MB. Free memory was 113.7MB in the beginning and 101.2MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.80ms. Allocated memory is still 148.9MB. Free memory was 101.2MB in the beginning and 98.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.67ms. Allocated memory is still 148.9MB. Free memory was 98.6MB in the beginning and 93.9MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 415.49ms. Allocated memory is still 148.9MB. Free memory was 93.9MB in the beginning and 76.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 52399.76ms. Allocated memory was 148.9MB in the beginning and 545.3MB in the end (delta: 396.4MB). Free memory was 75.0MB in the beginning and 468.0MB in the end (delta: -393.0MB). Peak memory consumption was 285.9MB. Max. memory is 16.1GB. * Witness Printer took 100.25ms. Allocated memory is still 545.3MB. Free memory was 468.0MB in the beginning and 462.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 52.3s, OverallIterations: 8, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 242 mSDsluCounter, 1386 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 886 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 549 IncrementalHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 500 mSDtfsCounter, 549 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 701 GetRequests, 632 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=3, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 50 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 181 PreInvPairs, 227 NumberOfFragments, 711 HoareAnnotationTreeSize, 181 FomulaSimplifications, 386 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 3482 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 48.5s InterpolantComputationTime, 982 NumberOfCodeBlocks, 982 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1150 ConstructedInterpolants, 0 QuantifiedInterpolants, 5766 SizeOfPredicates, 40 NumberOfNonLiveVariables, 385 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 6638/7177 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((var_1_8 / 256) * 256) + var_1_15) == var_1_8) && ((((var_1_8 / 256) * 256) + var_1_12) <= ((256 * (var_1_12 / 256)) + var_1_8))) || (((0 <= (var_1_8 / 256)) && (var_1_8 <= 10)) && (((var_1_9 / 256) * 256) == var_1_9))) || (((((256 * (var_1_12 / 256)) + var_1_8) + 1) <= (((var_1_8 / 256) * 256) + var_1_12)) && (((256 * (var_1_12 / 256)) + var_1_15) == var_1_12))) RESULT: Ultimate proved your program to be correct! [2023-11-29 00:44:36,953 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfee24bd-50fa-41c0-bcaa-8c1b3462dbef/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 Writing output log to file Ultimate.log Result: TRUE