./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.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_e410b558-7654-4cb1-bcba-92f59818bdfa/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e410b558-7654-4cb1-bcba-92f59818bdfa/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_e410b558-7654-4cb1-bcba-92f59818bdfa/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e410b558-7654-4cb1-bcba-92f59818bdfa/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e410b558-7654-4cb1-bcba-92f59818bdfa/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_e410b558-7654-4cb1-bcba-92f59818bdfa/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 9851c0f9ab930af20c037ab1e499f4c9a2b58cea1e3329cd85ff2166a0e5d289 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:05:37,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:05:37,638 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e410b558-7654-4cb1-bcba-92f59818bdfa/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 02:05:37,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:05:37,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:05:37,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:05:37,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:05:37,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:05:37,666 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:05:37,667 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:05:37,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:05:37,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:05:37,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:05:37,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:05:37,670 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:05:37,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:05:37,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:05:37,671 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:05:37,672 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:05:37,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:05:37,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:05:37,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:05:37,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:05:37,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:05:37,678 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:05:37,678 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:05:37,679 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:05:37,679 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:05:37,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:05:37,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:05:37,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:05:37,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:05:37,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:05:37,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:05:37,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:05:37,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:05:37,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:05:37,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:05:37,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:05:37,682 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:05:37,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:05:37,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:05:37,683 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_e410b558-7654-4cb1-bcba-92f59818bdfa/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_e410b558-7654-4cb1-bcba-92f59818bdfa/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 -> 9851c0f9ab930af20c037ab1e499f4c9a2b58cea1e3329cd85ff2166a0e5d289 [2023-11-29 02:05:37,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:05:37,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:05:37,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:05:37,925 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:05:37,926 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:05:37,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e410b558-7654-4cb1-bcba-92f59818bdfa/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i [2023-11-29 02:05:40,717 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:05:40,930 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:05:40,931 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e410b558-7654-4cb1-bcba-92f59818bdfa/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i [2023-11-29 02:05:40,938 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e410b558-7654-4cb1-bcba-92f59818bdfa/bin/uautomizer-verify-BQ2R08f2Ya/data/987481753/d3bf9d180f874f258db2cec6106c10d4/FLAGb4d89ffa8 [2023-11-29 02:05:40,948 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e410b558-7654-4cb1-bcba-92f59818bdfa/bin/uautomizer-verify-BQ2R08f2Ya/data/987481753/d3bf9d180f874f258db2cec6106c10d4 [2023-11-29 02:05:40,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:05:40,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:05:40,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:05:40,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:05:40,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:05:40,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:05:40" (1/1) ... [2023-11-29 02:05:40,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c0907ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:05:40, skipping insertion in model container [2023-11-29 02:05:40,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:05:40" (1/1) ... [2023-11-29 02:05:40,985 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:05:41,106 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_e410b558-7654-4cb1-bcba-92f59818bdfa/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i[915,928] [2023-11-29 02:05:41,143 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:05:41,154 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:05:41,167 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_e410b558-7654-4cb1-bcba-92f59818bdfa/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i[915,928] [2023-11-29 02:05:41,188 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:05:41,205 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:05:41,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:05:41 WrapperNode [2023-11-29 02:05:41,206 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:05:41,207 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:05:41,207 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:05:41,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:05:41,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:05:41" (1/1) ... [2023-11-29 02:05:41,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:05:41" (1/1) ... [2023-11-29 02:05:41,252 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2023-11-29 02:05:41,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:05:41,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:05:41,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:05:41,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:05:41,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:05:41" (1/1) ... [2023-11-29 02:05:41,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:05:41" (1/1) ... [2023-11-29 02:05:41,264 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:05:41" (1/1) ... [2023-11-29 02:05:41,278 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 02:05:41,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:05:41" (1/1) ... [2023-11-29 02:05:41,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:05:41" (1/1) ... [2023-11-29 02:05:41,286 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:05:41" (1/1) ... [2023-11-29 02:05:41,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:05:41" (1/1) ... [2023-11-29 02:05:41,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:05:41" (1/1) ... [2023-11-29 02:05:41,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:05:41" (1/1) ... [2023-11-29 02:05:41,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:05:41,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:05:41,299 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:05:41,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:05:41,300 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:05:41" (1/1) ... [2023-11-29 02:05:41,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:05:41,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e410b558-7654-4cb1-bcba-92f59818bdfa/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:05:41,334 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e410b558-7654-4cb1-bcba-92f59818bdfa/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:05:41,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e410b558-7654-4cb1-bcba-92f59818bdfa/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:05:41,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:05:41,368 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 02:05:41,368 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 02:05:41,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:05:41,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:05:41,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:05:41,435 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:05:41,437 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:05:41,660 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:05:41,708 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:05:41,708 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 02:05:41,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:05:41 BoogieIcfgContainer [2023-11-29 02:05:41,709 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:05:41,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:05:41,712 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:05:41,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:05:41,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:05:40" (1/3) ... [2023-11-29 02:05:41,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4622549e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:05:41, skipping insertion in model container [2023-11-29 02:05:41,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:05:41" (2/3) ... [2023-11-29 02:05:41,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4622549e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:05:41, skipping insertion in model container [2023-11-29 02:05:41,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:05:41" (3/3) ... [2023-11-29 02:05:41,731 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-22.i [2023-11-29 02:05:41,749 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:05:41,749 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 02:05:41,795 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:05:41,802 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;@2755efe9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:05:41,802 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 02:05:41,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 31 states have internal predecessors, (46), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 02:05:41,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 02:05:41,817 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:41,818 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:05:41,818 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:05:41,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:41,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1708927778, now seen corresponding path program 1 times [2023-11-29 02:05:41,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:05:41,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534490716] [2023-11-29 02:05:41,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:05:41,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:05:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:42,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:05:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:42,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:05:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:42,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:05:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:42,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:05:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:42,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:05:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:42,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 02:05:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:42,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:05:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:42,068 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-29 02:05:42,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:05:42,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534490716] [2023-11-29 02:05:42,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534490716] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:05:42,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:05:42,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:05:42,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917020680] [2023-11-29 02:05:42,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:05:42,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:05:42,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:05:42,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:05:42,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:05:42,108 INFO L87 Difference]: Start difference. First operand has 40 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 31 states have internal predecessors, (46), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 02:05:42,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:42,144 INFO L93 Difference]: Finished difference Result 79 states and 126 transitions. [2023-11-29 02:05:42,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:05:42,147 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2023-11-29 02:05:42,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:42,155 INFO L225 Difference]: With dead ends: 79 [2023-11-29 02:05:42,155 INFO L226 Difference]: Without dead ends: 38 [2023-11-29 02:05:42,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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 02:05:42,162 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:42,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:05:42,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-29 02:05:42,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-29 02:05:42,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 02:05:42,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2023-11-29 02:05:42,199 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 54 [2023-11-29 02:05:42,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:42,200 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2023-11-29 02:05:42,200 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 02:05:42,200 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2023-11-29 02:05:42,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 02:05:42,203 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:42,203 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:05:42,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:05:42,204 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:05:42,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:42,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1072522266, now seen corresponding path program 1 times [2023-11-29 02:05:42,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:05:42,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908555934] [2023-11-29 02:05:42,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:05:42,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:05:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:42,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:05:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:42,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:05:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:42,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:05:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:42,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:05:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:42,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:05:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:42,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 02:05:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:42,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:05:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-29 02:05:42,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:05:42,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908555934] [2023-11-29 02:05:42,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908555934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:05:42,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:05:42,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:05:42,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310610251] [2023-11-29 02:05:42,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:05:42,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:05:42,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:05:42,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:05:42,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:05:42,909 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 02:05:43,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:43,136 INFO L93 Difference]: Finished difference Result 132 states and 180 transitions. [2023-11-29 02:05:43,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:05:43,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 54 [2023-11-29 02:05:43,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:43,139 INFO L225 Difference]: With dead ends: 132 [2023-11-29 02:05:43,139 INFO L226 Difference]: Without dead ends: 95 [2023-11-29 02:05:43,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:05:43,141 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 84 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:43,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 157 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:05:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-29 02:05:43,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 67. [2023-11-29 02:05:43,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 02:05:43,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 92 transitions. [2023-11-29 02:05:43,162 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 92 transitions. Word has length 54 [2023-11-29 02:05:43,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:43,163 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 92 transitions. [2023-11-29 02:05:43,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 02:05:43,163 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2023-11-29 02:05:43,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 02:05:43,165 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:43,165 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:05:43,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:05:43,166 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:05:43,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:43,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1201644873, now seen corresponding path program 1 times [2023-11-29 02:05:43,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:05:43,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353065067] [2023-11-29 02:05:43,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:05:43,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:05:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:43,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:05:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:43,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:05:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:43,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:05:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:43,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:05:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:43,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:05:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:43,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 02:05:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:43,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:05:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:43,551 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-29 02:05:43,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:05:43,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353065067] [2023-11-29 02:05:43,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353065067] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:05:43,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:05:43,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:05:43,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827298893] [2023-11-29 02:05:43,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:05:43,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:05:43,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:05:43,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:05:43,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:05:43,555 INFO L87 Difference]: Start difference. First operand 67 states and 92 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 02:05:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:43,860 INFO L93 Difference]: Finished difference Result 200 states and 269 transitions. [2023-11-29 02:05:43,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:05:43,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2023-11-29 02:05:43,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:43,863 INFO L225 Difference]: With dead ends: 200 [2023-11-29 02:05:43,863 INFO L226 Difference]: Without dead ends: 163 [2023-11-29 02:05:43,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:05:43,865 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 83 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:43,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 184 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:05:43,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-29 02:05:43,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 110. [2023-11-29 02:05:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 02:05:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 152 transitions. [2023-11-29 02:05:43,890 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 152 transitions. Word has length 55 [2023-11-29 02:05:43,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:43,891 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 152 transitions. [2023-11-29 02:05:43,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 02:05:43,891 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 152 transitions. [2023-11-29 02:05:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 02:05:43,893 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:43,893 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:05:43,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:05:43,893 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:05:43,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:43,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1459810311, now seen corresponding path program 1 times [2023-11-29 02:05:43,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:05:43,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175170455] [2023-11-29 02:05:43,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:05:43,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:05:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:43,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:05:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:43,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:05:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:43,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:05:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:43,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:05:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:43,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:05:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:43,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 02:05:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:43,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:05:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:43,960 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-29 02:05:43,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:05:43,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175170455] [2023-11-29 02:05:43,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175170455] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:05:43,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:05:43,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:05:43,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853722157] [2023-11-29 02:05:43,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:05:43,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:05:43,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:05:43,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:05:43,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:05:43,963 INFO L87 Difference]: Start difference. First operand 110 states and 152 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 02:05:43,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:43,995 INFO L93 Difference]: Finished difference Result 175 states and 239 transitions. [2023-11-29 02:05:43,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:05:43,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2023-11-29 02:05:43,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:43,998 INFO L225 Difference]: With dead ends: 175 [2023-11-29 02:05:43,998 INFO L226 Difference]: Without dead ends: 138 [2023-11-29 02:05:43,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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 02:05:44,000 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 21 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:44,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 102 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:05:44,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-29 02:05:44,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114. [2023-11-29 02:05:44,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 02:05:44,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 156 transitions. [2023-11-29 02:05:44,021 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 156 transitions. Word has length 55 [2023-11-29 02:05:44,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:44,022 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 156 transitions. [2023-11-29 02:05:44,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 02:05:44,022 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 156 transitions. [2023-11-29 02:05:44,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 02:05:44,024 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:44,024 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:05:44,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:05:44,024 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:05:44,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:44,025 INFO L85 PathProgramCache]: Analyzing trace with hash -882947203, now seen corresponding path program 1 times [2023-11-29 02:05:44,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:05:44,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140356543] [2023-11-29 02:05:44,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:05:44,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:05:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:44,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:05:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:44,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:05:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:44,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:05:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:44,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:05:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:44,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:05:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:44,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 02:05:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:44,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:05:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:44,264 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-29 02:05:44,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:05:44,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140356543] [2023-11-29 02:05:44,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140356543] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:05:44,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:05:44,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:05:44,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650485745] [2023-11-29 02:05:44,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:05:44,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:05:44,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:05:44,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:05:44,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:05:44,266 INFO L87 Difference]: Start difference. First operand 114 states and 156 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 02:05:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:44,397 INFO L93 Difference]: Finished difference Result 262 states and 356 transitions. [2023-11-29 02:05:44,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:05:44,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2023-11-29 02:05:44,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:44,400 INFO L225 Difference]: With dead ends: 262 [2023-11-29 02:05:44,400 INFO L226 Difference]: Without dead ends: 167 [2023-11-29 02:05:44,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:05:44,402 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 50 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:44,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 131 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:05:44,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-11-29 02:05:44,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 114. [2023-11-29 02:05:44,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 89 states have internal predecessors, (113), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 02:05:44,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2023-11-29 02:05:44,426 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 55 [2023-11-29 02:05:44,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:44,427 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2023-11-29 02:05:44,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 02:05:44,427 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2023-11-29 02:05:44,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-29 02:05:44,429 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:44,429 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:05:44,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:05:44,429 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:05:44,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:44,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1175113682, now seen corresponding path program 1 times [2023-11-29 02:05:44,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:05:44,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464881294] [2023-11-29 02:05:44,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:05:44,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:05:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:45,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:05:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:45,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:05:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:45,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:05:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:45,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:05:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:45,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:05:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:45,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 02:05:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:45,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:05:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:45,886 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-29 02:05:45,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:05:45,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464881294] [2023-11-29 02:05:45,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464881294] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:05:45,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:05:45,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:05:45,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069715787] [2023-11-29 02:05:45,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:05:45,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:05:45,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:05:45,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:05:45,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:05:45,889 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 02:05:46,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:46,423 INFO L93 Difference]: Finished difference Result 321 states and 432 transitions. [2023-11-29 02:05:46,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 02:05:46,423 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 56 [2023-11-29 02:05:46,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:46,426 INFO L225 Difference]: With dead ends: 321 [2023-11-29 02:05:46,426 INFO L226 Difference]: Without dead ends: 226 [2023-11-29 02:05:46,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2023-11-29 02:05:46,428 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 253 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:46,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 253 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:05:46,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-11-29 02:05:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 105. [2023-11-29 02:05:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 02:05:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 141 transitions. [2023-11-29 02:05:46,452 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 141 transitions. Word has length 56 [2023-11-29 02:05:46,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:46,453 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 141 transitions. [2023-11-29 02:05:46,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 02:05:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 141 transitions. [2023-11-29 02:05:46,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-29 02:05:46,454 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:46,455 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:05:46,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:05:46,455 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:05:46,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:46,455 INFO L85 PathProgramCache]: Analyzing trace with hash -344607468, now seen corresponding path program 1 times [2023-11-29 02:05:46,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:05:46,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304280338] [2023-11-29 02:05:46,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:05:46,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:05:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:46,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:05:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:46,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:05:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:46,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:05:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:46,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:05:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:46,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:05:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:46,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 02:05:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:46,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:05:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-29 02:05:46,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:05:46,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304280338] [2023-11-29 02:05:46,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304280338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:05:46,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:05:46,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:05:46,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132846116] [2023-11-29 02:05:46,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:05:46,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:05:46,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:05:46,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:05:46,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:05:46,519 INFO L87 Difference]: Start difference. First operand 105 states and 141 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 02:05:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:46,568 INFO L93 Difference]: Finished difference Result 183 states and 245 transitions. [2023-11-29 02:05:46,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:05:46,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 56 [2023-11-29 02:05:46,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:46,571 INFO L225 Difference]: With dead ends: 183 [2023-11-29 02:05:46,571 INFO L226 Difference]: Without dead ends: 97 [2023-11-29 02:05:46,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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 02:05:46,572 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 9 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:46,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 67 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:05:46,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-29 02:05:46,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2023-11-29 02:05:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 67 states have internal predecessors, (79), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 02:05:46,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2023-11-29 02:05:46,592 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 56 [2023-11-29 02:05:46,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:46,593 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. [2023-11-29 02:05:46,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 02:05:46,593 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2023-11-29 02:05:46,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-29 02:05:46,594 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:46,594 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:05:46,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:05:46,594 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:05:46,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:46,595 INFO L85 PathProgramCache]: Analyzing trace with hash 48419542, now seen corresponding path program 1 times [2023-11-29 02:05:46,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:05:46,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28299510] [2023-11-29 02:05:46,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:05:46,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:05:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:46,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:05:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:46,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:05:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:46,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:05:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:46,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:05:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:46,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:05:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:46,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 02:05:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:46,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:05:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:46,685 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-29 02:05:46,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:05:46,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28299510] [2023-11-29 02:05:46,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28299510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:05:46,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:05:46,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:05:46,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605243679] [2023-11-29 02:05:46,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:05:46,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:05:46,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:05:46,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:05:46,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:05:46,688 INFO L87 Difference]: Start difference. First operand 92 states and 121 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 02:05:46,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:46,756 INFO L93 Difference]: Finished difference Result 169 states and 224 transitions. [2023-11-29 02:05:46,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:05:46,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 56 [2023-11-29 02:05:46,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:46,758 INFO L225 Difference]: With dead ends: 169 [2023-11-29 02:05:46,758 INFO L226 Difference]: Without dead ends: 130 [2023-11-29 02:05:46,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 02:05:46,760 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 26 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:46,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 81 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:05:46,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-29 02:05:46,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2023-11-29 02:05:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 95 states have (on average 1.1894736842105262) internal successors, (113), 95 states have internal predecessors, (113), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-29 02:05:46,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 169 transitions. [2023-11-29 02:05:46,784 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 169 transitions. Word has length 56 [2023-11-29 02:05:46,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:46,785 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 169 transitions. [2023-11-29 02:05:46,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 02:05:46,785 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 169 transitions. [2023-11-29 02:05:46,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 02:05:46,786 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:46,786 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:05:46,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:05:46,787 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:05:46,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:46,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1729606721, now seen corresponding path program 1 times [2023-11-29 02:05:46,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:05:46,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653826990] [2023-11-29 02:05:46,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:05:46,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:05:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:47,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:05:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:47,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:05:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:47,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:05:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:47,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:05:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:47,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:05:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:47,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 02:05:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:47,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:05:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-29 02:05:47,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:05:47,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653826990] [2023-11-29 02:05:47,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653826990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:05:47,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:05:47,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:05:47,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112213536] [2023-11-29 02:05:47,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:05:47,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:05:47,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:05:47,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:05:47,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:05:47,409 INFO L87 Difference]: Start difference. First operand 128 states and 169 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 02:05:47,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:47,590 INFO L93 Difference]: Finished difference Result 237 states and 311 transitions. [2023-11-29 02:05:47,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:05:47,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 57 [2023-11-29 02:05:47,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:47,593 INFO L225 Difference]: With dead ends: 237 [2023-11-29 02:05:47,593 INFO L226 Difference]: Without dead ends: 163 [2023-11-29 02:05:47,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:05:47,594 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 56 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:47,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 213 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:05:47,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-29 02:05:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 138. [2023-11-29 02:05:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 105 states have (on average 1.1904761904761905) internal successors, (125), 105 states have internal predecessors, (125), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-29 02:05:47,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 181 transitions. [2023-11-29 02:05:47,612 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 181 transitions. Word has length 57 [2023-11-29 02:05:47,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:47,612 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 181 transitions. [2023-11-29 02:05:47,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 02:05:47,613 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 181 transitions. [2023-11-29 02:05:47,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 02:05:47,613 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:47,613 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:05:47,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:05:47,614 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:05:47,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:47,614 INFO L85 PathProgramCache]: Analyzing trace with hash -803362353, now seen corresponding path program 1 times [2023-11-29 02:05:47,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:05:47,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80731142] [2023-11-29 02:05:47,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:05:47,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:05:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:48,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:05:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:48,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:05:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:48,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:05:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:48,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:05:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:48,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:05:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:48,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 02:05:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:48,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:05:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:48,437 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-29 02:05:48,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:05:48,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80731142] [2023-11-29 02:05:48,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80731142] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:05:48,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:05:48,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 02:05:48,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636346105] [2023-11-29 02:05:48,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:05:48,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 02:05:48,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:05:48,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 02:05:48,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:05:48,439 INFO L87 Difference]: Start difference. First operand 138 states and 181 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 02:05:49,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:49,363 INFO L93 Difference]: Finished difference Result 220 states and 282 transitions. [2023-11-29 02:05:49,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 02:05:49,364 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2023-11-29 02:05:49,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:49,366 INFO L225 Difference]: With dead ends: 220 [2023-11-29 02:05:49,366 INFO L226 Difference]: Without dead ends: 218 [2023-11-29 02:05:49,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2023-11-29 02:05:49,367 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 206 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:49,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 354 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 02:05:49,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-11-29 02:05:49,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 153. [2023-11-29 02:05:49,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 120 states have (on average 1.1833333333333333) internal successors, (142), 120 states have internal predecessors, (142), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-29 02:05:49,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 198 transitions. [2023-11-29 02:05:49,382 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 198 transitions. Word has length 59 [2023-11-29 02:05:49,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:49,382 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 198 transitions. [2023-11-29 02:05:49,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 02:05:49,382 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 198 transitions. [2023-11-29 02:05:49,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 02:05:49,383 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:49,383 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:05:49,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:05:49,384 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:05:49,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:49,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1278916388, now seen corresponding path program 1 times [2023-11-29 02:05:49,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:05:49,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708468899] [2023-11-29 02:05:49,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:05:49,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:05:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:49,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:05:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:49,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:05:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:49,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:05:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:49,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:05:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:49,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:05:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:49,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 02:05:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:49,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:05:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:49,802 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-29 02:05:49,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:05:49,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708468899] [2023-11-29 02:05:49,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708468899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:05:49,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:05:49,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:05:49,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101296769] [2023-11-29 02:05:49,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:05:49,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:05:49,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:05:49,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:05:49,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:05:49,804 INFO L87 Difference]: Start difference. First operand 153 states and 198 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 02:05:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:50,076 INFO L93 Difference]: Finished difference Result 162 states and 207 transitions. [2023-11-29 02:05:50,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:05:50,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2023-11-29 02:05:50,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:50,078 INFO L225 Difference]: With dead ends: 162 [2023-11-29 02:05:50,078 INFO L226 Difference]: Without dead ends: 160 [2023-11-29 02:05:50,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:05:50,079 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 45 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:50,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 300 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:05:50,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-29 02:05:50,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 153. [2023-11-29 02:05:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 120 states have (on average 1.175) internal successors, (141), 120 states have internal predecessors, (141), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-29 02:05:50,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 197 transitions. [2023-11-29 02:05:50,098 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 197 transitions. Word has length 60 [2023-11-29 02:05:50,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:50,098 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 197 transitions. [2023-11-29 02:05:50,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 02:05:50,098 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 197 transitions. [2023-11-29 02:05:50,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 02:05:50,100 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:50,100 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:05:50,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 02:05:50,100 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:05:50,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:50,101 INFO L85 PathProgramCache]: Analyzing trace with hash 350790167, now seen corresponding path program 1 times [2023-11-29 02:05:50,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:05:50,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144158838] [2023-11-29 02:05:50,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:05:50,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:05:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:50,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:05:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:50,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:05:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:50,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:05:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:50,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:05:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:50,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:05:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:50,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 02:05:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:50,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:05:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:50,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 02:05:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:50,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 02:05:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:50,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 02:05:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:50,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:05:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:50,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 02:05:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:50,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 02:05:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:50,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 02:05:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 02:05:50,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:05:50,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144158838] [2023-11-29 02:05:50,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144158838] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:05:50,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:05:50,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:05:50,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521546381] [2023-11-29 02:05:50,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:05:50,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:05:50,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:05:50,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:05:50,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:05:50,204 INFO L87 Difference]: Start difference. First operand 153 states and 197 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 02:05:50,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:50,238 INFO L93 Difference]: Finished difference Result 186 states and 232 transitions. [2023-11-29 02:05:50,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:05:50,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2023-11-29 02:05:50,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:50,239 INFO L225 Difference]: With dead ends: 186 [2023-11-29 02:05:50,239 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 02:05:50,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 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 02:05:50,240 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:50,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 85 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:05:50,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 02:05:50,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 02:05:50,242 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 02:05:50,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 02:05:50,242 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2023-11-29 02:05:50,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:50,242 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 02:05:50,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 02:05:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 02:05:50,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 02:05:50,245 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 02:05:50,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 02:05:50,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 02:05:50,732 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2023-11-29 02:05:50,732 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 02:05:50,733 INFO L899 garLoopResultBuilder]: For program point L52-2(line 52) no Hoare annotation was computed. [2023-11-29 02:05:50,733 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 02:05:50,733 INFO L899 garLoopResultBuilder]: For program point L52-4(lines 52 56) no Hoare annotation was computed. [2023-11-29 02:05:50,733 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 02:05:50,733 INFO L899 garLoopResultBuilder]: For program point L52-6(lines 35 60) no Hoare annotation was computed. [2023-11-29 02:05:50,733 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 50) no Hoare annotation was computed. [2023-11-29 02:05:50,734 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-11-29 02:05:50,734 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-11-29 02:05:50,734 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 42) no Hoare annotation was computed. [2023-11-29 02:05:50,734 INFO L895 garLoopResultBuilder]: At program point L87-3(lines 87 93) the Hoare annotation is: (let ((.cse0 (div ~last_1_var_1_11~0 4294967296)) (.cse9 (* 65536 (div ~last_1_var_1_5~0 65536)))) (let ((.cse1 (= (+ 5 ~var_1_1~0) 0)) (.cse2 (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0)) (.cse4 (<= 1 |ULTIMATE.start_main_~k_loop~0#1|)) (.cse8 (= (+ .cse9 ~var_1_5~0) ~last_1_var_1_5~0)) (.cse5 (not (= (+ .cse9 ~last_1_var_1_11~0) (+ ~last_1_var_1_5~0 (* .cse0 4294967296))))) (.cse3 (= 256 ~last_1_var_1_5~0))) (or (and (< ~last_1_var_1_11~0 9) (< 0 (+ .cse0 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) .cse1 .cse2 (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) .cse3) (and .cse4 (= (+ 5 ~var_1_11~0) 0) .cse5 .cse1 .cse2 (let ((.cse7 (+ .cse9 ~var_1_6~0)) (.cse6 (* (div ~var_1_6~0 65536) 65536))) (or (and (= (+ ~var_1_5~0 8 .cse6) ~var_1_6~0) (<= (+ 8 .cse6 ~last_1_var_1_5~0) .cse7)) (and (<= .cse7 (+ 7 .cse6 ~last_1_var_1_5~0)) .cse8)))) (and (= (+ .cse9 ~var_1_1~0) ~last_1_var_1_5~0) .cse4 .cse8 .cse5 (= ~var_1_1~0 ~var_1_11~0) .cse3)))) [2023-11-29 02:05:50,734 INFO L899 garLoopResultBuilder]: For program point L87-4(lines 87 93) no Hoare annotation was computed. [2023-11-29 02:05:50,735 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 02:05:50,735 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-11-29 02:05:50,735 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-11-29 02:05:50,735 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-11-29 02:05:50,736 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-11-29 02:05:50,736 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-11-29 02:05:50,736 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 49) no Hoare annotation was computed. [2023-11-29 02:05:50,736 INFO L899 garLoopResultBuilder]: For program point L80-1(line 80) no Hoare annotation was computed. [2023-11-29 02:05:50,736 INFO L899 garLoopResultBuilder]: For program point L47-2(lines 44 50) no Hoare annotation was computed. [2023-11-29 02:05:50,736 INFO L899 garLoopResultBuilder]: For program point L80-3(line 80) no Hoare annotation was computed. [2023-11-29 02:05:50,737 INFO L899 garLoopResultBuilder]: For program point L80-5(line 80) no Hoare annotation was computed. [2023-11-29 02:05:50,737 INFO L899 garLoopResultBuilder]: For program point L80-7(line 80) no Hoare annotation was computed. [2023-11-29 02:05:50,737 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 41) no Hoare annotation was computed. [2023-11-29 02:05:50,737 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 36 42) no Hoare annotation was computed. [2023-11-29 02:05:50,737 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-11-29 02:05:50,737 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-11-29 02:05:50,737 INFO L899 garLoopResultBuilder]: For program point L73-1(lines 61 74) no Hoare annotation was computed. [2023-11-29 02:05:50,737 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 02:05:50,738 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-11-29 02:05:50,738 INFO L895 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-11-29 02:05:50,738 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 02:05:50,738 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-11-29 02:05:50,738 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 60) no Hoare annotation was computed. [2023-11-29 02:05:50,738 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 02:05:50,738 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 02:05:50,739 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 02:05:50,739 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 02:05:50,741 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:05:50,743 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 02:05:50,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 02:05:50 BoogieIcfgContainer [2023-11-29 02:05:50,756 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 02:05:50,757 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:05:50,757 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:05:50,757 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:05:50,757 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:05:41" (3/4) ... [2023-11-29 02:05:50,760 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 02:05:50,763 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 02:05:50,768 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-29 02:05:50,768 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 02:05:50,769 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 02:05:50,769 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 02:05:50,854 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e410b558-7654-4cb1-bcba-92f59818bdfa/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 02:05:50,854 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e410b558-7654-4cb1-bcba-92f59818bdfa/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 02:05:50,855 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:05:50,855 INFO L158 Benchmark]: Toolchain (without parser) took 9903.47ms. Allocated memory was 151.0MB in the beginning and 245.4MB in the end (delta: 94.4MB). Free memory was 111.9MB in the beginning and 182.7MB in the end (delta: -70.8MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2023-11-29 02:05:50,856 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory was 49.0MB in the beginning and 48.9MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:05:50,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.25ms. Allocated memory is still 151.0MB. Free memory was 111.9MB in the beginning and 99.7MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 02:05:50,857 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.82ms. Allocated memory is still 151.0MB. Free memory was 99.7MB in the beginning and 97.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 02:05:50,857 INFO L158 Benchmark]: Boogie Preprocessor took 44.65ms. Allocated memory is still 151.0MB. Free memory was 97.2MB in the beginning and 94.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 02:05:50,857 INFO L158 Benchmark]: RCFGBuilder took 410.38ms. Allocated memory is still 151.0MB. Free memory was 94.0MB in the beginning and 116.7MB in the end (delta: -22.7MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2023-11-29 02:05:50,858 INFO L158 Benchmark]: TraceAbstraction took 9044.69ms. Allocated memory was 151.0MB in the beginning and 245.4MB in the end (delta: 94.4MB). Free memory was 115.9MB in the beginning and 189.0MB in the end (delta: -73.0MB). Peak memory consumption was 142.4MB. Max. memory is 16.1GB. [2023-11-29 02:05:50,858 INFO L158 Benchmark]: Witness Printer took 98.20ms. Allocated memory is still 245.4MB. Free memory was 189.0MB in the beginning and 182.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 02:05:50,860 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.16ms. Allocated memory is still 100.7MB. Free memory was 49.0MB in the beginning and 48.9MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.25ms. Allocated memory is still 151.0MB. Free memory was 111.9MB in the beginning and 99.7MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.82ms. Allocated memory is still 151.0MB. Free memory was 99.7MB in the beginning and 97.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.65ms. Allocated memory is still 151.0MB. Free memory was 97.2MB in the beginning and 94.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 410.38ms. Allocated memory is still 151.0MB. Free memory was 94.0MB in the beginning and 116.7MB in the end (delta: -22.7MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9044.69ms. Allocated memory was 151.0MB in the beginning and 245.4MB in the end (delta: 94.4MB). Free memory was 115.9MB in the beginning and 189.0MB in the end (delta: -73.0MB). Peak memory consumption was 142.4MB. Max. memory is 16.1GB. * Witness Printer took 98.20ms. Allocated memory is still 245.4MB. Free memory was 189.0MB in the beginning and 182.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 12, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 837 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 837 mSDsluCounter, 1976 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1351 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1187 IncrementalHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 625 mSDtfsCounter, 1187 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=10, InterpolantAutomatonStates: 89, 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, 12 MinimizatonAttempts, 383 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 127 PreInvPairs, 137 NumberOfFragments, 368 HoareAnnotationTreeSize, 127 FomulaSimplifications, 940 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 504 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 729 NumberOfCodeBlocks, 729 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 717 ConstructedInterpolants, 0 QuantifiedInterpolants, 3881 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 1312/1312 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: 87]: Loop Invariant Derived loop invariant: ((((((((((last_1_var_1_11 < 9) && (0 < ((last_1_var_1_11 / 4294967296) + 1))) && (0 <= k_loop)) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (256 == var_1_5)) && (8 == var_1_11)) && (256 == last_1_var_1_5)) || ((((((1 <= k_loop) && ((5 + var_1_11) == 0)) && !((((65536 * (last_1_var_1_5 / 65536)) + last_1_var_1_11) == (last_1_var_1_5 + ((last_1_var_1_11 / 4294967296) * 4294967296))))) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (((((var_1_5 + 8) + ((var_1_6 / 65536) * 65536)) == var_1_6) && (((8 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5) <= ((65536 * (last_1_var_1_5 / 65536)) + var_1_6))) || ((((65536 * (last_1_var_1_5 / 65536)) + var_1_6) <= ((7 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5)) && (((65536 * (last_1_var_1_5 / 65536)) + var_1_5) == last_1_var_1_5))))) || ((((((((65536 * (last_1_var_1_5 / 65536)) + var_1_1) == last_1_var_1_5) && (1 <= k_loop)) && (((65536 * (last_1_var_1_5 / 65536)) + var_1_5) == last_1_var_1_5)) && !((((65536 * (last_1_var_1_5 / 65536)) + last_1_var_1_11) == (last_1_var_1_5 + ((last_1_var_1_11 / 4294967296) * 4294967296))))) && (var_1_1 == var_1_11)) && (256 == last_1_var_1_5))) RESULT: Ultimate proved your program to be correct! [2023-11-29 02:05:50,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e410b558-7654-4cb1-bcba-92f59818bdfa/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE