./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c75672e-2e06-41e4-b110-4b103502a304/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c75672e-2e06-41e4-b110-4b103502a304/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_9c75672e-2e06-41e4-b110-4b103502a304/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c75672e-2e06-41e4-b110-4b103502a304/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-32.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c75672e-2e06-41e4-b110-4b103502a304/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_9c75672e-2e06-41e4-b110-4b103502a304/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 e3899bbf26c9ae805c010051d9160ff07bcd5d68dc29e4a0284125764e39562e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:57:55,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:57:55,101 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c75672e-2e06-41e4-b110-4b103502a304/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 06:57:55,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:57:55,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:57:55,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:57:55,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:57:55,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:57:55,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:57:55,139 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:57:55,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:57:55,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:57:55,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:57:55,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:57:55,141 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:57:55,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:57:55,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:57:55,143 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:57:55,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:57:55,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:57:55,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:57:55,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:57:55,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:57:55,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:57:55,146 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:57:55,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:57:55,147 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:57:55,147 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:57:55,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:57:55,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:57:55,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:57:55,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:57:55,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:57:55,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:57:55,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:57:55,149 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:57:55,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:57:55,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:57:55,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:57:55,150 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:57:55,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:57:55,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:57:55,151 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_9c75672e-2e06-41e4-b110-4b103502a304/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_9c75672e-2e06-41e4-b110-4b103502a304/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 -> e3899bbf26c9ae805c010051d9160ff07bcd5d68dc29e4a0284125764e39562e [2023-11-29 06:57:55,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:57:55,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:57:55,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:57:55,419 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:57:55,420 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:57:55,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c75672e-2e06-41e4-b110-4b103502a304/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-32.i [2023-11-29 06:57:58,131 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:57:58,332 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:57:58,332 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c75672e-2e06-41e4-b110-4b103502a304/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-32.i [2023-11-29 06:57:58,346 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c75672e-2e06-41e4-b110-4b103502a304/bin/uautomizer-verify-BQ2R08f2Ya/data/ba80a1268/44e2413a337844c7a25339bd3c3116f7/FLAG2b4cf6ca3 [2023-11-29 06:57:58,363 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c75672e-2e06-41e4-b110-4b103502a304/bin/uautomizer-verify-BQ2R08f2Ya/data/ba80a1268/44e2413a337844c7a25339bd3c3116f7 [2023-11-29 06:57:58,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:57:58,367 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:57:58,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:57:58,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:57:58,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:57:58,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:57:58" (1/1) ... [2023-11-29 06:57:58,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74986861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:57:58, skipping insertion in model container [2023-11-29 06:57:58,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:57:58" (1/1) ... [2023-11-29 06:57:58,403 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:57:58,528 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_9c75672e-2e06-41e4-b110-4b103502a304/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-32.i[913,926] [2023-11-29 06:57:58,575 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:57:58,588 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:57:58,600 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_9c75672e-2e06-41e4-b110-4b103502a304/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-32.i[913,926] [2023-11-29 06:57:58,628 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:57:58,644 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:57:58,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:57:58 WrapperNode [2023-11-29 06:57:58,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:57:58,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:57:58,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:57:58,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:57:58,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:57:58" (1/1) ... [2023-11-29 06:57:58,663 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:57:58" (1/1) ... [2023-11-29 06:57:58,693 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2023-11-29 06:57:58,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:57:58,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:57:58,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:57:58,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:57:58,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:57:58" (1/1) ... [2023-11-29 06:57:58,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:57:58" (1/1) ... [2023-11-29 06:57:58,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:57:58" (1/1) ... [2023-11-29 06:57:58,740 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 06:57:58,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:57:58" (1/1) ... [2023-11-29 06:57:58,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:57:58" (1/1) ... [2023-11-29 06:57:58,749 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:57:58" (1/1) ... [2023-11-29 06:57:58,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:57:58" (1/1) ... [2023-11-29 06:57:58,763 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:57:58" (1/1) ... [2023-11-29 06:57:58,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:57:58" (1/1) ... [2023-11-29 06:57:58,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:57:58,780 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:57:58,780 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:57:58,780 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:57:58,781 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:57:58" (1/1) ... [2023-11-29 06:57:58,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:57:58,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c75672e-2e06-41e4-b110-4b103502a304/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:57:58,813 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c75672e-2e06-41e4-b110-4b103502a304/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:57:58,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c75672e-2e06-41e4-b110-4b103502a304/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:57:58,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:57:58,850 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 06:57:58,850 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 06:57:58,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:57:58,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:57:58,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:57:58,924 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:57:58,926 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:57:59,169 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:57:59,208 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:57:59,208 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 06:57:59,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:57:59 BoogieIcfgContainer [2023-11-29 06:57:59,209 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:57:59,212 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:57:59,212 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:57:59,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:57:59,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:57:58" (1/3) ... [2023-11-29 06:57:59,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665cf644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:57:59, skipping insertion in model container [2023-11-29 06:57:59,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:57:58" (2/3) ... [2023-11-29 06:57:59,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665cf644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:57:59, skipping insertion in model container [2023-11-29 06:57:59,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:57:59" (3/3) ... [2023-11-29 06:57:59,219 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-32.i [2023-11-29 06:57:59,240 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:57:59,240 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 06:57:59,297 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:57:59,305 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;@52202aa6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:57:59,305 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 06:57:59,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 06:57:59,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 06:57:59,325 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:57:59,326 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:59,327 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:57:59,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:57:59,333 INFO L85 PathProgramCache]: Analyzing trace with hash 887830059, now seen corresponding path program 1 times [2023-11-29 06:57:59,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:57:59,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972338860] [2023-11-29 06:57:59,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:57:59,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:57:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:59,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:57:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:59,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:57:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:59,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:57:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:59,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:57:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:59,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:57:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:59,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:57:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:59,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:57:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:59,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:57:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:59,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:57:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:59,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:57:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:59,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:57:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:59,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:57:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:59,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:57:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:59,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:57:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:59,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:57:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:59,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:57:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:59,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:57:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:59,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:57:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:57:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 06:57:59,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:57:59,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972338860] [2023-11-29 06:57:59,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972338860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:57:59,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:57:59,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:57:59,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910002896] [2023-11-29 06:57:59,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:57:59,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:57:59,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:57:59,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:57:59,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:57:59,941 INFO L87 Difference]: Start difference. First operand has 49 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:58:00,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:58:00,102 INFO L93 Difference]: Finished difference Result 95 states and 168 transitions. [2023-11-29 06:58:00,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:58:00,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 109 [2023-11-29 06:58:00,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:58:00,116 INFO L225 Difference]: With dead ends: 95 [2023-11-29 06:58:00,116 INFO L226 Difference]: Without dead ends: 47 [2023-11-29 06:58:00,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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 06:58:00,124 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:58:00,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:58:00,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-29 06:58:00,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-11-29 06:58:00,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 06:58:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 70 transitions. [2023-11-29 06:58:00,179 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 70 transitions. Word has length 109 [2023-11-29 06:58:00,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:58:00,180 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 70 transitions. [2023-11-29 06:58:00,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:58:00,181 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 70 transitions. [2023-11-29 06:58:00,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 06:58:00,184 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:58:00,185 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:58:00,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:58:00,185 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:58:00,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:58:00,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1697176685, now seen corresponding path program 1 times [2023-11-29 06:58:00,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:58:00,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987098171] [2023-11-29 06:58:00,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:58:00,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:58:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:07,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:58:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:07,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:58:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:07,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:58:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:07,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:58:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:07,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:58:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:07,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:58:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:07,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:58:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:07,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:58:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:07,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:58:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:07,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:58:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:07,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:58:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:07,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:58:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:07,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:58:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:07,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:58:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:07,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:58:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:07,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:58:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:07,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:58:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:07,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:58:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 06:58:07,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:58:07,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987098171] [2023-11-29 06:58:07,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987098171] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:58:07,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:58:07,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 06:58:07,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690356082] [2023-11-29 06:58:07,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:58:07,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 06:58:07,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:58:07,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 06:58:07,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:58:07,235 INFO L87 Difference]: Start difference. First operand 47 states and 70 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-29 06:58:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:58:10,101 INFO L93 Difference]: Finished difference Result 151 states and 213 transitions. [2023-11-29 06:58:10,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 06:58:10,102 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 109 [2023-11-29 06:58:10,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:58:10,105 INFO L225 Difference]: With dead ends: 151 [2023-11-29 06:58:10,105 INFO L226 Difference]: Without dead ends: 149 [2023-11-29 06:58:10,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=271, Invalid=851, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 06:58:10,107 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 203 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:58:10,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 328 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 06:58:10,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-11-29 06:58:10,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 73. [2023-11-29 06:58:10,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 06:58:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2023-11-29 06:58:10,133 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 109 [2023-11-29 06:58:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:58:10,134 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2023-11-29 06:58:10,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-29 06:58:10,134 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2023-11-29 06:58:10,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 06:58:10,137 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:58:10,137 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:58:10,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:58:10,137 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:58:10,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:58:10,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1057797391, now seen corresponding path program 1 times [2023-11-29 06:58:10,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:58:10,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844216476] [2023-11-29 06:58:10,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:58:10,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:58:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:14,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:58:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:14,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:58:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:14,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:58:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:14,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:58:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:14,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:58:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:14,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:58:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:14,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:58:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:14,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:58:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:14,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:58:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:14,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:58:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:14,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:58:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:14,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:58:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:14,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:58:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:14,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:58:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:14,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:58:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:14,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:58:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:14,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:58:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:14,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:58:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:14,441 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 06:58:14,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:58:14,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844216476] [2023-11-29 06:58:14,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844216476] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:58:14,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:58:14,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 06:58:14,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977703053] [2023-11-29 06:58:14,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:58:14,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:58:14,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:58:14,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:58:14,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:58:14,444 INFO L87 Difference]: Start difference. First operand 73 states and 106 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:58:15,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:58:15,172 INFO L93 Difference]: Finished difference Result 92 states and 128 transitions. [2023-11-29 06:58:15,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:58:15,173 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 110 [2023-11-29 06:58:15,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:58:15,176 INFO L225 Difference]: With dead ends: 92 [2023-11-29 06:58:15,176 INFO L226 Difference]: Without dead ends: 90 [2023-11-29 06:58:15,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2023-11-29 06:58:15,178 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 47 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:58:15,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 255 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:58:15,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-29 06:58:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2023-11-29 06:58:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 06:58:15,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 108 transitions. [2023-11-29 06:58:15,200 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 108 transitions. Word has length 110 [2023-11-29 06:58:15,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:58:15,200 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 108 transitions. [2023-11-29 06:58:15,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:58:15,201 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 108 transitions. [2023-11-29 06:58:15,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 06:58:15,203 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:58:15,203 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:58:15,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:58:15,203 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:58:15,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:58:15,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1577699368, now seen corresponding path program 1 times [2023-11-29 06:58:15,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:58:15,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601236833] [2023-11-29 06:58:15,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:58:15,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:58:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:21,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:58:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:21,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:58:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:21,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:58:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:21,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:58:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:21,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:58:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:21,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:58:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:21,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:58:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:21,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:58:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:21,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:58:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:21,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:58:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:21,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:58:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:21,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:58:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:21,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:58:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:21,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:58:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:21,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:58:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:21,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:58:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:21,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:58:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:21,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:58:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 06:58:21,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:58:21,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601236833] [2023-11-29 06:58:21,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601236833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:58:21,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:58:21,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 06:58:21,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545106946] [2023-11-29 06:58:21,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:58:21,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:58:21,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:58:21,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:58:21,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:58:21,758 INFO L87 Difference]: Start difference. First operand 74 states and 108 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:58:23,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:58:23,091 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2023-11-29 06:58:23,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:58:23,093 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2023-11-29 06:58:23,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:58:23,097 INFO L225 Difference]: With dead ends: 88 [2023-11-29 06:58:23,097 INFO L226 Difference]: Without dead ends: 86 [2023-11-29 06:58:23,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2023-11-29 06:58:23,102 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 66 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:58:23,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 212 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:58:23,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-29 06:58:23,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2023-11-29 06:58:23,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 47 states have internal predecessors, (59), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 06:58:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 107 transitions. [2023-11-29 06:58:23,127 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 107 transitions. Word has length 111 [2023-11-29 06:58:23,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:58:23,127 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 107 transitions. [2023-11-29 06:58:23,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:58:23,128 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 107 transitions. [2023-11-29 06:58:23,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 06:58:23,130 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:58:23,130 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:58:23,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:58:23,130 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:58:23,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:58:23,131 INFO L85 PathProgramCache]: Analyzing trace with hash 958873527, now seen corresponding path program 1 times [2023-11-29 06:58:23,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:58:23,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049964440] [2023-11-29 06:58:23,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:58:23,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:58:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:25,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:58:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:25,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:58:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:25,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:58:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:25,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:58:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:25,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:58:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:25,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:58:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:25,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:58:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:25,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:58:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:25,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:58:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:25,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:58:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:25,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:58:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:25,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:58:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:25,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:58:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:25,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:58:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:25,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:58:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:25,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:58:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:25,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:58:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:25,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:58:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:25,261 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 06:58:25,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:58:25,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049964440] [2023-11-29 06:58:25,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049964440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:58:25,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:58:25,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 06:58:25,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786525606] [2023-11-29 06:58:25,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:58:25,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:58:25,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:58:25,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:58:25,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:58:25,264 INFO L87 Difference]: Start difference. First operand 73 states and 107 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:58:26,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:58:26,214 INFO L93 Difference]: Finished difference Result 166 states and 238 transitions. [2023-11-29 06:58:26,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 06:58:26,215 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2023-11-29 06:58:26,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:58:26,217 INFO L225 Difference]: With dead ends: 166 [2023-11-29 06:58:26,217 INFO L226 Difference]: Without dead ends: 94 [2023-11-29 06:58:26,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2023-11-29 06:58:26,220 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 70 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:58:26,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 195 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:58:26,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-29 06:58:26,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2023-11-29 06:58:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 49 states have internal predecessors, (61), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 06:58:26,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2023-11-29 06:58:26,244 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 111 [2023-11-29 06:58:26,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:58:26,245 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2023-11-29 06:58:26,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:58:26,246 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2023-11-29 06:58:26,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 06:58:26,248 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:58:26,248 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:58:26,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:58:26,248 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:58:26,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:58:26,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1016131829, now seen corresponding path program 1 times [2023-11-29 06:58:26,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:58:26,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710201167] [2023-11-29 06:58:26,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:58:26,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:58:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:30,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:58:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:30,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:58:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:30,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:58:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:30,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:58:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:30,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:58:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:30,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:58:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:30,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:58:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:30,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:58:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:30,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:58:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:30,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:58:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:30,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:58:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:30,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:58:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:30,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:58:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:30,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:58:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:30,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:58:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:30,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:58:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:30,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:58:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:30,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:58:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 06:58:30,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:58:30,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710201167] [2023-11-29 06:58:30,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710201167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:58:30,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:58:30,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:58:30,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033106557] [2023-11-29 06:58:30,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:58:30,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:58:30,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:58:30,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:58:30,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:58:30,173 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:58:30,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:58:30,710 INFO L93 Difference]: Finished difference Result 102 states and 137 transitions. [2023-11-29 06:58:30,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:58:30,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2023-11-29 06:58:30,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:58:30,712 INFO L225 Difference]: With dead ends: 102 [2023-11-29 06:58:30,712 INFO L226 Difference]: Without dead ends: 100 [2023-11-29 06:58:30,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:58:30,713 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 41 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:58:30,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 216 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:58:30,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-29 06:58:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 73. [2023-11-29 06:58:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 06:58:30,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2023-11-29 06:58:30,734 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 111 [2023-11-29 06:58:30,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:58:30,734 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2023-11-29 06:58:30,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:58:30,735 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2023-11-29 06:58:30,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 06:58:30,736 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:58:30,736 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:58:30,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 06:58:30,737 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:58:30,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:58:30,737 INFO L85 PathProgramCache]: Analyzing trace with hash -354764027, now seen corresponding path program 1 times [2023-11-29 06:58:30,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:58:30,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050420762] [2023-11-29 06:58:30,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:58:30,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:58:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:32,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:58:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:32,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:58:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:32,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:58:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:32,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:58:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:32,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:58:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:32,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:58:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:32,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:58:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:32,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:58:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:32,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:58:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:32,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:58:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:32,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:58:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:32,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:58:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:32,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:58:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:32,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:58:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:32,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:58:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:32,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:58:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:32,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:58:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:32,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:58:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:32,382 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 06:58:32,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:58:32,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050420762] [2023-11-29 06:58:32,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050420762] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:58:32,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:58:32,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 06:58:32,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442411519] [2023-11-29 06:58:32,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:58:32,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 06:58:32,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:58:32,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 06:58:32,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:58:32,384 INFO L87 Difference]: Start difference. First operand 73 states and 106 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:58:34,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:58:34,290 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2023-11-29 06:58:34,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 06:58:34,290 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2023-11-29 06:58:34,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:58:34,291 INFO L225 Difference]: With dead ends: 90 [2023-11-29 06:58:34,291 INFO L226 Difference]: Without dead ends: 88 [2023-11-29 06:58:34,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2023-11-29 06:58:34,292 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 67 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:58:34,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 383 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:58:34,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-29 06:58:34,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 73. [2023-11-29 06:58:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 06:58:34,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2023-11-29 06:58:34,310 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 112 [2023-11-29 06:58:34,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:58:34,311 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2023-11-29 06:58:34,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:58:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2023-11-29 06:58:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 06:58:34,312 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:58:34,313 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:58:34,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 06:58:34,313 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:58:34,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:58:34,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1877596512, now seen corresponding path program 1 times [2023-11-29 06:58:34,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:58:34,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748798386] [2023-11-29 06:58:34,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:58:34,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:58:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:39,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:58:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:39,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:58:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:39,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:58:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:39,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:58:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:39,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:58:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:39,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:58:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:39,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:58:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:39,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:58:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:39,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:58:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:39,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:58:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:39,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:58:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:39,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:58:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:39,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:58:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:39,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:58:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:39,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:58:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:39,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:58:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:39,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:58:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:39,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:58:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:39,154 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 06:58:39,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:58:39,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748798386] [2023-11-29 06:58:39,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748798386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:58:39,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:58:39,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 06:58:39,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472226096] [2023-11-29 06:58:39,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:58:39,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:58:39,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:58:39,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:58:39,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:58:39,156 INFO L87 Difference]: Start difference. First operand 73 states and 106 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:58:39,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:58:39,773 INFO L93 Difference]: Finished difference Result 88 states and 121 transitions. [2023-11-29 06:58:39,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:58:39,774 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2023-11-29 06:58:39,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:58:39,774 INFO L225 Difference]: With dead ends: 88 [2023-11-29 06:58:39,775 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 06:58:39,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2023-11-29 06:58:39,776 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 28 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:58:39,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 214 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:58:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 06:58:39,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 06:58:39,777 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 06:58:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 06:58:39,777 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2023-11-29 06:58:39,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:58:39,777 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 06:58:39,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:58:39,778 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 06:58:39,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 06:58:39,780 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 06:58:39,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 06:58:39,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 07:07:26,633 WARN L293 SmtUtils]: Spent 8.78m on a formula simplification. DAG size of input: 251 DAG size of output: 537 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 07:07:32,343 WARN L293 SmtUtils]: Spent 5.53s on a formula simplification. DAG size of input: 537 DAG size of output: 34 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 07:07:32,392 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 07:07:32,393 INFO L895 garLoopResultBuilder]: At program point L85-1(line 85) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 07:07:32,393 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 07:07:32,393 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 07:07:32,393 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 07:07:32,393 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-11-29 07:07:32,393 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2023-11-29 07:07:32,393 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 63) no Hoare annotation was computed. [2023-11-29 07:07:32,393 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 07:07:32,393 INFO L895 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 07:07:32,393 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 64) no Hoare annotation was computed. [2023-11-29 07:07:32,393 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 60) no Hoare annotation was computed. [2023-11-29 07:07:32,393 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 07:07:32,394 INFO L895 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 07:07:32,394 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 48) no Hoare annotation was computed. [2023-11-29 07:07:32,394 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 07:07:32,394 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-11-29 07:07:32,394 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2023-11-29 07:07:32,394 INFO L895 garLoopResultBuilder]: At program point L104-2(lines 104 110) the Hoare annotation is: (let ((.cse0 (<= 0 ~last_1_var_1_6~0))) (or (and (= ~var_1_6~0 0) .cse0) (and (let ((.cse4 (* (div ~var_1_5~0 65536) 65536))) (let ((.cse3 (+ .cse4 ~var_1_4~0 ~var_1_3~0)) (.cse1 (* (div ~var_1_4~0 65536) 65536)) (.cse2 (* (div ~var_1_3~0 65536) 65536))) (or (and (= (+ .cse1 .cse2 ~var_1_1~0) (+ ~var_1_4~0 ~var_1_3~0)) (<= (+ .cse1 .cse2 ~var_1_5~0 1) .cse3)) (and (<= .cse3 (+ .cse1 .cse2 ~var_1_5~0)) (= (+ .cse4 ~var_1_1~0) ~var_1_5~0))))) .cse0 (<= 0 ~var_1_6~0)))) [2023-11-29 07:07:32,394 INFO L899 garLoopResultBuilder]: For program point L104-3(lines 104 110) no Hoare annotation was computed. [2023-11-29 07:07:32,394 INFO L899 garLoopResultBuilder]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2023-11-29 07:07:32,395 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 07:07:32,395 INFO L895 garLoopResultBuilder]: At program point L88-1(line 88) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 07:07:32,395 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 57) no Hoare annotation was computed. [2023-11-29 07:07:32,395 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-11-29 07:07:32,395 INFO L899 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2023-11-29 07:07:32,395 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 07:07:32,395 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 07:07:32,396 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 07:07:32,396 INFO L895 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 07:07:32,396 INFO L895 garLoopResultBuilder]: At program point L82-1(line 82) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 07:07:32,396 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-11-29 07:07:32,396 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 07:07:32,396 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 07:07:32,396 INFO L895 garLoopResultBuilder]: At program point L91-1(line 91) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 07:07:32,397 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2023-11-29 07:07:32,397 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 50) no Hoare annotation was computed. [2023-11-29 07:07:32,397 INFO L899 garLoopResultBuilder]: For program point L42-1(lines 42 50) no Hoare annotation was computed. [2023-11-29 07:07:32,397 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 07:07:32,397 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 07:07:32,397 INFO L899 garLoopResultBuilder]: For program point L92(lines 65 93) no Hoare annotation was computed. [2023-11-29 07:07:32,397 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 07:07:32,397 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 07:07:32,397 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 49) no Hoare annotation was computed. [2023-11-29 07:07:32,398 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-11-29 07:07:32,398 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 07:07:32,398 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 07:07:32,398 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 07:07:32,398 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 07:07:32,401 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:07:32,404 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 07:07:32,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 07:07:32 BoogieIcfgContainer [2023-11-29 07:07:32,418 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 07:07:32,419 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 07:07:32,419 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 07:07:32,419 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 07:07:32,419 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:57:59" (3/4) ... [2023-11-29 07:07:32,422 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 07:07:32,426 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 07:07:32,433 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-11-29 07:07:32,433 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 07:07:32,434 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 07:07:32,434 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 07:07:32,535 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c75672e-2e06-41e4-b110-4b103502a304/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 07:07:32,535 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c75672e-2e06-41e4-b110-4b103502a304/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 07:07:32,535 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 07:07:32,536 INFO L158 Benchmark]: Toolchain (without parser) took 574168.91ms. Allocated memory was 197.1MB in the beginning and 692.1MB in the end (delta: 494.9MB). Free memory was 128.6MB in the beginning and 260.6MB in the end (delta: -131.9MB). Peak memory consumption was 366.1MB. Max. memory is 16.1GB. [2023-11-29 07:07:32,536 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 197.1MB. Free memory is still 170.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 07:07:32,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.86ms. Allocated memory is still 197.1MB. Free memory was 128.4MB in the beginning and 115.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 07:07:32,537 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.72ms. Allocated memory is still 197.1MB. Free memory was 115.6MB in the beginning and 112.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 07:07:32,537 INFO L158 Benchmark]: Boogie Preprocessor took 84.52ms. Allocated memory is still 197.1MB. Free memory was 112.5MB in the beginning and 166.4MB in the end (delta: -53.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 07:07:32,537 INFO L158 Benchmark]: RCFGBuilder took 429.49ms. Allocated memory is still 197.1MB. Free memory was 166.4MB in the beginning and 146.0MB in the end (delta: 20.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 07:07:32,538 INFO L158 Benchmark]: TraceAbstraction took 573205.65ms. Allocated memory was 197.1MB in the beginning and 692.1MB in the end (delta: 494.9MB). Free memory was 145.4MB in the beginning and 265.8MB in the end (delta: -120.4MB). Peak memory consumption was 399.7MB. Max. memory is 16.1GB. [2023-11-29 07:07:32,538 INFO L158 Benchmark]: Witness Printer took 116.71ms. Allocated memory is still 692.1MB. Free memory was 265.8MB in the beginning and 260.6MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 07:07:32,540 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.29ms. Allocated memory is still 197.1MB. Free memory is still 170.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.86ms. Allocated memory is still 197.1MB. Free memory was 128.4MB in the beginning and 115.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.72ms. Allocated memory is still 197.1MB. Free memory was 115.6MB in the beginning and 112.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.52ms. Allocated memory is still 197.1MB. Free memory was 112.5MB in the beginning and 166.4MB in the end (delta: -53.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 429.49ms. Allocated memory is still 197.1MB. Free memory was 166.4MB in the beginning and 146.0MB in the end (delta: 20.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 573205.65ms. Allocated memory was 197.1MB in the beginning and 692.1MB in the end (delta: 494.9MB). Free memory was 145.4MB in the beginning and 265.8MB in the end (delta: -120.4MB). Peak memory consumption was 399.7MB. Max. memory is 16.1GB. * Witness Printer took 116.71ms. Allocated memory is still 692.1MB. Free memory was 265.8MB in the beginning and 260.6MB in the end (delta: 5.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, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 573.1s, OverallIterations: 8, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 532.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 576 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 1868 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1382 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1197 IncrementalHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 486 mSDtfsCounter, 1197 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=5, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 166 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 85 PreInvPairs, 116 NumberOfFragments, 213 HoareAnnotationTreeSize, 85 FomulaSimplifications, 15892937 FormulaSimplificationTreeSizeReduction, 526.9s HoareSimplificationTime, 20 FomulaSimplificationsInter, 452452 FormulaSimplificationTreeSizeReductionInter, 5.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 30.5s InterpolantComputationTime, 886 NumberOfCodeBlocks, 886 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 878 ConstructedInterpolants, 0 QuantifiedInterpolants, 10622 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 4896/4896 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: 104]: Loop Invariant Derived loop invariant: (((var_1_6 == 0) && (0 <= last_1_var_1_6)) || (((((((((var_1_4 / 65536) * 65536) + ((var_1_3 / 65536) * 65536)) + var_1_1) == (var_1_4 + var_1_3)) && ((((((var_1_4 / 65536) * 65536) + ((var_1_3 / 65536) * 65536)) + var_1_5) + 1) <= ((((var_1_5 / 65536) * 65536) + var_1_4) + var_1_3))) || ((((((var_1_5 / 65536) * 65536) + var_1_4) + var_1_3) <= ((((var_1_4 / 65536) * 65536) + ((var_1_3 / 65536) * 65536)) + var_1_5)) && ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))) && (0 <= last_1_var_1_6)) && (0 <= var_1_6))) RESULT: Ultimate proved your program to be correct! [2023-11-29 07:07:32,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c75672e-2e06-41e4-b110-4b103502a304/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