./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label33.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66d0130-b154-4f0e-b95f-f82a01428fea/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66d0130-b154-4f0e-b95f-f82a01428fea/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66d0130-b154-4f0e-b95f-f82a01428fea/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66d0130-b154-4f0e-b95f-f82a01428fea/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label33.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66d0130-b154-4f0e-b95f-f82a01428fea/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66d0130-b154-4f0e-b95f-f82a01428fea/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0dc7da6c9ebc36311a2e0eb52338fe893a1666a8a55675173b675bffa81bee06 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:50:23,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:50:24,039 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66d0130-b154-4f0e-b95f-f82a01428fea/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 18:50:24,046 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:50:24,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:50:24,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:50:24,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:50:24,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:50:24,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:50:24,101 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:50:24,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:50:24,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:50:24,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:50:24,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:50:24,104 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:50:24,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:50:24,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:50:24,106 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:50:24,107 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:50:24,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:50:24,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:50:24,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:50:24,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:50:24,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:50:24,110 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:50:24,111 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:50:24,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:50:24,112 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:50:24,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:50:24,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:50:24,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:50:24,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:50:24,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:50:24,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:50:24,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:50:24,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:50:24,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:50:24,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:50:24,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:50:24,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:50:24,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:50:24,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:50:24,120 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_e66d0130-b154-4f0e-b95f-f82a01428fea/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66d0130-b154-4f0e-b95f-f82a01428fea/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0dc7da6c9ebc36311a2e0eb52338fe893a1666a8a55675173b675bffa81bee06 [2024-11-08 18:50:24,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:50:24,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:50:24,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:50:24,570 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:50:24,571 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:50:24,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66d0130-b154-4f0e-b95f-f82a01428fea/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/eca-rers2012/Problem02_label33.c Unable to find full path for "g++" [2024-11-08 18:50:27,051 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:50:27,406 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:50:27,407 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66d0130-b154-4f0e-b95f-f82a01428fea/sv-benchmarks/c/eca-rers2012/Problem02_label33.c [2024-11-08 18:50:27,422 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66d0130-b154-4f0e-b95f-f82a01428fea/bin/uautomizer-verify-jihMAELWvX/data/b5405f23a/5860aab7e4004db999ca05438054c57b/FLAG0bb1f4382 [2024-11-08 18:50:27,443 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66d0130-b154-4f0e-b95f-f82a01428fea/bin/uautomizer-verify-jihMAELWvX/data/b5405f23a/5860aab7e4004db999ca05438054c57b [2024-11-08 18:50:27,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:50:27,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:50:27,454 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:50:27,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:50:27,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:50:27,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:50:27" (1/1) ... [2024-11-08 18:50:27,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@320a8809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:50:27, skipping insertion in model container [2024-11-08 18:50:27,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:50:27" (1/1) ... [2024-11-08 18:50:27,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:50:28,116 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66d0130-b154-4f0e-b95f-f82a01428fea/sv-benchmarks/c/eca-rers2012/Problem02_label33.c[21447,21460] [2024-11-08 18:50:28,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:50:28,165 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:50:28,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66d0130-b154-4f0e-b95f-f82a01428fea/sv-benchmarks/c/eca-rers2012/Problem02_label33.c[21447,21460] [2024-11-08 18:50:28,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:50:28,359 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:50:28,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:50:28 WrapperNode [2024-11-08 18:50:28,360 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:50:28,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:50:28,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:50:28,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:50:28,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:50:28" (1/1) ... [2024-11-08 18:50:28,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:50:28" (1/1) ... [2024-11-08 18:50:28,466 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-08 18:50:28,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:50:28,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:50:28,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:50:28,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:50:28,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:50:28" (1/1) ... [2024-11-08 18:50:28,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:50:28" (1/1) ... [2024-11-08 18:50:28,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:50:28" (1/1) ... [2024-11-08 18:50:28,525 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]. [2024-11-08 18:50:28,526 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:50:28" (1/1) ... [2024-11-08 18:50:28,526 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:50:28" (1/1) ... [2024-11-08 18:50:28,564 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:50:28" (1/1) ... [2024-11-08 18:50:28,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:50:28" (1/1) ... [2024-11-08 18:50:28,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:50:28" (1/1) ... [2024-11-08 18:50:28,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:50:28" (1/1) ... [2024-11-08 18:50:28,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:50:28,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:50:28,643 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:50:28,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:50:28,645 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:50:28" (1/1) ... [2024-11-08 18:50:28,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:50:28,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66d0130-b154-4f0e-b95f-f82a01428fea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:50:28,693 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66d0130-b154-4f0e-b95f-f82a01428fea/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:50:28,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66d0130-b154-4f0e-b95f-f82a01428fea/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:50:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:50:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:50:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:50:28,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:50:28,839 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:50:28,841 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:50:30,305 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-08 18:50:30,307 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:50:30,340 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:50:30,340 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:50:30,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:50:30 BoogieIcfgContainer [2024-11-08 18:50:30,341 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:50:30,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:50:30,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:50:30,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:50:30,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:50:27" (1/3) ... [2024-11-08 18:50:30,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1d052a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:50:30, skipping insertion in model container [2024-11-08 18:50:30,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:50:28" (2/3) ... [2024-11-08 18:50:30,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1d052a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:50:30, skipping insertion in model container [2024-11-08 18:50:30,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:50:30" (3/3) ... [2024-11-08 18:50:30,356 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label33.c [2024-11-08 18:50:30,383 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:50:30,385 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:50:30,496 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:50:30,502 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@f14f5ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:50:30,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:50:30,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 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) [2024-11-08 18:50:30,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 18:50:30,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:50:30,538 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:50:30,539 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:50:30,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:50:30,547 INFO L85 PathProgramCache]: Analyzing trace with hash -308011462, now seen corresponding path program 1 times [2024-11-08 18:50:30,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:50:30,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006783197] [2024-11-08 18:50:30,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:50:30,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:50:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:31,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:50:31,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:50:31,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006783197] [2024-11-08 18:50:31,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006783197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:50:31,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:50:31,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:50:31,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675994137] [2024-11-08 18:50:31,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:50:31,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:50:31,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:50:31,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:50:31,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:50:31,290 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 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) Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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) [2024-11-08 18:50:32,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:50:32,497 INFO L93 Difference]: Finished difference Result 601 states and 1035 transitions. [2024-11-08 18:50:32,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:50:32,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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) Word has length 141 [2024-11-08 18:50:32,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:50:32,522 INFO L225 Difference]: With dead ends: 601 [2024-11-08 18:50:32,523 INFO L226 Difference]: Without dead ends: 310 [2024-11-08 18:50:32,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:50:32,535 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 93 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:50:32,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 117 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 18:50:32,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-08 18:50:32,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2024-11-08 18:50:32,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.4368932038834952) internal successors, (444), 309 states have internal predecessors, (444), 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) [2024-11-08 18:50:32,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 444 transitions. [2024-11-08 18:50:32,613 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 444 transitions. Word has length 141 [2024-11-08 18:50:32,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:50:32,614 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 444 transitions. [2024-11-08 18:50:32,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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) [2024-11-08 18:50:32,615 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 444 transitions. [2024-11-08 18:50:32,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 18:50:32,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:50:32,619 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:50:32,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:50:32,620 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:50:32,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:50:32,621 INFO L85 PathProgramCache]: Analyzing trace with hash -641363207, now seen corresponding path program 1 times [2024-11-08 18:50:32,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:50:32,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817784905] [2024-11-08 18:50:32,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:50:32,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:50:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:50:33,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:50:33,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817784905] [2024-11-08 18:50:33,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817784905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:50:33,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:50:33,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:50:33,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906921048] [2024-11-08 18:50:33,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:50:33,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:50:33,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:50:33,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:50:33,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:50:33,014 INFO L87 Difference]: Start difference. First operand 310 states and 444 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 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) [2024-11-08 18:50:33,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:50:33,728 INFO L93 Difference]: Finished difference Result 911 states and 1313 transitions. [2024-11-08 18:50:33,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:50:33,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 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) Word has length 159 [2024-11-08 18:50:33,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:50:33,733 INFO L225 Difference]: With dead ends: 911 [2024-11-08 18:50:33,737 INFO L226 Difference]: Without dead ends: 603 [2024-11-08 18:50:33,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:50:33,741 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 156 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:50:33,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 98 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 18:50:33,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-08 18:50:33,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 598. [2024-11-08 18:50:33,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.3953098827470687) internal successors, (833), 597 states have internal predecessors, (833), 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) [2024-11-08 18:50:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 833 transitions. [2024-11-08 18:50:33,787 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 833 transitions. Word has length 159 [2024-11-08 18:50:33,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:50:33,788 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 833 transitions. [2024-11-08 18:50:33,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 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) [2024-11-08 18:50:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 833 transitions. [2024-11-08 18:50:33,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 18:50:33,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:50:33,794 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:50:33,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:50:33,795 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:50:33,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:50:33,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1365964957, now seen corresponding path program 1 times [2024-11-08 18:50:33,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:50:33,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541535563] [2024-11-08 18:50:33,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:50:33,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:50:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:50:34,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:50:34,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541535563] [2024-11-08 18:50:34,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541535563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:50:34,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:50:34,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:50:34,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753504209] [2024-11-08 18:50:34,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:50:34,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:50:34,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:50:34,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:50:34,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:50:34,135 INFO L87 Difference]: Start difference. First operand 598 states and 833 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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) [2024-11-08 18:50:34,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:50:34,895 INFO L93 Difference]: Finished difference Result 1755 states and 2451 transitions. [2024-11-08 18:50:34,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:50:34,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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) Word has length 169 [2024-11-08 18:50:34,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:50:34,902 INFO L225 Difference]: With dead ends: 1755 [2024-11-08 18:50:34,902 INFO L226 Difference]: Without dead ends: 1159 [2024-11-08 18:50:34,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:50:34,906 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 146 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:50:34,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 87 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 18:50:34,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2024-11-08 18:50:34,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1159. [2024-11-08 18:50:34,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1158 states have (on average 1.3419689119170986) internal successors, (1554), 1158 states have internal predecessors, (1554), 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) [2024-11-08 18:50:34,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1554 transitions. [2024-11-08 18:50:34,952 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1554 transitions. Word has length 169 [2024-11-08 18:50:34,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:50:34,952 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1554 transitions. [2024-11-08 18:50:34,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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) [2024-11-08 18:50:34,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1554 transitions. [2024-11-08 18:50:34,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 18:50:34,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:50:34,959 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:50:34,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:50:34,959 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:50:34,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:50:34,960 INFO L85 PathProgramCache]: Analyzing trace with hash 187435539, now seen corresponding path program 1 times [2024-11-08 18:50:34,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:50:34,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957413356] [2024-11-08 18:50:34,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:50:34,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:50:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:50:35,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:50:35,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957413356] [2024-11-08 18:50:35,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957413356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:50:35,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:50:35,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:50:35,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319962524] [2024-11-08 18:50:35,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:50:35,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:50:35,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:50:35,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:50:35,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:50:35,189 INFO L87 Difference]: Start difference. First operand 1159 states and 1554 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 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) [2024-11-08 18:50:35,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:50:35,915 INFO L93 Difference]: Finished difference Result 3454 states and 4636 transitions. [2024-11-08 18:50:35,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:50:35,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 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) Word has length 170 [2024-11-08 18:50:35,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:50:35,925 INFO L225 Difference]: With dead ends: 3454 [2024-11-08 18:50:35,925 INFO L226 Difference]: Without dead ends: 2297 [2024-11-08 18:50:35,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:50:35,930 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 176 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:50:35,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 90 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 18:50:35,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2024-11-08 18:50:35,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 2295. [2024-11-08 18:50:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2295 states, 2294 states have (on average 1.2903225806451613) internal successors, (2960), 2294 states have internal predecessors, (2960), 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) [2024-11-08 18:50:35,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 2960 transitions. [2024-11-08 18:50:35,992 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 2960 transitions. Word has length 170 [2024-11-08 18:50:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:50:35,993 INFO L471 AbstractCegarLoop]: Abstraction has 2295 states and 2960 transitions. [2024-11-08 18:50:35,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 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) [2024-11-08 18:50:35,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2960 transitions. [2024-11-08 18:50:35,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-08 18:50:35,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:50:35,999 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:50:35,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:50:35,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:50:36,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:50:36,000 INFO L85 PathProgramCache]: Analyzing trace with hash 875462025, now seen corresponding path program 1 times [2024-11-08 18:50:36,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:50:36,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598932388] [2024-11-08 18:50:36,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:50:36,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:50:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 18:50:36,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:50:36,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598932388] [2024-11-08 18:50:36,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598932388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:50:36,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:50:36,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:50:36,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195694351] [2024-11-08 18:50:36,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:50:36,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:50:36,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:50:36,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:50:36,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:50:36,158 INFO L87 Difference]: Start difference. First operand 2295 states and 2960 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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) [2024-11-08 18:50:36,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:50:36,762 INFO L93 Difference]: Finished difference Result 5710 states and 7303 transitions. [2024-11-08 18:50:36,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:50:36,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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) Word has length 174 [2024-11-08 18:50:36,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:50:36,773 INFO L225 Difference]: With dead ends: 5710 [2024-11-08 18:50:36,773 INFO L226 Difference]: Without dead ends: 3417 [2024-11-08 18:50:36,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:50:36,777 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 167 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:50:36,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 225 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 18:50:36,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3417 states. [2024-11-08 18:50:36,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3417 to 3415. [2024-11-08 18:50:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3415 states, 3414 states have (on average 1.2015231400117166) internal successors, (4102), 3414 states have internal predecessors, (4102), 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) [2024-11-08 18:50:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 4102 transitions. [2024-11-08 18:50:36,845 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 4102 transitions. Word has length 174 [2024-11-08 18:50:36,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:50:36,846 INFO L471 AbstractCegarLoop]: Abstraction has 3415 states and 4102 transitions. [2024-11-08 18:50:36,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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) [2024-11-08 18:50:36,846 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 4102 transitions. [2024-11-08 18:50:36,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-08 18:50:36,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:50:36,852 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:50:36,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:50:36,853 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:50:36,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:50:36,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1966023720, now seen corresponding path program 1 times [2024-11-08 18:50:36,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:50:36,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872579262] [2024-11-08 18:50:36,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:50:36,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:50:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:37,375 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:50:37,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:50:37,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872579262] [2024-11-08 18:50:37,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872579262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:50:37,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:50:37,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:50:37,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791178831] [2024-11-08 18:50:37,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:50:37,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:50:37,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:50:37,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:50:37,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:50:37,380 INFO L87 Difference]: Start difference. First operand 3415 states and 4102 transitions. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 4 states have internal predecessors, (174), 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) [2024-11-08 18:50:38,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:50:38,508 INFO L93 Difference]: Finished difference Result 8088 states and 9682 transitions. [2024-11-08 18:50:38,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:50:38,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 4 states have internal predecessors, (174), 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) Word has length 174 [2024-11-08 18:50:38,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:50:38,523 INFO L225 Difference]: With dead ends: 8088 [2024-11-08 18:50:38,523 INFO L226 Difference]: Without dead ends: 4675 [2024-11-08 18:50:38,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:50:38,529 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 341 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:50:38,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 154 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 18:50:38,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4675 states. [2024-11-08 18:50:38,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4675 to 4255. [2024-11-08 18:50:38,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4255 states, 4254 states have (on average 1.1805359661495063) internal successors, (5022), 4254 states have internal predecessors, (5022), 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) [2024-11-08 18:50:38,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 5022 transitions. [2024-11-08 18:50:38,654 INFO L78 Accepts]: Start accepts. Automaton has 4255 states and 5022 transitions. Word has length 174 [2024-11-08 18:50:38,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:50:38,655 INFO L471 AbstractCegarLoop]: Abstraction has 4255 states and 5022 transitions. [2024-11-08 18:50:38,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 4 states have internal predecessors, (174), 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) [2024-11-08 18:50:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 4255 states and 5022 transitions. [2024-11-08 18:50:38,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 18:50:38,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:50:38,668 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:50:38,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:50:38,668 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:50:38,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:50:38,669 INFO L85 PathProgramCache]: Analyzing trace with hash 310127820, now seen corresponding path program 1 times [2024-11-08 18:50:38,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:50:38,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639496557] [2024-11-08 18:50:38,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:50:38,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:50:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:38,865 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 18:50:38,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:50:38,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639496557] [2024-11-08 18:50:38,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639496557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:50:38,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:50:38,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:50:38,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411817347] [2024-11-08 18:50:38,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:50:38,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:50:38,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:50:38,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:50:38,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:50:38,869 INFO L87 Difference]: Start difference. First operand 4255 states and 5022 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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) [2024-11-08 18:50:39,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:50:39,412 INFO L93 Difference]: Finished difference Result 8508 states and 10042 transitions. [2024-11-08 18:50:39,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:50:39,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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) Word has length 194 [2024-11-08 18:50:39,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:50:39,426 INFO L225 Difference]: With dead ends: 8508 [2024-11-08 18:50:39,426 INFO L226 Difference]: Without dead ends: 4255 [2024-11-08 18:50:39,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:50:39,435 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 135 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:50:39,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 246 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 18:50:39,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2024-11-08 18:50:39,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 3975. [2024-11-08 18:50:39,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3975 states, 3974 states have (on average 1.146200301962758) internal successors, (4555), 3974 states have internal predecessors, (4555), 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) [2024-11-08 18:50:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 4555 transitions. [2024-11-08 18:50:39,564 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 4555 transitions. Word has length 194 [2024-11-08 18:50:39,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:50:39,564 INFO L471 AbstractCegarLoop]: Abstraction has 3975 states and 4555 transitions. [2024-11-08 18:50:39,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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) [2024-11-08 18:50:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 4555 transitions. [2024-11-08 18:50:39,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 18:50:39,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:50:39,572 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:50:39,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:50:39,573 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:50:39,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:50:39,573 INFO L85 PathProgramCache]: Analyzing trace with hash -2118341007, now seen corresponding path program 1 times [2024-11-08 18:50:39,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:50:39,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225235683] [2024-11-08 18:50:39,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:50:39,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:50:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 18:50:39,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:50:39,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225235683] [2024-11-08 18:50:39,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225235683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:50:39,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:50:39,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:50:39,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162702647] [2024-11-08 18:50:39,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:50:39,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:50:39,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:50:39,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:50:39,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:50:39,734 INFO L87 Difference]: Start difference. First operand 3975 states and 4555 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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) [2024-11-08 18:50:40,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:50:40,249 INFO L93 Difference]: Finished difference Result 8509 states and 9720 transitions. [2024-11-08 18:50:40,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:50:40,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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) Word has length 196 [2024-11-08 18:50:40,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:50:40,262 INFO L225 Difference]: With dead ends: 8509 [2024-11-08 18:50:40,263 INFO L226 Difference]: Without dead ends: 3973 [2024-11-08 18:50:40,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:50:40,267 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 162 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:50:40,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 52 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 18:50:40,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3973 states. [2024-11-08 18:50:40,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3973 to 3832. [2024-11-08 18:50:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3832 states, 3831 states have (on average 1.1085878360741321) internal successors, (4247), 3831 states have internal predecessors, (4247), 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) [2024-11-08 18:50:40,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3832 states to 3832 states and 4247 transitions. [2024-11-08 18:50:40,357 INFO L78 Accepts]: Start accepts. Automaton has 3832 states and 4247 transitions. Word has length 196 [2024-11-08 18:50:40,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:50:40,357 INFO L471 AbstractCegarLoop]: Abstraction has 3832 states and 4247 transitions. [2024-11-08 18:50:40,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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) [2024-11-08 18:50:40,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3832 states and 4247 transitions. [2024-11-08 18:50:40,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 18:50:40,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:50:40,367 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:50:40,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:50:40,368 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:50:40,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:50:40,368 INFO L85 PathProgramCache]: Analyzing trace with hash -181326350, now seen corresponding path program 1 times [2024-11-08 18:50:40,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:50:40,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627740332] [2024-11-08 18:50:40,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:50:40,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:50:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:50:40,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:50:40,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627740332] [2024-11-08 18:50:40,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627740332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:50:40,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:50:40,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:50:40,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408973961] [2024-11-08 18:50:40,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:50:40,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:50:40,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:50:40,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:50:40,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:50:40,842 INFO L87 Difference]: Start difference. First operand 3832 states and 4247 transitions. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 3 states have internal predecessors, (209), 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) [2024-11-08 18:50:41,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:50:41,586 INFO L93 Difference]: Finished difference Result 7816 states and 8658 transitions. [2024-11-08 18:50:41,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:50:41,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 3 states have internal predecessors, (209), 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) Word has length 209 [2024-11-08 18:50:41,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:50:41,604 INFO L225 Difference]: With dead ends: 7816 [2024-11-08 18:50:41,604 INFO L226 Difference]: Without dead ends: 3986 [2024-11-08 18:50:41,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:50:41,612 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 106 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:50:41,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 130 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:50:41,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2024-11-08 18:50:41,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3972. [2024-11-08 18:50:41,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3972 states, 3971 states have (on average 1.1057668093679174) internal successors, (4391), 3971 states have internal predecessors, (4391), 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) [2024-11-08 18:50:41,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3972 states to 3972 states and 4391 transitions. [2024-11-08 18:50:41,698 INFO L78 Accepts]: Start accepts. Automaton has 3972 states and 4391 transitions. Word has length 209 [2024-11-08 18:50:41,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:50:41,700 INFO L471 AbstractCegarLoop]: Abstraction has 3972 states and 4391 transitions. [2024-11-08 18:50:41,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 3 states have internal predecessors, (209), 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) [2024-11-08 18:50:41,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3972 states and 4391 transitions. [2024-11-08 18:50:41,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-08 18:50:41,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:50:41,709 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:50:41,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:50:41,709 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:50:41,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:50:41,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1721104748, now seen corresponding path program 1 times [2024-11-08 18:50:41,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:50:41,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381499052] [2024-11-08 18:50:41,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:50:41,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:50:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 18:50:41,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:50:41,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381499052] [2024-11-08 18:50:41,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381499052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:50:41,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:50:41,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:50:41,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717351198] [2024-11-08 18:50:41,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:50:41,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:50:41,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:50:41,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:50:41,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:50:41,925 INFO L87 Difference]: Start difference. First operand 3972 states and 4391 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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) [2024-11-08 18:50:42,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:50:42,505 INFO L93 Difference]: Finished difference Result 8633 states and 9572 transitions. [2024-11-08 18:50:42,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:50:42,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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) Word has length 218 [2024-11-08 18:50:42,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:50:42,526 INFO L225 Difference]: With dead ends: 8633 [2024-11-08 18:50:42,527 INFO L226 Difference]: Without dead ends: 3254 [2024-11-08 18:50:42,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:50:42,532 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 98 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:50:42,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 251 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 18:50:42,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2024-11-08 18:50:42,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 3254. [2024-11-08 18:50:42,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3254 states, 3253 states have (on average 1.09898555179834) internal successors, (3575), 3253 states have internal predecessors, (3575), 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) [2024-11-08 18:50:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 3254 states and 3575 transitions. [2024-11-08 18:50:42,605 INFO L78 Accepts]: Start accepts. Automaton has 3254 states and 3575 transitions. Word has length 218 [2024-11-08 18:50:42,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:50:42,606 INFO L471 AbstractCegarLoop]: Abstraction has 3254 states and 3575 transitions. [2024-11-08 18:50:42,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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) [2024-11-08 18:50:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 3254 states and 3575 transitions. [2024-11-08 18:50:42,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-08 18:50:42,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:50:42,614 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:50:42,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 18:50:42,614 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:50:42,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:50:42,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1205812239, now seen corresponding path program 1 times [2024-11-08 18:50:42,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:50:42,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161565119] [2024-11-08 18:50:42,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:50:42,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:50:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 18:50:43,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:50:43,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161565119] [2024-11-08 18:50:43,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161565119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:50:43,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:50:43,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:50:43,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63384863] [2024-11-08 18:50:43,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:50:43,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:50:43,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:50:43,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:50:43,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:50:43,140 INFO L87 Difference]: Start difference. First operand 3254 states and 3575 transitions. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 3 states have internal predecessors, (211), 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) [2024-11-08 18:50:43,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:50:43,743 INFO L93 Difference]: Finished difference Result 3480 states and 3801 transitions. [2024-11-08 18:50:43,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:50:43,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 3 states have internal predecessors, (211), 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) Word has length 239 [2024-11-08 18:50:43,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:50:43,763 INFO L225 Difference]: With dead ends: 3480 [2024-11-08 18:50:43,764 INFO L226 Difference]: Without dead ends: 3254 [2024-11-08 18:50:43,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:50:43,770 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 141 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:50:43,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 44 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:50:43,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2024-11-08 18:50:43,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 3254. [2024-11-08 18:50:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3254 states, 3253 states have (on average 1.0940670150630187) internal successors, (3559), 3253 states have internal predecessors, (3559), 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) [2024-11-08 18:50:43,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 3254 states and 3559 transitions. [2024-11-08 18:50:43,855 INFO L78 Accepts]: Start accepts. Automaton has 3254 states and 3559 transitions. Word has length 239 [2024-11-08 18:50:43,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:50:43,855 INFO L471 AbstractCegarLoop]: Abstraction has 3254 states and 3559 transitions. [2024-11-08 18:50:43,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 3 states have internal predecessors, (211), 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) [2024-11-08 18:50:43,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3254 states and 3559 transitions. [2024-11-08 18:50:43,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-08 18:50:43,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:50:43,866 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:50:43,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 18:50:43,866 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:50:43,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:50:43,867 INFO L85 PathProgramCache]: Analyzing trace with hash 318331609, now seen corresponding path program 1 times [2024-11-08 18:50:43,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:50:43,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301217455] [2024-11-08 18:50:43,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:50:43,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:50:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 18:50:44,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:50:44,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301217455] [2024-11-08 18:50:44,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301217455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:50:44,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:50:44,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:50:44,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139409709] [2024-11-08 18:50:44,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:50:44,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:50:44,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:50:44,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:50:44,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:50:44,070 INFO L87 Difference]: Start difference. First operand 3254 states and 3559 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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) [2024-11-08 18:50:44,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:50:44,686 INFO L93 Difference]: Finished difference Result 6076 states and 6623 transitions. [2024-11-08 18:50:44,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:50:44,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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) Word has length 243 [2024-11-08 18:50:44,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:50:44,697 INFO L225 Difference]: With dead ends: 6076 [2024-11-08 18:50:44,697 INFO L226 Difference]: Without dead ends: 2124 [2024-11-08 18:50:44,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:50:44,706 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 111 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:50:44,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 217 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:50:44,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2024-11-08 18:50:44,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 1984. [2024-11-08 18:50:44,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1984 states, 1983 states have (on average 1.0600100857286938) internal successors, (2102), 1983 states have internal predecessors, (2102), 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) [2024-11-08 18:50:44,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 2102 transitions. [2024-11-08 18:50:44,758 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 2102 transitions. Word has length 243 [2024-11-08 18:50:44,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:50:44,759 INFO L471 AbstractCegarLoop]: Abstraction has 1984 states and 2102 transitions. [2024-11-08 18:50:44,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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) [2024-11-08 18:50:44,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 2102 transitions. [2024-11-08 18:50:44,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 18:50:44,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:50:44,766 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:50:44,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 18:50:44,766 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:50:44,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:50:44,767 INFO L85 PathProgramCache]: Analyzing trace with hash -825642432, now seen corresponding path program 1 times [2024-11-08 18:50:44,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:50:44,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316018366] [2024-11-08 18:50:44,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:50:44,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:50:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:44,966 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:50:44,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:50:44,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316018366] [2024-11-08 18:50:44,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316018366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:50:44,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:50:44,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:50:44,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143568917] [2024-11-08 18:50:44,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:50:44,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:50:44,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:50:44,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:50:44,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:50:44,970 INFO L87 Difference]: Start difference. First operand 1984 states and 2102 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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) [2024-11-08 18:50:45,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:50:45,399 INFO L93 Difference]: Finished difference Result 3967 states and 4195 transitions. [2024-11-08 18:50:45,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:50:45,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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) Word has length 244 [2024-11-08 18:50:45,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:50:45,404 INFO L225 Difference]: With dead ends: 3967 [2024-11-08 18:50:45,404 INFO L226 Difference]: Without dead ends: 1842 [2024-11-08 18:50:45,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:50:45,406 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 86 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:50:45,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 221 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:50:45,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2024-11-08 18:50:45,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1700. [2024-11-08 18:50:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1699 states have (on average 1.0429664508534433) internal successors, (1772), 1699 states have internal predecessors, (1772), 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) [2024-11-08 18:50:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 1772 transitions. [2024-11-08 18:50:45,436 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 1772 transitions. Word has length 244 [2024-11-08 18:50:45,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:50:45,436 INFO L471 AbstractCegarLoop]: Abstraction has 1700 states and 1772 transitions. [2024-11-08 18:50:45,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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) [2024-11-08 18:50:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 1772 transitions. [2024-11-08 18:50:45,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-11-08 18:50:45,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:50:45,444 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:50:45,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 18:50:45,444 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:50:45,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:50:45,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1318600282, now seen corresponding path program 1 times [2024-11-08 18:50:45,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:50:45,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220637360] [2024-11-08 18:50:45,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:50:45,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:50:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:45,742 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-08 18:50:45,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:50:45,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220637360] [2024-11-08 18:50:45,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220637360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:50:45,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:50:45,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:50:45,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923658098] [2024-11-08 18:50:45,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:50:45,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:50:45,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:50:45,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:50:45,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:50:45,746 INFO L87 Difference]: Start difference. First operand 1700 states and 1772 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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) [2024-11-08 18:50:46,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:50:46,135 INFO L93 Difference]: Finished difference Result 3254 states and 3395 transitions. [2024-11-08 18:50:46,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:50:46,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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) Word has length 338 [2024-11-08 18:50:46,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:50:46,139 INFO L225 Difference]: With dead ends: 3254 [2024-11-08 18:50:46,139 INFO L226 Difference]: Without dead ends: 1416 [2024-11-08 18:50:46,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:50:46,142 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 89 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:50:46,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 183 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:50:46,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2024-11-08 18:50:46,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1416. [2024-11-08 18:50:46,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1415 states have (on average 1.0275618374558304) internal successors, (1454), 1415 states have internal predecessors, (1454), 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) [2024-11-08 18:50:46,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1454 transitions. [2024-11-08 18:50:46,165 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1454 transitions. Word has length 338 [2024-11-08 18:50:46,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:50:46,166 INFO L471 AbstractCegarLoop]: Abstraction has 1416 states and 1454 transitions. [2024-11-08 18:50:46,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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) [2024-11-08 18:50:46,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1454 transitions. [2024-11-08 18:50:46,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-11-08 18:50:46,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:50:46,173 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:50:46,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 18:50:46,174 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:50:46,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:50:46,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1965309823, now seen corresponding path program 1 times [2024-11-08 18:50:46,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:50:46,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569598446] [2024-11-08 18:50:46,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:50:46,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:50:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:46,693 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 425 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-08 18:50:46,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:50:46,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569598446] [2024-11-08 18:50:46,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569598446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:50:46,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:50:46,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:50:46,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175267951] [2024-11-08 18:50:46,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:50:46,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:50:46,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:50:46,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:50:46,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:50:46,697 INFO L87 Difference]: Start difference. First operand 1416 states and 1454 transitions. Second operand has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 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) [2024-11-08 18:50:47,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:50:47,055 INFO L93 Difference]: Finished difference Result 2260 states and 2321 transitions. [2024-11-08 18:50:47,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:50:47,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 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) Word has length 345 [2024-11-08 18:50:47,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:50:47,056 INFO L225 Difference]: With dead ends: 2260 [2024-11-08 18:50:47,057 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 18:50:47,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:50:47,060 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 199 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:50:47,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 178 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:50:47,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 18:50:47,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 18:50:47,062 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) [2024-11-08 18:50:47,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 18:50:47,062 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 345 [2024-11-08 18:50:47,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:50:47,062 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 18:50:47,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 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) [2024-11-08 18:50:47,063 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 18:50:47,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 18:50:47,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:50:47,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 18:50:47,070 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:50:47,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 18:50:47,593 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:50:47,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:50:47 BoogieIcfgContainer [2024-11-08 18:50:47,612 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:50:47,612 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:50:47,612 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:50:47,613 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:50:47,613 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:50:30" (3/4) ... [2024-11-08 18:50:47,616 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 18:50:47,641 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 18:50:47,645 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 18:50:47,646 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 18:50:47,647 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 18:50:47,806 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66d0130-b154-4f0e-b95f-f82a01428fea/bin/uautomizer-verify-jihMAELWvX/witness.graphml [2024-11-08 18:50:47,807 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66d0130-b154-4f0e-b95f-f82a01428fea/bin/uautomizer-verify-jihMAELWvX/witness.yml [2024-11-08 18:50:47,807 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:50:47,808 INFO L158 Benchmark]: Toolchain (without parser) took 20357.57ms. Allocated memory was 174.1MB in the beginning and 371.2MB in the end (delta: 197.1MB). Free memory was 135.6MB in the beginning and 136.6MB in the end (delta: -971.8kB). Peak memory consumption was 199.1MB. Max. memory is 16.1GB. [2024-11-08 18:50:47,808 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 121.6MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:50:47,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 906.43ms. Allocated memory is still 174.1MB. Free memory was 135.6MB in the beginning and 106.7MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 18:50:47,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.80ms. Allocated memory is still 174.1MB. Free memory was 106.7MB in the beginning and 101.3MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 18:50:47,809 INFO L158 Benchmark]: Boogie Preprocessor took 175.29ms. Allocated memory is still 174.1MB. Free memory was 101.3MB in the beginning and 140.2MB in the end (delta: -38.9MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-11-08 18:50:47,809 INFO L158 Benchmark]: RCFGBuilder took 1698.27ms. Allocated memory is still 174.1MB. Free memory was 140.2MB in the beginning and 124.5MB in the end (delta: 15.7MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. [2024-11-08 18:50:47,810 INFO L158 Benchmark]: TraceAbstraction took 17267.45ms. Allocated memory was 174.1MB in the beginning and 371.2MB in the end (delta: 197.1MB). Free memory was 123.4MB in the beginning and 149.1MB in the end (delta: -25.7MB). Peak memory consumption was 171.4MB. Max. memory is 16.1GB. [2024-11-08 18:50:47,810 INFO L158 Benchmark]: Witness Printer took 194.70ms. Allocated memory is still 371.2MB. Free memory was 149.1MB in the beginning and 136.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 18:50:47,812 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.30ms. Allocated memory is still 121.6MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 906.43ms. Allocated memory is still 174.1MB. Free memory was 135.6MB in the beginning and 106.7MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.80ms. Allocated memory is still 174.1MB. Free memory was 106.7MB in the beginning and 101.3MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 175.29ms. Allocated memory is still 174.1MB. Free memory was 101.3MB in the beginning and 140.2MB in the end (delta: -38.9MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1698.27ms. Allocated memory is still 174.1MB. Free memory was 140.2MB in the beginning and 124.5MB in the end (delta: 15.7MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17267.45ms. Allocated memory was 174.1MB in the beginning and 371.2MB in the end (delta: 197.1MB). Free memory was 123.4MB in the beginning and 149.1MB in the end (delta: -25.7MB). Peak memory consumption was 171.4MB. Max. memory is 16.1GB. * Witness Printer took 194.70ms. Allocated memory is still 371.2MB. Free memory was 149.1MB in the beginning and 136.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 605]: 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 1 procedures, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2206 SdHoareTripleChecker+Valid, 9.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2206 mSDsluCounter, 2293 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 317 mSDsCounter, 775 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6170 IncrementalHoareTripleChecker+Invalid, 6945 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 775 mSolverCounterUnsat, 1976 mSDtfsCounter, 6170 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4255occurred in iteration=6, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 1146 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 3213 NumberOfCodeBlocks, 3213 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3198 ConstructedInterpolants, 0 QuantifiedInterpolants, 7652 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 1849/1849 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: 616]: Loop Invariant Derived loop invariant: (((((((((((((((((a17 == 8) && (a21 == 1)) && (a11 <= 0)) && (a28 == 9)) && (a25 <= 0)) || ((((a11 == 1) && (a17 <= 7)) && (a21 == 1)) && (a28 == 9))) || (((((a17 == 8) && (7 == a28)) && (a21 == 1)) && (a11 <= 0)) && (a25 <= 0))) || ((((((a17 == 8) && (a25 == 1)) && (a28 == 11)) && (a21 == 1)) && (a19 == 1)) && (a11 != 1))) || (((a17 <= 7) && (a28 == 9)) && (a25 <= 0))) || (((((a17 == 8) && (a28 <= 9)) && (a11 == 1)) && (a21 == 1)) && (a19 == 1))) || ((a28 == 10) && (a19 == 1))) || (((a17 <= 7) && (a28 == 10)) && (a25 <= 0))) || (((((a25 == 1) && (a21 == 1)) && (a11 <= 0)) && (a28 <= 10)) && (a19 == 1))) || (((((a28 <= 9) && (a19 != 1)) && (a21 == 1)) && (a11 <= 0)) && (a25 <= 0))) || ((a17 <= 7) && (a19 == 1))) || ((((a25 == 1) && (a28 == 10)) && (a21 == 1)) && (a11 <= 0))) || (((((a28 <= 9) && (a11 == 1)) && (a19 != 1)) && (a21 == 1)) && (a25 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-08 18:50:47,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66d0130-b154-4f0e-b95f-f82a01428fea/bin/uautomizer-verify-jihMAELWvX/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