./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label44.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24eb162b-75f2-4d59-842b-a120bbdf91af/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24eb162b-75f2-4d59-842b-a120bbdf91af/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24eb162b-75f2-4d59-842b-a120bbdf91af/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24eb162b-75f2-4d59-842b-a120bbdf91af/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label44.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24eb162b-75f2-4d59-842b-a120bbdf91af/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24eb162b-75f2-4d59-842b-a120bbdf91af/bin/uautomizer-verify-aQ6SnzHsRB --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 16a882266f214f7bbe3e2aa4aa7afa01c1567a6c47ab95da663021c70813ff8b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 19:50:24,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 19:50:24,694 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24eb162b-75f2-4d59-842b-a120bbdf91af/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 19:50:24,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 19:50:24,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 19:50:24,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 19:50:24,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 19:50:24,736 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 19:50:24,736 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 19:50:24,737 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 19:50:24,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 19:50:24,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 19:50:24,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 19:50:24,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 19:50:24,737 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 19:50:24,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 19:50:24,739 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 19:50:24,739 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 19:50:24,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 19:50:24,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 19:50:24,740 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 19:50:24,740 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 19:50:24,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 19:50:24,740 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 19:50:24,740 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 19:50:24,740 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 19:50:24,740 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 19:50:24,740 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 19:50:24,740 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 19:50:24,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:50:24,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:50:24,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:50:24,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:24,741 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 19:50:24,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:50:24,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:50:24,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:50:24,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:24,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 19:50:24,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 19:50:24,742 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 19:50:24,742 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 19:50:24,742 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 19:50:24,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 19:50:24,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 19:50:24,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 19:50:24,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 19:50:24,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 19:50:24,742 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_24eb162b-75f2-4d59-842b-a120bbdf91af/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 16a882266f214f7bbe3e2aa4aa7afa01c1567a6c47ab95da663021c70813ff8b [2024-11-27 19:50:25,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 19:50:25,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 19:50:25,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 19:50:25,101 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 19:50:25,101 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 19:50:25,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24eb162b-75f2-4d59-842b-a120bbdf91af/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/eca-rers2012/Problem11_label44.c [2024-11-27 19:50:28,090 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24eb162b-75f2-4d59-842b-a120bbdf91af/bin/uautomizer-verify-aQ6SnzHsRB/data/7b2c6d914/3a856501fd2e453ca268023145d38d43/FLAGad7f69d56 [2024-11-27 19:50:28,463 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 19:50:28,464 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24eb162b-75f2-4d59-842b-a120bbdf91af/sv-benchmarks/c/eca-rers2012/Problem11_label44.c [2024-11-27 19:50:28,492 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24eb162b-75f2-4d59-842b-a120bbdf91af/bin/uautomizer-verify-aQ6SnzHsRB/data/7b2c6d914/3a856501fd2e453ca268023145d38d43/FLAGad7f69d56 [2024-11-27 19:50:28,515 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24eb162b-75f2-4d59-842b-a120bbdf91af/bin/uautomizer-verify-aQ6SnzHsRB/data/7b2c6d914/3a856501fd2e453ca268023145d38d43 [2024-11-27 19:50:28,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 19:50:28,520 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 19:50:28,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 19:50:28,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 19:50:28,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 19:50:28,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:50:28" (1/1) ... [2024-11-27 19:50:28,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35dff9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:28, skipping insertion in model container [2024-11-27 19:50:28,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:50:28" (1/1) ... [2024-11-27 19:50:28,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 19:50:28,838 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_24eb162b-75f2-4d59-842b-a120bbdf91af/sv-benchmarks/c/eca-rers2012/Problem11_label44.c[3841,3854] [2024-11-27 19:50:29,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:50:29,321 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 19:50:29,351 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_24eb162b-75f2-4d59-842b-a120bbdf91af/sv-benchmarks/c/eca-rers2012/Problem11_label44.c[3841,3854] [2024-11-27 19:50:29,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:50:29,535 INFO L204 MainTranslator]: Completed translation [2024-11-27 19:50:29,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:29 WrapperNode [2024-11-27 19:50:29,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 19:50:29,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 19:50:29,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 19:50:29,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 19:50:29,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:29" (1/1) ... [2024-11-27 19:50:29,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:29" (1/1) ... [2024-11-27 19:50:29,736 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2024-11-27 19:50:29,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 19:50:29,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 19:50:29,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 19:50:29,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 19:50:29,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:29" (1/1) ... [2024-11-27 19:50:29,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:29" (1/1) ... [2024-11-27 19:50:29,771 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:29" (1/1) ... [2024-11-27 19:50:29,832 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-27 19:50:29,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:29" (1/1) ... [2024-11-27 19:50:29,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:29" (1/1) ... [2024-11-27 19:50:29,872 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:29" (1/1) ... [2024-11-27 19:50:29,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:29" (1/1) ... [2024-11-27 19:50:29,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:29" (1/1) ... [2024-11-27 19:50:29,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:29" (1/1) ... [2024-11-27 19:50:29,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:29" (1/1) ... [2024-11-27 19:50:29,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 19:50:29,917 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 19:50:29,918 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 19:50:29,918 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 19:50:29,919 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:29" (1/1) ... [2024-11-27 19:50:29,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:29,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24eb162b-75f2-4d59-842b-a120bbdf91af/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:50:29,953 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24eb162b-75f2-4d59-842b-a120bbdf91af/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 19:50:29,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24eb162b-75f2-4d59-842b-a120bbdf91af/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 19:50:29,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 19:50:29,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 19:50:29,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 19:50:29,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 19:50:30,079 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 19:50:30,081 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 19:50:32,349 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-27 19:50:32,349 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 19:50:32,377 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 19:50:32,377 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-27 19:50:32,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:50:32 BoogieIcfgContainer [2024-11-27 19:50:32,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 19:50:32,382 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 19:50:32,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 19:50:32,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 19:50:32,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 07:50:28" (1/3) ... [2024-11-27 19:50:32,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70146891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:50:32, skipping insertion in model container [2024-11-27 19:50:32,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:29" (2/3) ... [2024-11-27 19:50:32,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70146891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:50:32, skipping insertion in model container [2024-11-27 19:50:32,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:50:32" (3/3) ... [2024-11-27 19:50:32,393 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label44.c [2024-11-27 19:50:32,411 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 19:50:32,413 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label44.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 19:50:32,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 19:50:32,528 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;@6f4fe571, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 19:50:32,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 19:50:32,534 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 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-27 19:50:32,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-27 19:50:32,544 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:32,544 INFO L218 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] [2024-11-27 19:50:32,545 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:32,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:32,553 INFO L85 PathProgramCache]: Analyzing trace with hash 678582746, now seen corresponding path program 1 times [2024-11-27 19:50:32,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:32,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787353737] [2024-11-27 19:50:32,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:32,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:33,014 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-27 19:50:33,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:33,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787353737] [2024-11-27 19:50:33,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787353737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:33,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:33,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:50:33,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422634927] [2024-11-27 19:50:33,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:33,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:33,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:33,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:33,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:33,063 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 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 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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-27 19:50:34,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:34,577 INFO L93 Difference]: Finished difference Result 763 states and 1352 transitions. [2024-11-27 19:50:34,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:34,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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 26 [2024-11-27 19:50:34,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:34,590 INFO L225 Difference]: With dead ends: 763 [2024-11-27 19:50:34,590 INFO L226 Difference]: Without dead ends: 416 [2024-11-27 19:50:34,595 INFO L434 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-27 19:50:34,602 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 247 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:34,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 89 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-27 19:50:34,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-27 19:50:34,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 408. [2024-11-27 19:50:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.6142506142506143) internal successors, (657), 407 states have internal predecessors, (657), 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-27 19:50:34,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 657 transitions. [2024-11-27 19:50:34,679 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 657 transitions. Word has length 26 [2024-11-27 19:50:34,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:34,679 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 657 transitions. [2024-11-27 19:50:34,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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-27 19:50:34,679 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 657 transitions. [2024-11-27 19:50:34,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-27 19:50:34,681 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:34,682 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:50:34,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 19:50:34,682 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:34,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1710179134, now seen corresponding path program 1 times [2024-11-27 19:50:34,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:34,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057938896] [2024-11-27 19:50:34,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:34,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:35,001 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:35,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:35,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057938896] [2024-11-27 19:50:35,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057938896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:35,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:35,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:50:35,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449828940] [2024-11-27 19:50:35,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:35,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:35,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:35,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:35,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:35,007 INFO L87 Difference]: Start difference. First operand 408 states and 657 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-27 19:50:36,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:36,149 INFO L93 Difference]: Finished difference Result 1191 states and 1930 transitions. [2024-11-27 19:50:36,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:36,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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 91 [2024-11-27 19:50:36,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:36,154 INFO L225 Difference]: With dead ends: 1191 [2024-11-27 19:50:36,154 INFO L226 Difference]: Without dead ends: 785 [2024-11-27 19:50:36,156 INFO L434 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-27 19:50:36,157 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 141 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:36,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 152 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-27 19:50:36,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-27 19:50:36,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 783. [2024-11-27 19:50:36,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.438618925831202) internal successors, (1125), 782 states have internal predecessors, (1125), 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-27 19:50:36,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1125 transitions. [2024-11-27 19:50:36,200 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1125 transitions. Word has length 91 [2024-11-27 19:50:36,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:36,200 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1125 transitions. [2024-11-27 19:50:36,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-27 19:50:36,201 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1125 transitions. [2024-11-27 19:50:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-27 19:50:36,203 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:36,203 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:50:36,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 19:50:36,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:36,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:36,204 INFO L85 PathProgramCache]: Analyzing trace with hash -308519566, now seen corresponding path program 1 times [2024-11-27 19:50:36,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:36,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271050339] [2024-11-27 19:50:36,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:36,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:36,519 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:36,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:36,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271050339] [2024-11-27 19:50:36,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271050339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:36,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:36,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:50:36,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230836951] [2024-11-27 19:50:36,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:36,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:36,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:36,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:36,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:36,522 INFO L87 Difference]: Start difference. First operand 783 states and 1125 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 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-27 19:50:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:37,671 INFO L93 Difference]: Finished difference Result 1948 states and 2801 transitions. [2024-11-27 19:50:37,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:37,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 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 94 [2024-11-27 19:50:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:37,678 INFO L225 Difference]: With dead ends: 1948 [2024-11-27 19:50:37,679 INFO L226 Difference]: Without dead ends: 1167 [2024-11-27 19:50:37,680 INFO L434 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-27 19:50:37,681 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 144 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:37,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 116 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-27 19:50:37,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2024-11-27 19:50:37,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1154. [2024-11-27 19:50:37,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 1.3391153512575888) internal successors, (1544), 1153 states have internal predecessors, (1544), 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-27 19:50:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1544 transitions. [2024-11-27 19:50:37,714 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1544 transitions. Word has length 94 [2024-11-27 19:50:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:37,714 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1544 transitions. [2024-11-27 19:50:37,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 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-27 19:50:37,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1544 transitions. [2024-11-27 19:50:37,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-27 19:50:37,716 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:37,717 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:50:37,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 19:50:37,717 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:37,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:37,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1570751308, now seen corresponding path program 1 times [2024-11-27 19:50:37,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:37,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296425495] [2024-11-27 19:50:37,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:37,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:38,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:38,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296425495] [2024-11-27 19:50:38,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296425495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:38,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:38,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:50:38,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695097824] [2024-11-27 19:50:38,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:38,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:38,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:38,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:38,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:38,193 INFO L87 Difference]: Start difference. First operand 1154 states and 1544 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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-27 19:50:39,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:39,283 INFO L93 Difference]: Finished difference Result 2676 states and 3529 transitions. [2024-11-27 19:50:39,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:39,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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 95 [2024-11-27 19:50:39,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:39,290 INFO L225 Difference]: With dead ends: 2676 [2024-11-27 19:50:39,290 INFO L226 Difference]: Without dead ends: 1524 [2024-11-27 19:50:39,292 INFO L434 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-27 19:50:39,292 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:39,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 189 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-27 19:50:39,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2024-11-27 19:50:39,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1523. [2024-11-27 19:50:39,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1522 states have (on average 1.268725361366623) internal successors, (1931), 1522 states have internal predecessors, (1931), 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-27 19:50:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1931 transitions. [2024-11-27 19:50:39,332 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1931 transitions. Word has length 95 [2024-11-27 19:50:39,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:39,333 INFO L471 AbstractCegarLoop]: Abstraction has 1523 states and 1931 transitions. [2024-11-27 19:50:39,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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-27 19:50:39,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1931 transitions. [2024-11-27 19:50:39,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-27 19:50:39,338 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:39,339 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:50:39,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 19:50:39,339 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:39,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:39,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1821693585, now seen corresponding path program 1 times [2024-11-27 19:50:39,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:39,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731012378] [2024-11-27 19:50:39,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:39,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:39,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:39,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731012378] [2024-11-27 19:50:39,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731012378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:39,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:39,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:50:39,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672795005] [2024-11-27 19:50:39,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:39,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:39,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:39,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:39,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:39,571 INFO L87 Difference]: Start difference. First operand 1523 states and 1931 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 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-27 19:50:40,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:40,555 INFO L93 Difference]: Finished difference Result 3968 states and 5151 transitions. [2024-11-27 19:50:40,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:40,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 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 153 [2024-11-27 19:50:40,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:40,563 INFO L225 Difference]: With dead ends: 3968 [2024-11-27 19:50:40,564 INFO L226 Difference]: Without dead ends: 2631 [2024-11-27 19:50:40,565 INFO L434 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-27 19:50:40,566 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:40,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 154 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-27 19:50:40,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2024-11-27 19:50:40,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2447. [2024-11-27 19:50:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 2446 states have (on average 1.2236304170073589) internal successors, (2993), 2446 states have internal predecessors, (2993), 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-27 19:50:40,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 2993 transitions. [2024-11-27 19:50:40,621 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 2993 transitions. Word has length 153 [2024-11-27 19:50:40,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:40,622 INFO L471 AbstractCegarLoop]: Abstraction has 2447 states and 2993 transitions. [2024-11-27 19:50:40,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 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-27 19:50:40,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 2993 transitions. [2024-11-27 19:50:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-27 19:50:40,624 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:40,624 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:50:40,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 19:50:40,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:40,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:40,625 INFO L85 PathProgramCache]: Analyzing trace with hash -935191055, now seen corresponding path program 1 times [2024-11-27 19:50:40,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:40,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408582758] [2024-11-27 19:50:40,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:40,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-27 19:50:40,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:40,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408582758] [2024-11-27 19:50:40,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408582758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:40,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:40,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:50:40,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820427432] [2024-11-27 19:50:40,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:40,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:40,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:40,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:40,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:40,896 INFO L87 Difference]: Start difference. First operand 2447 states and 2993 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 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-27 19:50:41,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:41,877 INFO L93 Difference]: Finished difference Result 5266 states and 6463 transitions. [2024-11-27 19:50:41,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:41,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 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-27 19:50:41,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:41,889 INFO L225 Difference]: With dead ends: 5266 [2024-11-27 19:50:41,890 INFO L226 Difference]: Without dead ends: 3005 [2024-11-27 19:50:41,896 INFO L434 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-27 19:50:41,896 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 75 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:41,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 153 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-27 19:50:41,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2024-11-27 19:50:41,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 2820. [2024-11-27 19:50:41,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2820 states, 2819 states have (on average 1.2220645619013835) internal successors, (3445), 2819 states have internal predecessors, (3445), 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-27 19:50:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 3445 transitions. [2024-11-27 19:50:41,960 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 3445 transitions. Word has length 169 [2024-11-27 19:50:41,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:41,961 INFO L471 AbstractCegarLoop]: Abstraction has 2820 states and 3445 transitions. [2024-11-27 19:50:41,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 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-27 19:50:41,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 3445 transitions. [2024-11-27 19:50:41,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-27 19:50:41,964 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:41,964 INFO L218 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, 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] [2024-11-27 19:50:41,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 19:50:41,965 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:41,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:41,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1559395122, now seen corresponding path program 1 times [2024-11-27 19:50:41,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:41,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419574551] [2024-11-27 19:50:41,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:41,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:42,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:42,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419574551] [2024-11-27 19:50:42,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419574551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:42,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:42,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:50:42,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111106083] [2024-11-27 19:50:42,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:42,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:42,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:42,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:42,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:42,291 INFO L87 Difference]: Start difference. First operand 2820 states and 3445 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-27 19:50:43,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:43,507 INFO L93 Difference]: Finished difference Result 6567 states and 8101 transitions. [2024-11-27 19:50:43,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:43,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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 206 [2024-11-27 19:50:43,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:43,523 INFO L225 Difference]: With dead ends: 6567 [2024-11-27 19:50:43,524 INFO L226 Difference]: Without dead ends: 3933 [2024-11-27 19:50:43,526 INFO L434 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-27 19:50:43,528 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 135 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:43,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 332 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-27 19:50:43,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3933 states. [2024-11-27 19:50:43,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3933 to 3556. [2024-11-27 19:50:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3556 states, 3555 states have (on average 1.2115330520393812) internal successors, (4307), 3555 states have internal predecessors, (4307), 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-27 19:50:43,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3556 states to 3556 states and 4307 transitions. [2024-11-27 19:50:43,649 INFO L78 Accepts]: Start accepts. Automaton has 3556 states and 4307 transitions. Word has length 206 [2024-11-27 19:50:43,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:43,649 INFO L471 AbstractCegarLoop]: Abstraction has 3556 states and 4307 transitions. [2024-11-27 19:50:43,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-27 19:50:43,650 INFO L276 IsEmpty]: Start isEmpty. Operand 3556 states and 4307 transitions. [2024-11-27 19:50:43,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-27 19:50:43,655 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:43,656 INFO L218 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, 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] [2024-11-27 19:50:43,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 19:50:43,656 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:43,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:43,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1693187880, now seen corresponding path program 1 times [2024-11-27 19:50:43,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:43,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917172492] [2024-11-27 19:50:43,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:43,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-27 19:50:44,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:44,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917172492] [2024-11-27 19:50:44,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917172492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:44,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:44,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:50:44,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209956188] [2024-11-27 19:50:44,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:44,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:44,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:44,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:44,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:44,054 INFO L87 Difference]: Start difference. First operand 3556 states and 4307 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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-27 19:50:45,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:45,269 INFO L93 Difference]: Finished difference Result 9521 states and 11627 transitions. [2024-11-27 19:50:45,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:45,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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 207 [2024-11-27 19:50:45,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:45,289 INFO L225 Difference]: With dead ends: 9521 [2024-11-27 19:50:45,289 INFO L226 Difference]: Without dead ends: 5967 [2024-11-27 19:50:45,293 INFO L434 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-27 19:50:45,294 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 200 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:45,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 332 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-27 19:50:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5967 states. [2024-11-27 19:50:45,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5967 to 5231. [2024-11-27 19:50:45,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5231 states, 5230 states have (on average 1.2061185468451243) internal successors, (6308), 5230 states have internal predecessors, (6308), 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-27 19:50:45,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5231 states to 5231 states and 6308 transitions. [2024-11-27 19:50:45,466 INFO L78 Accepts]: Start accepts. Automaton has 5231 states and 6308 transitions. Word has length 207 [2024-11-27 19:50:45,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:45,467 INFO L471 AbstractCegarLoop]: Abstraction has 5231 states and 6308 transitions. [2024-11-27 19:50:45,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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-27 19:50:45,468 INFO L276 IsEmpty]: Start isEmpty. Operand 5231 states and 6308 transitions. [2024-11-27 19:50:45,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-27 19:50:45,472 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:45,472 INFO L218 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, 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, 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] [2024-11-27 19:50:45,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 19:50:45,473 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:45,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:45,474 INFO L85 PathProgramCache]: Analyzing trace with hash 192944744, now seen corresponding path program 1 times [2024-11-27 19:50:45,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:45,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955029439] [2024-11-27 19:50:45,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:45,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:45,763 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:45,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:45,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955029439] [2024-11-27 19:50:45,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955029439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:45,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:45,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:50:45,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025999607] [2024-11-27 19:50:45,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:45,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:45,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:45,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:45,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:45,788 INFO L87 Difference]: Start difference. First operand 5231 states and 6308 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-27 19:50:46,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:46,896 INFO L93 Difference]: Finished difference Result 10457 states and 12611 transitions. [2024-11-27 19:50:46,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:46,897 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-27 19:50:46,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:46,916 INFO L225 Difference]: With dead ends: 10457 [2024-11-27 19:50:46,917 INFO L226 Difference]: Without dead ends: 5228 [2024-11-27 19:50:46,922 INFO L434 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-27 19:50:46,925 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 142 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:46,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 304 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-27 19:50:46,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5228 states. [2024-11-27 19:50:47,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5228 to 5228. [2024-11-27 19:50:47,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5228 states, 5227 states have (on average 1.178687583700019) internal successors, (6161), 5227 states have internal predecessors, (6161), 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-27 19:50:47,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5228 states to 5228 states and 6161 transitions. [2024-11-27 19:50:47,057 INFO L78 Accepts]: Start accepts. Automaton has 5228 states and 6161 transitions. Word has length 244 [2024-11-27 19:50:47,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:47,058 INFO L471 AbstractCegarLoop]: Abstraction has 5228 states and 6161 transitions. [2024-11-27 19:50:47,058 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-27 19:50:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 5228 states and 6161 transitions. [2024-11-27 19:50:47,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-27 19:50:47,064 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:47,065 INFO L218 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, 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, 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] [2024-11-27 19:50:47,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 19:50:47,066 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:47,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:47,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1616620059, now seen corresponding path program 1 times [2024-11-27 19:50:47,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:47,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388665814] [2024-11-27 19:50:47,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:47,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:47,560 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-27 19:50:47,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:47,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388665814] [2024-11-27 19:50:47,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388665814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:47,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:47,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:50:47,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092539383] [2024-11-27 19:50:47,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:47,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:47,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:47,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:47,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:47,563 INFO L87 Difference]: Start difference. First operand 5228 states and 6161 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-27 19:50:48,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:48,558 INFO L93 Difference]: Finished difference Result 11195 states and 13196 transitions. [2024-11-27 19:50:48,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:48,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 258 [2024-11-27 19:50:48,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:48,588 INFO L225 Difference]: With dead ends: 11195 [2024-11-27 19:50:48,592 INFO L226 Difference]: Without dead ends: 5969 [2024-11-27 19:50:48,597 INFO L434 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-27 19:50:48,599 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 196 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:48,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 148 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-27 19:50:48,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2024-11-27 19:50:48,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 5228. [2024-11-27 19:50:48,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5228 states, 5227 states have (on average 1.178687583700019) internal successors, (6161), 5227 states have internal predecessors, (6161), 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-27 19:50:48,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5228 states to 5228 states and 6161 transitions. [2024-11-27 19:50:48,725 INFO L78 Accepts]: Start accepts. Automaton has 5228 states and 6161 transitions. Word has length 258 [2024-11-27 19:50:48,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:48,726 INFO L471 AbstractCegarLoop]: Abstraction has 5228 states and 6161 transitions. [2024-11-27 19:50:48,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-27 19:50:48,727 INFO L276 IsEmpty]: Start isEmpty. Operand 5228 states and 6161 transitions. [2024-11-27 19:50:48,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-27 19:50:48,732 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:48,732 INFO L218 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, 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, 1, 1, 1, 1, 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-27 19:50:48,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 19:50:48,733 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:48,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:48,734 INFO L85 PathProgramCache]: Analyzing trace with hash 292208959, now seen corresponding path program 1 times [2024-11-27 19:50:48,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:48,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859612558] [2024-11-27 19:50:48,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:48,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-27 19:50:49,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:49,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859612558] [2024-11-27 19:50:49,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859612558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:49,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:49,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:50:49,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792497756] [2024-11-27 19:50:49,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:49,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:50:49,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:49,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:50:49,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:50:49,254 INFO L87 Difference]: Start difference. First operand 5228 states and 6161 transitions. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 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-27 19:50:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:51,450 INFO L93 Difference]: Finished difference Result 15807 states and 18813 transitions. [2024-11-27 19:50:51,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:50:51,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 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 261 [2024-11-27 19:50:51,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:51,471 INFO L225 Difference]: With dead ends: 15807 [2024-11-27 19:50:51,471 INFO L226 Difference]: Without dead ends: 10581 [2024-11-27 19:50:51,477 INFO L434 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-27 19:50:51,479 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:51,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 116 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-27 19:50:51,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10581 states. [2024-11-27 19:50:51,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10581 to 10019. [2024-11-27 19:50:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10019 states, 10018 states have (on average 1.1802755040926332) internal successors, (11824), 10018 states have internal predecessors, (11824), 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-27 19:50:51,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10019 states to 10019 states and 11824 transitions. [2024-11-27 19:50:51,685 INFO L78 Accepts]: Start accepts. Automaton has 10019 states and 11824 transitions. Word has length 261 [2024-11-27 19:50:51,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:51,686 INFO L471 AbstractCegarLoop]: Abstraction has 10019 states and 11824 transitions. [2024-11-27 19:50:51,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 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-27 19:50:51,687 INFO L276 IsEmpty]: Start isEmpty. Operand 10019 states and 11824 transitions. [2024-11-27 19:50:51,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-11-27 19:50:51,696 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:51,696 INFO L218 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, 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, 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] [2024-11-27 19:50:51,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 19:50:51,697 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:51,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:51,700 INFO L85 PathProgramCache]: Analyzing trace with hash -271673639, now seen corresponding path program 1 times [2024-11-27 19:50:51,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:51,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222852355] [2024-11-27 19:50:51,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:51,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:52,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:52,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222852355] [2024-11-27 19:50:52,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222852355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:52,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:52,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:50:52,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008324425] [2024-11-27 19:50:52,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:52,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:50:52,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:52,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:50:52,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:50:52,182 INFO L87 Difference]: Start difference. First operand 10019 states and 11824 transitions. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 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-27 19:50:53,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:53,961 INFO L93 Difference]: Finished difference Result 25580 states and 30141 transitions. [2024-11-27 19:50:53,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:50:53,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 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 270 [2024-11-27 19:50:53,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:54,001 INFO L225 Difference]: With dead ends: 25580 [2024-11-27 19:50:54,001 INFO L226 Difference]: Without dead ends: 15931 [2024-11-27 19:50:54,010 INFO L434 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-27 19:50:54,011 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 258 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:54,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 77 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-27 19:50:54,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15931 states. [2024-11-27 19:50:54,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15931 to 15745. [2024-11-27 19:50:54,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15745 states, 15744 states have (on average 1.1689532520325203) internal successors, (18404), 15744 states have internal predecessors, (18404), 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-27 19:50:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15745 states to 15745 states and 18404 transitions. [2024-11-27 19:50:54,306 INFO L78 Accepts]: Start accepts. Automaton has 15745 states and 18404 transitions. Word has length 270 [2024-11-27 19:50:54,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:54,307 INFO L471 AbstractCegarLoop]: Abstraction has 15745 states and 18404 transitions. [2024-11-27 19:50:54,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 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-27 19:50:54,308 INFO L276 IsEmpty]: Start isEmpty. Operand 15745 states and 18404 transitions. [2024-11-27 19:50:54,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-11-27 19:50:54,315 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:54,316 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:50:54,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 19:50:54,316 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:54,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:54,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2010794811, now seen corresponding path program 1 times [2024-11-27 19:50:54,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:54,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743327836] [2024-11-27 19:50:54,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:54,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:54,557 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2024-11-27 19:50:54,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:54,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743327836] [2024-11-27 19:50:54,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743327836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:54,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:54,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:50:54,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289492914] [2024-11-27 19:50:54,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:54,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:54,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:54,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:54,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:54,559 INFO L87 Difference]: Start difference. First operand 15745 states and 18404 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 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-27 19:50:55,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:55,449 INFO L93 Difference]: Finished difference Result 32403 states and 37950 transitions. [2024-11-27 19:50:55,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:55,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 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 281 [2024-11-27 19:50:55,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:55,491 INFO L225 Difference]: With dead ends: 32403 [2024-11-27 19:50:55,491 INFO L226 Difference]: Without dead ends: 18136 [2024-11-27 19:50:55,504 INFO L434 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-27 19:50:55,504 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 193 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:55,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 151 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-27 19:50:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18136 states. [2024-11-27 19:50:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18136 to 13160. [2024-11-27 19:50:55,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13160 states, 13159 states have (on average 1.172201535071054) internal successors, (15425), 13159 states have internal predecessors, (15425), 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-27 19:50:55,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13160 states to 13160 states and 15425 transitions. [2024-11-27 19:50:55,838 INFO L78 Accepts]: Start accepts. Automaton has 13160 states and 15425 transitions. Word has length 281 [2024-11-27 19:50:55,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:55,839 INFO L471 AbstractCegarLoop]: Abstraction has 13160 states and 15425 transitions. [2024-11-27 19:50:55,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 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-27 19:50:55,840 INFO L276 IsEmpty]: Start isEmpty. Operand 13160 states and 15425 transitions. [2024-11-27 19:50:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-11-27 19:50:55,847 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:55,847 INFO L218 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, 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, 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] [2024-11-27 19:50:55,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 19:50:55,848 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:55,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:55,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1064230659, now seen corresponding path program 1 times [2024-11-27 19:50:55,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:55,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274091751] [2024-11-27 19:50:55,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:55,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:56,047 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-27 19:50:56,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:56,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274091751] [2024-11-27 19:50:56,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274091751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:56,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:56,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:50:56,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901501108] [2024-11-27 19:50:56,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:56,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:56,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:56,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:56,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:56,050 INFO L87 Difference]: Start difference. First operand 13160 states and 15425 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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-27 19:50:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:57,121 INFO L93 Difference]: Finished difference Result 28713 states and 33938 transitions. [2024-11-27 19:50:57,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:57,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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 301 [2024-11-27 19:50:57,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:57,155 INFO L225 Difference]: With dead ends: 28713 [2024-11-27 19:50:57,155 INFO L226 Difference]: Without dead ends: 15923 [2024-11-27 19:50:57,165 INFO L434 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-27 19:50:57,165 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 181 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:57,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 159 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-27 19:50:57,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15923 states. [2024-11-27 19:50:57,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15923 to 13145. [2024-11-27 19:50:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13145 states, 13144 states have (on average 1.1517802799756542) internal successors, (15139), 13144 states have internal predecessors, (15139), 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-27 19:50:57,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13145 states to 13145 states and 15139 transitions. [2024-11-27 19:50:57,341 INFO L78 Accepts]: Start accepts. Automaton has 13145 states and 15139 transitions. Word has length 301 [2024-11-27 19:50:57,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:57,342 INFO L471 AbstractCegarLoop]: Abstraction has 13145 states and 15139 transitions. [2024-11-27 19:50:57,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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-27 19:50:57,342 INFO L276 IsEmpty]: Start isEmpty. Operand 13145 states and 15139 transitions. [2024-11-27 19:50:57,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-11-27 19:50:57,350 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:57,350 INFO L218 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, 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, 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] [2024-11-27 19:50:57,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 19:50:57,351 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:57,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:57,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1313485887, now seen corresponding path program 1 times [2024-11-27 19:50:57,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:57,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767402142] [2024-11-27 19:50:57,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:57,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-27 19:50:57,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:57,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767402142] [2024-11-27 19:50:57,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767402142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:57,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:57,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:50:57,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830012432] [2024-11-27 19:50:57,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:57,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:57,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:57,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:57,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:57,656 INFO L87 Difference]: Start difference. First operand 13145 states and 15139 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 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-27 19:50:58,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:58,316 INFO L93 Difference]: Finished difference Result 25172 states and 28967 transitions. [2024-11-27 19:50:58,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:58,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 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 308 [2024-11-27 19:50:58,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:58,341 INFO L225 Difference]: With dead ends: 25172 [2024-11-27 19:50:58,341 INFO L226 Difference]: Without dead ends: 12397 [2024-11-27 19:50:58,351 INFO L434 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-27 19:50:58,351 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 186 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:58,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 37 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 19:50:58,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12397 states. [2024-11-27 19:50:58,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12397 to 12395. [2024-11-27 19:50:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12395 states, 12394 states have (on average 1.1461190898822011) internal successors, (14205), 12394 states have internal predecessors, (14205), 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-27 19:50:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12395 states to 12395 states and 14205 transitions. [2024-11-27 19:50:58,575 INFO L78 Accepts]: Start accepts. Automaton has 12395 states and 14205 transitions. Word has length 308 [2024-11-27 19:50:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:58,576 INFO L471 AbstractCegarLoop]: Abstraction has 12395 states and 14205 transitions. [2024-11-27 19:50:58,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 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-27 19:50:58,576 INFO L276 IsEmpty]: Start isEmpty. Operand 12395 states and 14205 transitions. [2024-11-27 19:50:58,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-27 19:50:58,583 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:58,583 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2024-11-27 19:50:58,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 19:50:58,584 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:58,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:58,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1486952426, now seen corresponding path program 1 times [2024-11-27 19:50:58,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:58,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236434474] [2024-11-27 19:50:58,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:58,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-27 19:50:58,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:58,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236434474] [2024-11-27 19:50:58,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236434474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:58,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:58,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:50:58,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517924466] [2024-11-27 19:50:58,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:58,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:58,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:58,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:58,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:58,951 INFO L87 Difference]: Start difference. First operand 12395 states and 14205 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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-27 19:50:59,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:59,967 INFO L93 Difference]: Finished difference Result 27738 states and 31821 transitions. [2024-11-27 19:50:59,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:59,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 330 [2024-11-27 19:50:59,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:59,985 INFO L225 Difference]: With dead ends: 27738 [2024-11-27 19:50:59,985 INFO L226 Difference]: Without dead ends: 15713 [2024-11-27 19:50:59,993 INFO L434 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-27 19:50:59,994 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 179 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:59,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 357 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-27 19:51:00,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15713 states. [2024-11-27 19:51:00,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15713 to 13687. [2024-11-27 19:51:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13687 states, 13686 states have (on average 1.1304983194505334) internal successors, (15472), 13686 states have internal predecessors, (15472), 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-27 19:51:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13687 states to 13687 states and 15472 transitions. [2024-11-27 19:51:00,185 INFO L78 Accepts]: Start accepts. Automaton has 13687 states and 15472 transitions. Word has length 330 [2024-11-27 19:51:00,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:00,186 INFO L471 AbstractCegarLoop]: Abstraction has 13687 states and 15472 transitions. [2024-11-27 19:51:00,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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-27 19:51:00,186 INFO L276 IsEmpty]: Start isEmpty. Operand 13687 states and 15472 transitions. [2024-11-27 19:51:00,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-27 19:51:00,193 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:00,193 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:00,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-27 19:51:00,193 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:00,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:00,194 INFO L85 PathProgramCache]: Analyzing trace with hash -842788195, now seen corresponding path program 1 times [2024-11-27 19:51:00,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:00,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126001314] [2024-11-27 19:51:00,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:00,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-27 19:51:00,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:00,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126001314] [2024-11-27 19:51:00,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126001314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:00,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:00,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:51:00,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419390475] [2024-11-27 19:51:00,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:00,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:51:00,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:00,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:51:00,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:51:00,451 INFO L87 Difference]: Start difference. First operand 13687 states and 15472 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-27 19:51:01,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:01,325 INFO L93 Difference]: Finished difference Result 27922 states and 31577 transitions. [2024-11-27 19:51:01,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:51:01,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 337 [2024-11-27 19:51:01,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:01,326 INFO L225 Difference]: With dead ends: 27922 [2024-11-27 19:51:01,326 INFO L226 Difference]: Without dead ends: 0 [2024-11-27 19:51:01,337 INFO L434 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-27 19:51:01,338 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 188 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:01,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 305 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-27 19:51:01,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-27 19:51:01,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-27 19:51:01,339 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-27 19:51:01,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-27 19:51:01,339 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 337 [2024-11-27 19:51:01,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:01,340 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-27 19:51:01,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-27 19:51:01,340 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-27 19:51:01,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-27 19:51:01,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 19:51:01,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-27 19:51:01,347 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:01,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-27 19:51:04,665 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 19:51:04,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 07:51:04 BoogieIcfgContainer [2024-11-27 19:51:04,689 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 19:51:04,690 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 19:51:04,690 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 19:51:04,690 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 19:51:04,691 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:50:32" (3/4) ... [2024-11-27 19:51:04,698 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-27 19:51:04,735 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-27 19:51:04,736 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-27 19:51:04,738 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-27 19:51:04,739 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-27 19:51:04,985 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24eb162b-75f2-4d59-842b-a120bbdf91af/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-27 19:51:04,986 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24eb162b-75f2-4d59-842b-a120bbdf91af/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-27 19:51:04,986 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 19:51:04,987 INFO L158 Benchmark]: Toolchain (without parser) took 36467.06ms. Allocated memory was 117.4MB in the beginning and 562.0MB in the end (delta: 444.6MB). Free memory was 90.1MB in the beginning and 147.3MB in the end (delta: -57.2MB). Peak memory consumption was 385.9MB. Max. memory is 16.1GB. [2024-11-27 19:51:04,988 INFO L158 Benchmark]: CDTParser took 1.28ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 19:51:04,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1015.18ms. Allocated memory is still 117.4MB. Free memory was 89.9MB in the beginning and 46.7MB in the end (delta: 43.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-27 19:51:04,989 INFO L158 Benchmark]: Boogie Procedure Inliner took 199.08ms. Allocated memory is still 117.4MB. Free memory was 46.7MB in the beginning and 79.2MB in the end (delta: -32.6MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2024-11-27 19:51:04,990 INFO L158 Benchmark]: Boogie Preprocessor took 178.72ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 54.7MB in the end (delta: 24.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 19:51:04,991 INFO L158 Benchmark]: RCFGBuilder took 2460.06ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 54.7MB in the beginning and 103.2MB in the end (delta: -48.5MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2024-11-27 19:51:04,991 INFO L158 Benchmark]: TraceAbstraction took 32306.43ms. Allocated memory was 159.4MB in the beginning and 562.0MB in the end (delta: 402.7MB). Free memory was 102.4MB in the beginning and 164.0MB in the end (delta: -61.6MB). Peak memory consumption was 417.7MB. Max. memory is 16.1GB. [2024-11-27 19:51:04,992 INFO L158 Benchmark]: Witness Printer took 296.29ms. Allocated memory is still 562.0MB. Free memory was 164.0MB in the beginning and 147.3MB in the end (delta: 16.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 19:51:04,994 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.28ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1015.18ms. Allocated memory is still 117.4MB. Free memory was 89.9MB in the beginning and 46.7MB in the end (delta: 43.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 199.08ms. Allocated memory is still 117.4MB. Free memory was 46.7MB in the beginning and 79.2MB in the end (delta: -32.6MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 178.72ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 54.7MB in the end (delta: 24.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 2460.06ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 54.7MB in the beginning and 103.2MB in the end (delta: -48.5MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. * TraceAbstraction took 32306.43ms. Allocated memory was 159.4MB in the beginning and 562.0MB in the end (delta: 402.7MB). Free memory was 102.4MB in the beginning and 164.0MB in the end (delta: -61.6MB). Peak memory consumption was 417.7MB. Max. memory is 16.1GB. * Witness Printer took 296.29ms. Allocated memory is still 562.0MB. Free memory was 164.0MB in the beginning and 147.3MB in the end (delta: 16.7MB). Peak memory consumption was 8.4MB. 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: 94]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.9s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 20.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2937 SdHoareTripleChecker+Valid, 18.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2937 mSDsluCounter, 3171 SdHoareTripleChecker+Invalid, 15.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 379 mSDsCounter, 1677 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10066 IncrementalHoareTripleChecker+Invalid, 11743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1677 mSolverCounterUnsat, 2792 mSDtfsCounter, 10066 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15745occurred in iteration=12, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 12777 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 3631 NumberOfCodeBlocks, 3631 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3614 ConstructedInterpolants, 0 QuantifiedInterpolants, 7340 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 2190/2190 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: (((((((((((((a4 == 1) && (a8 == 15)) && (247 <= a29)) || (((10 <= a25) && (a4 == 1)) && (a8 == 15))) || ((((a4 == 0) && (a8 == 15)) && (a25 == 10)) && (a29 <= 130))) || (((((10 <= a25) && (a4 == 0)) && (a23 <= 138)) && (a8 == 15)) && (247 <= a29))) || ((((a29 <= 140) && (a4 == 0)) && (a23 <= 138)) && (a8 == 15))) || (((a25 == 12) && (a4 == 0)) && (a8 == 15))) || (((a23 <= 138) && (a4 == 1)) && (a8 == 15))) || (((a29 <= 140) && (a4 == 1)) && (a8 == 15))) || ((((262 <= a29) && (a4 == 0)) && (a8 == 15)) && (a23 <= 137))) || (((307 <= a23) && (a4 == 1)) && (a8 == 15))) || ((((10 <= a25) && (a4 == 0)) && (a8 == 15)) && (a23 <= 137))) RESULT: Ultimate proved your program to be correct! [2024-11-27 19:51:05,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24eb162b-75f2-4d59-842b-a120bbdf91af/bin/uautomizer-verify-aQ6SnzHsRB/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