./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label20.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 c33ca3c6d8158368e2a1c112df44a3cf58b94be2237d2503e259747e7fb3b47e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:32:06,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:32:06,127 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:32:06,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:32:06,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:32:06,174 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:32:06,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:32:06,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:32:06,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:32:06,176 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:32:06,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:32:06,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:32:06,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:32:06,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:32:06,178 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:32:06,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:32:06,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:32:06,179 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:32:06,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:32:06,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:32:06,179 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:32:06,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:32:06,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:32:06,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:32:06,181 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:32:06,181 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:32:06,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:32:06,182 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:32:06,182 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:32:06,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:32:06,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:32:06,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:32:06,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:32:06,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:32:06,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:32:06,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:32:06,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:32:06,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:32:06,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:32:06,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:32:06,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:32:06,201 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:32:06,201 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> c33ca3c6d8158368e2a1c112df44a3cf58b94be2237d2503e259747e7fb3b47e [2024-11-09 19:32:06,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:32:06,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:32:06,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:32:06,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:32:06,464 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:32:06,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label20.c [2024-11-09 19:32:07,863 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:32:08,355 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:32:08,357 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label20.c [2024-11-09 19:32:08,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d3bb64be/25b15d6cff2448db961cfa56ca8f3718/FLAG0e4c6341f [2024-11-09 19:32:08,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d3bb64be/25b15d6cff2448db961cfa56ca8f3718 [2024-11-09 19:32:08,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:32:08,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:32:08,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:32:08,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:32:08,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:32:08,419 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:32:08" (1/1) ... [2024-11-09 19:32:08,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@211adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:08, skipping insertion in model container [2024-11-09 19:32:08,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:32:08" (1/1) ... [2024-11-09 19:32:08,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:32:08,857 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label20.c[7839,7852] [2024-11-09 19:32:09,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:32:09,771 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:32:09,816 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label20.c[7839,7852] [2024-11-09 19:32:10,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:32:10,336 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:32:10,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:10 WrapperNode [2024-11-09 19:32:10,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:32:10,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:32:10,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:32:10,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:32:10,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:10" (1/1) ... [2024-11-09 19:32:10,441 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:10" (1/1) ... [2024-11-09 19:32:10,960 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5586 [2024-11-09 19:32:10,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:32:10,961 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:32:10,961 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:32:10,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:32:10,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:10" (1/1) ... [2024-11-09 19:32:10,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:10" (1/1) ... [2024-11-09 19:32:11,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:10" (1/1) ... [2024-11-09 19:32:11,382 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-09 19:32:11,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:10" (1/1) ... [2024-11-09 19:32:11,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:10" (1/1) ... [2024-11-09 19:32:11,632 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:10" (1/1) ... [2024-11-09 19:32:11,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:10" (1/1) ... [2024-11-09 19:32:11,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:10" (1/1) ... [2024-11-09 19:32:11,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:10" (1/1) ... [2024-11-09 19:32:11,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:32:11,761 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:32:11,761 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:32:11,762 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:32:11,762 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:10" (1/1) ... [2024-11-09 19:32:11,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:32:11,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:32:11,796 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 19:32:11,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 19:32:11,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:32:11,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:32:11,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:32:11,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:32:11,924 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:32:11,926 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:32:18,284 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2024-11-09 19:32:18,285 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2024-11-09 19:32:18,285 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2024-11-09 19:32:18,719 INFO L? ?]: Removed 2111 outVars from TransFormulas that were not future-live. [2024-11-09 19:32:18,719 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:32:18,764 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:32:18,765 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:32:18,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:32:18 BoogieIcfgContainer [2024-11-09 19:32:18,766 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:32:18,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:32:18,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:32:18,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:32:18,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:32:08" (1/3) ... [2024-11-09 19:32:18,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12565157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:32:18, skipping insertion in model container [2024-11-09 19:32:18,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:10" (2/3) ... [2024-11-09 19:32:18,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12565157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:32:18, skipping insertion in model container [2024-11-09 19:32:18,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:32:18" (3/3) ... [2024-11-09 19:32:18,777 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label20.c [2024-11-09 19:32:18,793 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:32:18,795 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:32:18,902 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:32:18,909 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;@9169e43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:32:18,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:32:18,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 1101 states, 1099 states have (on average 2.4767970882620562) internal successors, (2722), 1100 states have internal predecessors, (2722), 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-09 19:32:18,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 19:32:18,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:32:18,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:32:18,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:32:18,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:32:18,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1228413776, now seen corresponding path program 1 times [2024-11-09 19:32:18,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:32:18,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318094431] [2024-11-09 19:32:18,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:32:18,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:32:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:32:19,332 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-09 19:32:19,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:32:19,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318094431] [2024-11-09 19:32:19,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318094431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:32:19,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:32:19,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:32:19,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249903579] [2024-11-09 19:32:19,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:32:19,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:32:19,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:32:19,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:32:19,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:32:19,368 INFO L87 Difference]: Start difference. First operand has 1101 states, 1099 states have (on average 2.4767970882620562) internal successors, (2722), 1100 states have internal predecessors, (2722), 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 19.0) internal successors, (57), 2 states have internal predecessors, (57), 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-09 19:32:24,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:32:24,764 INFO L93 Difference]: Finished difference Result 3088 states and 7843 transitions. [2024-11-09 19:32:24,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:32:24,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 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 57 [2024-11-09 19:32:24,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:32:24,795 INFO L225 Difference]: With dead ends: 3088 [2024-11-09 19:32:24,795 INFO L226 Difference]: Without dead ends: 1902 [2024-11-09 19:32:24,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:32:24,806 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 1700 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 4387 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1700 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 4986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 4387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:32:24,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1700 Valid, 642 Invalid, 4986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 4387 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-09 19:32:24,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2024-11-09 19:32:24,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1897. [2024-11-09 19:32:24,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1896 states have (on average 2.4915611814345993) internal successors, (4724), 1896 states have internal predecessors, (4724), 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-09 19:32:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 4724 transitions. [2024-11-09 19:32:24,944 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 4724 transitions. Word has length 57 [2024-11-09 19:32:24,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:32:24,944 INFO L471 AbstractCegarLoop]: Abstraction has 1897 states and 4724 transitions. [2024-11-09 19:32:24,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 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-09 19:32:24,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 4724 transitions. [2024-11-09 19:32:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 19:32:24,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:32:24,949 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:32:24,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:32:24,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:32:24,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:32:24,951 INFO L85 PathProgramCache]: Analyzing trace with hash 272939355, now seen corresponding path program 1 times [2024-11-09 19:32:24,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:32:24,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944050684] [2024-11-09 19:32:24,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:32:24,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:32:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:32:25,440 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:32:25,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:32:25,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944050684] [2024-11-09 19:32:25,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944050684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:32:25,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:32:25,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:32:25,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39734183] [2024-11-09 19:32:25,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:32:25,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:32:25,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:32:25,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:32:25,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:32:25,446 INFO L87 Difference]: Start difference. First operand 1897 states and 4724 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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-09 19:32:30,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:32:30,487 INFO L93 Difference]: Finished difference Result 5448 states and 13872 transitions. [2024-11-09 19:32:30,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:32:30,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 123 [2024-11-09 19:32:30,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:32:30,504 INFO L225 Difference]: With dead ends: 5448 [2024-11-09 19:32:30,504 INFO L226 Difference]: Without dead ends: 3553 [2024-11-09 19:32:30,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:32:30,509 INFO L432 NwaCegarLoop]: 749 mSDtfsCounter, 1534 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 4560 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 4920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 4560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:32:30,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 887 Invalid, 4920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 4560 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-09 19:32:30,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3553 states. [2024-11-09 19:32:30,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3553 to 3489. [2024-11-09 19:32:30,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3489 states, 3488 states have (on average 2.407110091743119) internal successors, (8396), 3488 states have internal predecessors, (8396), 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-09 19:32:30,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 8396 transitions. [2024-11-09 19:32:30,577 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 8396 transitions. Word has length 123 [2024-11-09 19:32:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:32:30,578 INFO L471 AbstractCegarLoop]: Abstraction has 3489 states and 8396 transitions. [2024-11-09 19:32:30,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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-09 19:32:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 8396 transitions. [2024-11-09 19:32:30,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 19:32:30,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:32:30,581 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:32:30,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:32:30,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:32:30,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:32:30,582 INFO L85 PathProgramCache]: Analyzing trace with hash -19091333, now seen corresponding path program 1 times [2024-11-09 19:32:30,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:32:30,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293931297] [2024-11-09 19:32:30,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:32:30,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:32:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:32:30,711 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:32:30,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:32:30,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293931297] [2024-11-09 19:32:30,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293931297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:32:30,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:32:30,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:32:30,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698023507] [2024-11-09 19:32:30,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:32:30,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:32:30,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:32:30,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:32:30,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:32:30,715 INFO L87 Difference]: Start difference. First operand 3489 states and 8396 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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-09 19:32:34,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:32:34,948 INFO L93 Difference]: Finished difference Result 10164 states and 24770 transitions. [2024-11-09 19:32:34,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:32:34,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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 124 [2024-11-09 19:32:34,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:32:34,976 INFO L225 Difference]: With dead ends: 10164 [2024-11-09 19:32:34,979 INFO L226 Difference]: Without dead ends: 6677 [2024-11-09 19:32:34,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:32:34,987 INFO L432 NwaCegarLoop]: 1054 mSDtfsCounter, 1518 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 3943 mSolverCounterSat, 780 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 4723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 780 IncrementalHoareTripleChecker+Valid, 3943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:32:34,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 1205 Invalid, 4723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [780 Valid, 3943 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 19:32:34,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6677 states. [2024-11-09 19:32:35,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6677 to 6661. [2024-11-09 19:32:35,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 2.2375375375375377) internal successors, (14902), 6660 states have internal predecessors, (14902), 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-09 19:32:35,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 14902 transitions. [2024-11-09 19:32:35,117 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 14902 transitions. Word has length 124 [2024-11-09 19:32:35,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:32:35,120 INFO L471 AbstractCegarLoop]: Abstraction has 6661 states and 14902 transitions. [2024-11-09 19:32:35,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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-09 19:32:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 14902 transitions. [2024-11-09 19:32:35,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 19:32:35,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:32:35,122 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:32:35,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:32:35,123 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:32:35,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:32:35,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1498760267, now seen corresponding path program 1 times [2024-11-09 19:32:35,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:32:35,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503741034] [2024-11-09 19:32:35,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:32:35,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:32:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:32:35,464 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:32:35,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:32:35,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503741034] [2024-11-09 19:32:35,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503741034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:32:35,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:32:35,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:32:35,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574999457] [2024-11-09 19:32:35,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:32:35,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:32:35,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:32:35,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:32:35,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:32:35,470 INFO L87 Difference]: Start difference. First operand 6661 states and 14902 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 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-09 19:32:41,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:32:41,772 INFO L93 Difference]: Finished difference Result 14110 states and 32132 transitions. [2024-11-09 19:32:41,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:32:41,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 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 144 [2024-11-09 19:32:41,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:32:41,795 INFO L225 Difference]: With dead ends: 14110 [2024-11-09 19:32:41,796 INFO L226 Difference]: Without dead ends: 7451 [2024-11-09 19:32:41,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:32:41,803 INFO L432 NwaCegarLoop]: 736 mSDtfsCounter, 4728 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 6300 mSolverCounterSat, 841 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4728 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 7141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 841 IncrementalHoareTripleChecker+Valid, 6300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:32:41,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4728 Valid, 1033 Invalid, 7141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [841 Valid, 6300 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-09 19:32:41,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7451 states. [2024-11-09 19:32:41,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7451 to 7450. [2024-11-09 19:32:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7450 states, 7449 states have (on average 2.2100953148073565) internal successors, (16463), 7449 states have internal predecessors, (16463), 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-09 19:32:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7450 states to 7450 states and 16463 transitions. [2024-11-09 19:32:41,936 INFO L78 Accepts]: Start accepts. Automaton has 7450 states and 16463 transitions. Word has length 144 [2024-11-09 19:32:41,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:32:41,936 INFO L471 AbstractCegarLoop]: Abstraction has 7450 states and 16463 transitions. [2024-11-09 19:32:41,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 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-09 19:32:41,937 INFO L276 IsEmpty]: Start isEmpty. Operand 7450 states and 16463 transitions. [2024-11-09 19:32:41,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-09 19:32:41,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:32:41,938 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:32:41,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:32:41,939 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:32:41,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:32:41,942 INFO L85 PathProgramCache]: Analyzing trace with hash -482598690, now seen corresponding path program 1 times [2024-11-09 19:32:41,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:32:41,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200713822] [2024-11-09 19:32:41,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:32:41,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:32:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:32:42,144 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:32:42,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:32:42,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200713822] [2024-11-09 19:32:42,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200713822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:32:42,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:32:42,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:32:42,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310892383] [2024-11-09 19:32:42,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:32:42,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:32:42,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:32:42,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:32:42,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:32:42,149 INFO L87 Difference]: Start difference. First operand 7450 states and 16463 transitions. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 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-09 19:32:50,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:32:50,363 INFO L93 Difference]: Finished difference Result 25326 states and 57300 transitions. [2024-11-09 19:32:50,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:32:50,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 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 183 [2024-11-09 19:32:50,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:32:50,405 INFO L225 Difference]: With dead ends: 25326 [2024-11-09 19:32:50,405 INFO L226 Difference]: Without dead ends: 18666 [2024-11-09 19:32:50,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:32:50,416 INFO L432 NwaCegarLoop]: 1005 mSDtfsCounter, 3058 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 10087 mSolverCounterSat, 623 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3058 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 10710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 623 IncrementalHoareTripleChecker+Valid, 10087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:32:50,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3058 Valid, 1302 Invalid, 10710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [623 Valid, 10087 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2024-11-09 19:32:50,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18666 states. [2024-11-09 19:32:50,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18666 to 18525. [2024-11-09 19:32:50,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18525 states, 18524 states have (on average 2.187810408119197) internal successors, (40527), 18524 states have internal predecessors, (40527), 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-09 19:32:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18525 states to 18525 states and 40527 transitions. [2024-11-09 19:32:50,738 INFO L78 Accepts]: Start accepts. Automaton has 18525 states and 40527 transitions. Word has length 183 [2024-11-09 19:32:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:32:50,739 INFO L471 AbstractCegarLoop]: Abstraction has 18525 states and 40527 transitions. [2024-11-09 19:32:50,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 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-09 19:32:50,740 INFO L276 IsEmpty]: Start isEmpty. Operand 18525 states and 40527 transitions. [2024-11-09 19:32:50,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-09 19:32:50,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:32:50,744 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:32:50,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:32:50,745 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:32:50,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:32:50,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1618298737, now seen corresponding path program 1 times [2024-11-09 19:32:50,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:32:50,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982868033] [2024-11-09 19:32:50,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:32:50,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:32:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:32:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:32:51,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:32:51,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982868033] [2024-11-09 19:32:51,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982868033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:32:51,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:32:51,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:32:51,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471888110] [2024-11-09 19:32:51,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:32:51,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:32:51,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:32:51,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:32:51,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:32:51,032 INFO L87 Difference]: Start difference. First operand 18525 states and 40527 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-09 19:32:55,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:32:55,336 INFO L93 Difference]: Finished difference Result 44942 states and 100323 transitions. [2024-11-09 19:32:55,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:32:55,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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 222 [2024-11-09 19:32:55,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:32:55,399 INFO L225 Difference]: With dead ends: 44942 [2024-11-09 19:32:55,400 INFO L226 Difference]: Without dead ends: 27207 [2024-11-09 19:32:55,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:32:55,422 INFO L432 NwaCegarLoop]: 797 mSDtfsCounter, 1620 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 3809 mSolverCounterSat, 928 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1620 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 4737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 928 IncrementalHoareTripleChecker+Valid, 3809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:32:55,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1620 Valid, 916 Invalid, 4737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [928 Valid, 3809 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 19:32:55,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27207 states. [2024-11-09 19:32:55,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27207 to 27198. [2024-11-09 19:32:55,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27198 states, 27197 states have (on average 2.172666102878994) internal successors, (59090), 27197 states have internal predecessors, (59090), 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-09 19:32:55,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27198 states to 27198 states and 59090 transitions. [2024-11-09 19:32:55,945 INFO L78 Accepts]: Start accepts. Automaton has 27198 states and 59090 transitions. Word has length 222 [2024-11-09 19:32:55,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:32:55,946 INFO L471 AbstractCegarLoop]: Abstraction has 27198 states and 59090 transitions. [2024-11-09 19:32:55,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-09 19:32:55,946 INFO L276 IsEmpty]: Start isEmpty. Operand 27198 states and 59090 transitions. [2024-11-09 19:32:55,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-09 19:32:55,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:32:55,949 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:32:55,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:32:55,949 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:32:55,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:32:55,950 INFO L85 PathProgramCache]: Analyzing trace with hash -535642467, now seen corresponding path program 1 times [2024-11-09 19:32:55,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:32:55,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295644939] [2024-11-09 19:32:55,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:32:55,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:32:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:32:56,103 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-09 19:32:56,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:32:56,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295644939] [2024-11-09 19:32:56,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295644939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:32:56,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:32:56,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:32:56,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72223035] [2024-11-09 19:32:56,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:32:56,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:32:56,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:32:56,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:32:56,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:32:56,106 INFO L87 Difference]: Start difference. First operand 27198 states and 59090 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 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-09 19:33:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:33:00,605 INFO L93 Difference]: Finished difference Result 74132 states and 162439 transitions. [2024-11-09 19:33:00,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:33:00,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 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 226 [2024-11-09 19:33:00,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:33:00,677 INFO L225 Difference]: With dead ends: 74132 [2024-11-09 19:33:00,677 INFO L226 Difference]: Without dead ends: 47724 [2024-11-09 19:33:00,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:33:00,712 INFO L432 NwaCegarLoop]: 707 mSDtfsCounter, 1663 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 3953 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1663 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 4728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 3953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:33:00,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1663 Valid, 839 Invalid, 4728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 3953 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-09 19:33:00,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47724 states. [2024-11-09 19:33:01,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47724 to 47713. [2024-11-09 19:33:01,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47713 states, 47712 states have (on average 2.1134515425888667) internal successors, (100837), 47712 states have internal predecessors, (100837), 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-09 19:33:01,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47713 states to 47713 states and 100837 transitions. [2024-11-09 19:33:01,511 INFO L78 Accepts]: Start accepts. Automaton has 47713 states and 100837 transitions. Word has length 226 [2024-11-09 19:33:01,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:33:01,511 INFO L471 AbstractCegarLoop]: Abstraction has 47713 states and 100837 transitions. [2024-11-09 19:33:01,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 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-09 19:33:01,512 INFO L276 IsEmpty]: Start isEmpty. Operand 47713 states and 100837 transitions. [2024-11-09 19:33:01,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-11-09 19:33:01,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:33:01,516 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:33:01,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:33:01,516 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:33:01,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:33:01,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1657264568, now seen corresponding path program 1 times [2024-11-09 19:33:01,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:33:01,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81779240] [2024-11-09 19:33:01,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:33:01,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:33:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:33:02,263 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 177 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:33:02,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:33:02,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81779240] [2024-11-09 19:33:02,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81779240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:33:02,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475814687] [2024-11-09 19:33:02,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:33:02,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:33:02,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:33:02,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:33:02,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:33:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:33:02,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 19:33:02,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:33:02,844 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:33:02,847 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:33:02,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475814687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:33:02,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:33:02,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:33:02,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902433687] [2024-11-09 19:33:02,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:33:02,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:33:02,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:33:02,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:33:02,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:33:02,850 INFO L87 Difference]: Start difference. First operand 47713 states and 100837 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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-09 19:33:08,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:33:08,454 INFO L93 Difference]: Finished difference Result 115900 states and 247940 transitions. [2024-11-09 19:33:08,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:33:08,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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 271 [2024-11-09 19:33:08,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:33:08,719 INFO L225 Difference]: With dead ends: 115900 [2024-11-09 19:33:08,720 INFO L226 Difference]: Without dead ends: 76870 [2024-11-09 19:33:08,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:33:08,743 INFO L432 NwaCegarLoop]: 966 mSDtfsCounter, 1459 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 3894 mSolverCounterSat, 765 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 4659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 765 IncrementalHoareTripleChecker+Valid, 3894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:33:08,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1459 Valid, 1141 Invalid, 4659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [765 Valid, 3894 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-09 19:33:08,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76870 states. [2024-11-09 19:33:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76870 to 76868. [2024-11-09 19:33:09,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76868 states, 76867 states have (on average 2.055056135923088) internal successors, (157966), 76867 states have internal predecessors, (157966), 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-09 19:33:10,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76868 states to 76868 states and 157966 transitions. [2024-11-09 19:33:10,025 INFO L78 Accepts]: Start accepts. Automaton has 76868 states and 157966 transitions. Word has length 271 [2024-11-09 19:33:10,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:33:10,026 INFO L471 AbstractCegarLoop]: Abstraction has 76868 states and 157966 transitions. [2024-11-09 19:33:10,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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-09 19:33:10,026 INFO L276 IsEmpty]: Start isEmpty. Operand 76868 states and 157966 transitions. [2024-11-09 19:33:10,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-11-09 19:33:10,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:33:10,034 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:33:10,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:33:10,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:33:10,235 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:33:10,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:33:10,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1604874508, now seen corresponding path program 1 times [2024-11-09 19:33:10,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:33:10,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458990634] [2024-11-09 19:33:10,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:33:10,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:33:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:33:10,597 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:33:10,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:33:10,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458990634] [2024-11-09 19:33:10,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458990634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:33:10,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:33:10,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:33:10,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353199] [2024-11-09 19:33:10,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:33:10,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:33:10,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:33:10,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:33:10,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:33:10,601 INFO L87 Difference]: Start difference. First operand 76868 states and 157966 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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-09 19:33:15,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:33:15,219 INFO L93 Difference]: Finished difference Result 152964 states and 314455 transitions. [2024-11-09 19:33:15,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:33:15,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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 280 [2024-11-09 19:33:15,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:33:15,334 INFO L225 Difference]: With dead ends: 152964 [2024-11-09 19:33:15,334 INFO L226 Difference]: Without dead ends: 76886 [2024-11-09 19:33:15,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:33:15,370 INFO L432 NwaCegarLoop]: 2032 mSDtfsCounter, 1710 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 3899 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1710 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 4505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 3899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:33:15,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1710 Valid, 2086 Invalid, 4505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 3899 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-09 19:33:15,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76886 states. [2024-11-09 19:33:16,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76886 to 76865. [2024-11-09 19:33:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76865 states, 76864 states have (on average 2.035179017485429) internal successors, (156432), 76864 states have internal predecessors, (156432), 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-09 19:33:16,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76865 states to 76865 states and 156432 transitions. [2024-11-09 19:33:16,916 INFO L78 Accepts]: Start accepts. Automaton has 76865 states and 156432 transitions. Word has length 280 [2024-11-09 19:33:16,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:33:16,917 INFO L471 AbstractCegarLoop]: Abstraction has 76865 states and 156432 transitions. [2024-11-09 19:33:16,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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-09 19:33:16,917 INFO L276 IsEmpty]: Start isEmpty. Operand 76865 states and 156432 transitions. [2024-11-09 19:33:16,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-11-09 19:33:16,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:33:16,925 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:33:16,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:33:16,926 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:33:16,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:33:16,926 INFO L85 PathProgramCache]: Analyzing trace with hash 949480335, now seen corresponding path program 1 times [2024-11-09 19:33:16,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:33:16,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203612495] [2024-11-09 19:33:16,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:33:16,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:33:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:33:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:33:17,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:33:17,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203612495] [2024-11-09 19:33:17,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203612495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:33:17,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:33:17,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:33:17,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162953721] [2024-11-09 19:33:17,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:33:17,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:33:17,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:33:17,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:33:17,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:33:17,186 INFO L87 Difference]: Start difference. First operand 76865 states and 156432 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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-09 19:33:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:33:21,608 INFO L93 Difference]: Finished difference Result 152132 states and 309765 transitions. [2024-11-09 19:33:21,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:33:21,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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 291 [2024-11-09 19:33:21,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:33:21,771 INFO L225 Difference]: With dead ends: 152132 [2024-11-09 19:33:21,771 INFO L226 Difference]: Without dead ends: 76057 [2024-11-09 19:33:21,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:33:21,797 INFO L432 NwaCegarLoop]: 2218 mSDtfsCounter, 1729 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 3773 mSolverCounterSat, 605 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1729 SdHoareTripleChecker+Valid, 2362 SdHoareTripleChecker+Invalid, 4378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 605 IncrementalHoareTripleChecker+Valid, 3773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:33:21,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1729 Valid, 2362 Invalid, 4378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [605 Valid, 3773 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 19:33:21,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76057 states. [2024-11-09 19:33:22,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76057 to 75263. [2024-11-09 19:33:22,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75263 states, 75262 states have (on average 1.993914591693019) internal successors, (150066), 75262 states have internal predecessors, (150066), 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-09 19:33:22,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75263 states to 75263 states and 150066 transitions. [2024-11-09 19:33:22,900 INFO L78 Accepts]: Start accepts. Automaton has 75263 states and 150066 transitions. Word has length 291 [2024-11-09 19:33:22,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:33:22,900 INFO L471 AbstractCegarLoop]: Abstraction has 75263 states and 150066 transitions. [2024-11-09 19:33:22,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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-09 19:33:22,901 INFO L276 IsEmpty]: Start isEmpty. Operand 75263 states and 150066 transitions. [2024-11-09 19:33:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2024-11-09 19:33:22,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:33:22,908 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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-09 19:33:22,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:33:22,909 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:33:22,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:33:22,909 INFO L85 PathProgramCache]: Analyzing trace with hash 704434791, now seen corresponding path program 1 times [2024-11-09 19:33:22,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:33:22,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022715012] [2024-11-09 19:33:22,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:33:22,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:33:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:33:23,817 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2024-11-09 19:33:23,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:33:23,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022715012] [2024-11-09 19:33:23,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022715012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:33:23,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:33:23,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:33:23,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918042187] [2024-11-09 19:33:23,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:33:23,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:33:23,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:33:23,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:33:23,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:33:23,819 INFO L87 Difference]: Start difference. First operand 75263 states and 150066 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 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)