./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label00.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e0fca5dbc26170dee357d8c920e255472ddf26c4f4efecf06bc9180208e51483 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:35:03,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:35:03,564 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:35:03,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:35:03,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:35:03,593 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:35:03,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:35:03,594 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:35:03,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:35:03,607 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:35:03,607 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:35:03,607 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:35:03,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:35:03,610 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:35:03,611 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:35:03,611 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:35:03,612 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:35:03,612 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:35:03,612 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:35:03,612 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:35:03,613 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:35:03,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:35:03,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:35:03,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:35:03,618 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:35:03,618 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:35:03,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:35:03,619 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:35:03,619 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:35:03,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:35:03,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:35:03,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:35:03,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:35:03,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:35:03,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:35:03,621 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:35:03,621 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:35:03,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:35:03,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:35:03,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:35:03,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:35:03,622 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:35:03,623 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-clean/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-clean/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 -> e0fca5dbc26170dee357d8c920e255472ddf26c4f4efecf06bc9180208e51483 [2024-10-10 23:35:03,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:35:03,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:35:03,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:35:03,933 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:35:03,935 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:35:03,936 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label00.c [2024-10-10 23:35:05,392 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:35:05,739 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:35:05,740 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label00.c [2024-10-10 23:35:05,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e089275bf/97d2be95cb0340e1bacd6cf5bafef397/FLAG37d2bf2cb [2024-10-10 23:35:05,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e089275bf/97d2be95cb0340e1bacd6cf5bafef397 [2024-10-10 23:35:05,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:35:05,783 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:35:05,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:35:05,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:35:05,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:35:05,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:35:05" (1/1) ... [2024-10-10 23:35:05,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43d4fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:05, skipping insertion in model container [2024-10-10 23:35:05,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:35:05" (1/1) ... [2024-10-10 23:35:05,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:35:06,082 WARN L248 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/Problem15_label00.c[1053,1066] [2024-10-10 23:35:06,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:35:06,544 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:35:06,556 WARN L248 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/Problem15_label00.c[1053,1066] [2024-10-10 23:35:06,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:35:06,843 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:35:06,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:06 WrapperNode [2024-10-10 23:35:06,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:35:06,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:35:06,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:35:06,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:35:06,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:06" (1/1) ... [2024-10-10 23:35:06,891 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:06" (1/1) ... [2024-10-10 23:35:07,061 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-10-10 23:35:07,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:35:07,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:35:07,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:35:07,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:35:07,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:06" (1/1) ... [2024-10-10 23:35:07,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:06" (1/1) ... [2024-10-10 23:35:07,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:06" (1/1) ... [2024-10-10 23:35:07,233 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-10-10 23:35:07,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:06" (1/1) ... [2024-10-10 23:35:07,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:06" (1/1) ... [2024-10-10 23:35:07,287 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:06" (1/1) ... [2024-10-10 23:35:07,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:06" (1/1) ... [2024-10-10 23:35:07,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:06" (1/1) ... [2024-10-10 23:35:07,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:06" (1/1) ... [2024-10-10 23:35:07,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:35:07,370 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:35:07,371 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:35:07,371 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:35:07,371 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:06" (1/1) ... [2024-10-10 23:35:07,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:35:07,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:35:07,405 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:35:07,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:35:07,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:35:07,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:35:07,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:35:07,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:35:07,521 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:35:07,523 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:35:10,026 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-10-10 23:35:10,026 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:35:10,081 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:35:10,084 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:35:10,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:35:10 BoogieIcfgContainer [2024-10-10 23:35:10,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:35:10,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:35:10,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:35:10,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:35:10,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:35:05" (1/3) ... [2024-10-10 23:35:10,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f06733b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:35:10, skipping insertion in model container [2024-10-10 23:35:10,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:06" (2/3) ... [2024-10-10 23:35:10,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f06733b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:35:10, skipping insertion in model container [2024-10-10 23:35:10,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:35:10" (3/3) ... [2024-10-10 23:35:10,093 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label00.c [2024-10-10 23:35:10,109 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:35:10,110 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:35:10,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:35:10,200 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;@573a497e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:35:10,201 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:35:10,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 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-10-10 23:35:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-10 23:35:10,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:10,213 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-10 23:35:10,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:10,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:10,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1781815696, now seen corresponding path program 1 times [2024-10-10 23:35:10,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:10,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284501233] [2024-10-10 23:35:10,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:10,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:10,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:10,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:10,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284501233] [2024-10-10 23:35:10,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284501233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:10,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:10,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:35:10,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255138048] [2024-10-10 23:35:10,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:10,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:10,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:10,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:10,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:10,478 INFO L87 Difference]: Start difference. First operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 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 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-10-10 23:35:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:12,500 INFO L93 Difference]: Finished difference Result 1029 states and 1981 transitions. [2024-10-10 23:35:12,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:12,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2024-10-10 23:35:12,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:12,517 INFO L225 Difference]: With dead ends: 1029 [2024-10-10 23:35:12,518 INFO L226 Difference]: Without dead ends: 664 [2024-10-10 23:35:12,522 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-10-10 23:35:12,525 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 313 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:12,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 318 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:35:12,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2024-10-10 23:35:12,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 662. [2024-10-10 23:35:12,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.4826021180030258) internal successors, (980), 661 states have internal predecessors, (980), 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-10-10 23:35:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 980 transitions. [2024-10-10 23:35:12,599 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 980 transitions. Word has length 5 [2024-10-10 23:35:12,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:12,599 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 980 transitions. [2024-10-10 23:35:12,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-10-10 23:35:12,600 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 980 transitions. [2024-10-10 23:35:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-10 23:35:12,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:12,602 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:35:12,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:35:12,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:12,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:12,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1239293441, now seen corresponding path program 1 times [2024-10-10 23:35:12,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:12,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287898224] [2024-10-10 23:35:12,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:12,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:12,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:12,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287898224] [2024-10-10 23:35:12,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287898224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:12,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:12,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:35:12,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923329386] [2024-10-10 23:35:12,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:12,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:12,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:12,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:12,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:12,962 INFO L87 Difference]: Start difference. First operand 662 states and 980 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 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-10-10 23:35:14,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:14,115 INFO L93 Difference]: Finished difference Result 1623 states and 2314 transitions. [2024-10-10 23:35:14,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:14,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 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 70 [2024-10-10 23:35:14,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:14,120 INFO L225 Difference]: With dead ends: 1623 [2024-10-10 23:35:14,120 INFO L226 Difference]: Without dead ends: 962 [2024-10-10 23:35:14,123 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-10-10 23:35:14,124 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:14,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 335 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:35:14,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-10-10 23:35:14,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2024-10-10 23:35:14,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 1.3631633714880333) internal successors, (1310), 961 states have internal predecessors, (1310), 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-10-10 23:35:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1310 transitions. [2024-10-10 23:35:14,157 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1310 transitions. Word has length 70 [2024-10-10 23:35:14,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:14,157 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1310 transitions. [2024-10-10 23:35:14,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 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-10-10 23:35:14,158 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1310 transitions. [2024-10-10 23:35:14,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-10 23:35:14,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:14,161 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:35:14,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:35:14,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:14,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:14,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1955604122, now seen corresponding path program 1 times [2024-10-10 23:35:14,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:14,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365950551] [2024-10-10 23:35:14,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:14,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:14,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:14,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:14,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365950551] [2024-10-10 23:35:14,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365950551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:14,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:14,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:35:14,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778359158] [2024-10-10 23:35:14,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:14,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:14,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:14,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:14,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:14,333 INFO L87 Difference]: Start difference. First operand 962 states and 1310 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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-10-10 23:35:15,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:15,734 INFO L93 Difference]: Finished difference Result 2228 states and 3185 transitions. [2024-10-10 23:35:15,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:15,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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 75 [2024-10-10 23:35:15,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:15,741 INFO L225 Difference]: With dead ends: 2228 [2024-10-10 23:35:15,742 INFO L226 Difference]: Without dead ends: 1566 [2024-10-10 23:35:15,744 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-10-10 23:35:15,748 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 258 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:15,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 314 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:35:15,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2024-10-10 23:35:15,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1265. [2024-10-10 23:35:15,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.3053797468354431) internal successors, (1650), 1264 states have internal predecessors, (1650), 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-10-10 23:35:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1650 transitions. [2024-10-10 23:35:15,786 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1650 transitions. Word has length 75 [2024-10-10 23:35:15,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:15,789 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1650 transitions. [2024-10-10 23:35:15,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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-10-10 23:35:15,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1650 transitions. [2024-10-10 23:35:15,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-10 23:35:15,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:15,795 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:15,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:35:15,795 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:15,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:15,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1446418672, now seen corresponding path program 1 times [2024-10-10 23:35:15,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:15,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076257838] [2024-10-10 23:35:15,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:15,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:16,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:16,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:16,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076257838] [2024-10-10 23:35:16,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076257838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:16,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:16,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:16,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021233901] [2024-10-10 23:35:16,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:16,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:35:16,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:16,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:35:16,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:35:16,022 INFO L87 Difference]: Start difference. First operand 1265 states and 1650 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 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-10-10 23:35:18,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:18,825 INFO L93 Difference]: Finished difference Result 4669 states and 6173 transitions. [2024-10-10 23:35:18,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:35:18,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2024-10-10 23:35:18,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:18,837 INFO L225 Difference]: With dead ends: 4669 [2024-10-10 23:35:18,837 INFO L226 Difference]: Without dead ends: 3405 [2024-10-10 23:35:18,842 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-10-10 23:35:18,843 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 557 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2279 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:18,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 373 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2279 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:35:18,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2024-10-10 23:35:18,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 3380. [2024-10-10 23:35:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3380 states, 3379 states have (on average 1.237348327907665) internal successors, (4181), 3379 states have internal predecessors, (4181), 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-10-10 23:35:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 4181 transitions. [2024-10-10 23:35:18,906 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 4181 transitions. Word has length 96 [2024-10-10 23:35:18,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:18,907 INFO L471 AbstractCegarLoop]: Abstraction has 3380 states and 4181 transitions. [2024-10-10 23:35:18,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 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-10-10 23:35:18,908 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 4181 transitions. [2024-10-10 23:35:18,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-10 23:35:18,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:18,911 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:35:18,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:35:18,912 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:18,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:18,912 INFO L85 PathProgramCache]: Analyzing trace with hash -115110364, now seen corresponding path program 1 times [2024-10-10 23:35:18,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:18,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050164884] [2024-10-10 23:35:18,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:18,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-10 23:35:19,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:19,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050164884] [2024-10-10 23:35:19,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050164884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:19,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:19,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:35:19,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618631240] [2024-10-10 23:35:19,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:19,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:19,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:19,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:19,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:19,134 INFO L87 Difference]: Start difference. First operand 3380 states and 4181 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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-10-10 23:35:20,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:20,423 INFO L93 Difference]: Finished difference Result 8562 states and 10759 transitions. [2024-10-10 23:35:20,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:20,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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 162 [2024-10-10 23:35:20,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:20,441 INFO L225 Difference]: With dead ends: 8562 [2024-10-10 23:35:20,442 INFO L226 Difference]: Without dead ends: 5482 [2024-10-10 23:35:20,446 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-10-10 23:35:20,448 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:20,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 335 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:35:20,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5482 states. [2024-10-10 23:35:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5482 to 5477. [2024-10-10 23:35:20,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5477 states, 5476 states have (on average 1.1694667640613587) internal successors, (6404), 5476 states have internal predecessors, (6404), 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-10-10 23:35:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5477 states to 5477 states and 6404 transitions. [2024-10-10 23:35:20,537 INFO L78 Accepts]: Start accepts. Automaton has 5477 states and 6404 transitions. Word has length 162 [2024-10-10 23:35:20,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:20,539 INFO L471 AbstractCegarLoop]: Abstraction has 5477 states and 6404 transitions. [2024-10-10 23:35:20,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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-10-10 23:35:20,540 INFO L276 IsEmpty]: Start isEmpty. Operand 5477 states and 6404 transitions. [2024-10-10 23:35:20,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-10 23:35:20,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:20,545 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:35:20,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:35:20,546 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:20,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:20,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1002172678, now seen corresponding path program 1 times [2024-10-10 23:35:20,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:20,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751706086] [2024-10-10 23:35:20,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:20,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:21,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:21,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751706086] [2024-10-10 23:35:21,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751706086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:21,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:21,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:35:21,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015617555] [2024-10-10 23:35:21,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:21,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:21,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:21,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:21,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:21,029 INFO L87 Difference]: Start difference. First operand 5477 states and 6404 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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-10-10 23:35:22,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:22,086 INFO L93 Difference]: Finished difference Result 10654 states and 12496 transitions. [2024-10-10 23:35:22,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:22,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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 163 [2024-10-10 23:35:22,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:22,103 INFO L225 Difference]: With dead ends: 10654 [2024-10-10 23:35:22,104 INFO L226 Difference]: Without dead ends: 5477 [2024-10-10 23:35:22,109 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-10-10 23:35:22,110 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 143 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:22,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 357 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:35:22,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5477 states. [2024-10-10 23:35:22,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5477 to 5477. [2024-10-10 23:35:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5477 states, 5476 states have (on average 1.1683710737764792) internal successors, (6398), 5476 states have internal predecessors, (6398), 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-10-10 23:35:22,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5477 states to 5477 states and 6398 transitions. [2024-10-10 23:35:22,184 INFO L78 Accepts]: Start accepts. Automaton has 5477 states and 6398 transitions. Word has length 163 [2024-10-10 23:35:22,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:22,185 INFO L471 AbstractCegarLoop]: Abstraction has 5477 states and 6398 transitions. [2024-10-10 23:35:22,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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-10-10 23:35:22,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5477 states and 6398 transitions. [2024-10-10 23:35:22,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-10 23:35:22,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:22,187 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:35:22,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:35:22,188 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:22,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:22,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1012938695, now seen corresponding path program 1 times [2024-10-10 23:35:22,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:22,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700357067] [2024-10-10 23:35:22,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:22,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:22,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:22,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:22,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700357067] [2024-10-10 23:35:22,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700357067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:22,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:22,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:22,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562684277] [2024-10-10 23:35:22,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:22,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:35:22,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:22,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:35:22,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:35:22,436 INFO L87 Difference]: Start difference. First operand 5477 states and 6398 transitions. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 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-10-10 23:35:24,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:24,740 INFO L93 Difference]: Finished difference Result 12183 states and 14318 transitions. [2024-10-10 23:35:24,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:35:24,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 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 181 [2024-10-10 23:35:24,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:24,760 INFO L225 Difference]: With dead ends: 12183 [2024-10-10 23:35:24,760 INFO L226 Difference]: Without dead ends: 7006 [2024-10-10 23:35:24,768 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-10-10 23:35:24,769 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 478 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1966 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:24,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 352 Invalid, 2173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1966 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:35:24,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7006 states. [2024-10-10 23:35:24,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7006 to 5785. [2024-10-10 23:35:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5785 states, 5784 states have (on average 1.1799792531120332) internal successors, (6825), 5784 states have internal predecessors, (6825), 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-10-10 23:35:24,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5785 states to 5785 states and 6825 transitions. [2024-10-10 23:35:24,867 INFO L78 Accepts]: Start accepts. Automaton has 5785 states and 6825 transitions. Word has length 181 [2024-10-10 23:35:24,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:24,867 INFO L471 AbstractCegarLoop]: Abstraction has 5785 states and 6825 transitions. [2024-10-10 23:35:24,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 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-10-10 23:35:24,868 INFO L276 IsEmpty]: Start isEmpty. Operand 5785 states and 6825 transitions. [2024-10-10 23:35:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-10 23:35:24,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:24,870 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:35:24,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:35:24,870 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:24,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:24,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1877061572, now seen corresponding path program 1 times [2024-10-10 23:35:24,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:24,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315925155] [2024-10-10 23:35:24,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:24,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:25,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:25,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315925155] [2024-10-10 23:35:25,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315925155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:25,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:25,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:25,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222263991] [2024-10-10 23:35:25,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:25,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:35:25,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:25,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:35:25,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:35:25,300 INFO L87 Difference]: Start difference. First operand 5785 states and 6825 transitions. Second operand has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 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-10-10 23:35:28,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:28,265 INFO L93 Difference]: Finished difference Result 13093 states and 15498 transitions. [2024-10-10 23:35:28,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:35:28,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 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 238 [2024-10-10 23:35:28,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:28,288 INFO L225 Difference]: With dead ends: 13093 [2024-10-10 23:35:28,293 INFO L226 Difference]: Without dead ends: 7608 [2024-10-10 23:35:28,298 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-10-10 23:35:28,299 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 419 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2240 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 2404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 2240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:28,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 391 Invalid, 2404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 2240 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-10 23:35:28,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7608 states. [2024-10-10 23:35:28,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7608 to 6085. [2024-10-10 23:35:28,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6085 states, 6084 states have (on average 1.1750493096646943) internal successors, (7149), 6084 states have internal predecessors, (7149), 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-10-10 23:35:28,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6085 states to 6085 states and 7149 transitions. [2024-10-10 23:35:28,396 INFO L78 Accepts]: Start accepts. Automaton has 6085 states and 7149 transitions. Word has length 238 [2024-10-10 23:35:28,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:28,396 INFO L471 AbstractCegarLoop]: Abstraction has 6085 states and 7149 transitions. [2024-10-10 23:35:28,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 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-10-10 23:35:28,400 INFO L276 IsEmpty]: Start isEmpty. Operand 6085 states and 7149 transitions. [2024-10-10 23:35:28,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-10-10 23:35:28,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:28,406 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:28,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:35:28,407 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:28,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:28,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1899765632, now seen corresponding path program 1 times [2024-10-10 23:35:28,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:28,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609407244] [2024-10-10 23:35:28,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:28,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:28,642 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-10 23:35:28,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:28,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609407244] [2024-10-10 23:35:28,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609407244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:28,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:28,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:28,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030285392] [2024-10-10 23:35:28,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:28,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:28,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:28,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:28,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:28,645 INFO L87 Difference]: Start difference. First operand 6085 states and 7149 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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-10-10 23:35:30,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:30,347 INFO L93 Difference]: Finished difference Result 14272 states and 17119 transitions. [2024-10-10 23:35:30,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:30,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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 292 [2024-10-10 23:35:30,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:30,366 INFO L225 Difference]: With dead ends: 14272 [2024-10-10 23:35:30,367 INFO L226 Difference]: Without dead ends: 8487 [2024-10-10 23:35:30,373 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-10-10 23:35:30,374 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 310 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:30,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 668 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:35:30,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8487 states. [2024-10-10 23:35:30,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8487 to 8483. [2024-10-10 23:35:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8483 states, 8482 states have (on average 1.1478424899787787) internal successors, (9736), 8482 states have internal predecessors, (9736), 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-10-10 23:35:30,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8483 states to 8483 states and 9736 transitions. [2024-10-10 23:35:30,482 INFO L78 Accepts]: Start accepts. Automaton has 8483 states and 9736 transitions. Word has length 292 [2024-10-10 23:35:30,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:30,482 INFO L471 AbstractCegarLoop]: Abstraction has 8483 states and 9736 transitions. [2024-10-10 23:35:30,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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-10-10 23:35:30,484 INFO L276 IsEmpty]: Start isEmpty. Operand 8483 states and 9736 transitions. [2024-10-10 23:35:30,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-10 23:35:30,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:30,488 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:35:30,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:35:30,489 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:30,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:30,489 INFO L85 PathProgramCache]: Analyzing trace with hash 586879821, now seen corresponding path program 1 times [2024-10-10 23:35:30,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:30,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60267890] [2024-10-10 23:35:30,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:30,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-10 23:35:30,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:30,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60267890] [2024-10-10 23:35:30,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60267890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:30,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:30,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:30,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744005672] [2024-10-10 23:35:30,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:30,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:30,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:30,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:30,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:30,809 INFO L87 Difference]: Start difference. First operand 8483 states and 9736 transitions. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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-10-10 23:35:32,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:32,673 INFO L93 Difference]: Finished difference Result 19662 states and 22940 transitions. [2024-10-10 23:35:32,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:32,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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 351 [2024-10-10 23:35:32,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:32,692 INFO L225 Difference]: With dead ends: 19662 [2024-10-10 23:35:32,693 INFO L226 Difference]: Without dead ends: 11479 [2024-10-10 23:35:32,702 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-10-10 23:35:32,703 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 321 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:32,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 632 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:35:32,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11479 states. [2024-10-10 23:35:32,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11479 to 10582. [2024-10-10 23:35:32,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10582 states, 10581 states have (on average 1.1332577261128438) internal successors, (11991), 10581 states have internal predecessors, (11991), 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-10-10 23:35:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10582 states to 10582 states and 11991 transitions. [2024-10-10 23:35:32,835 INFO L78 Accepts]: Start accepts. Automaton has 10582 states and 11991 transitions. Word has length 351 [2024-10-10 23:35:32,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:32,836 INFO L471 AbstractCegarLoop]: Abstraction has 10582 states and 11991 transitions. [2024-10-10 23:35:32,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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-10-10 23:35:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 10582 states and 11991 transitions. [2024-10-10 23:35:32,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-10-10 23:35:32,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:32,841 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:35:32,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:35:32,842 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:32,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:32,842 INFO L85 PathProgramCache]: Analyzing trace with hash -746149381, now seen corresponding path program 1 times [2024-10-10 23:35:32,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:32,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472120869] [2024-10-10 23:35:32,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:32,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:33,717 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:33,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:33,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472120869] [2024-10-10 23:35:33,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472120869] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:35:33,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718582531] [2024-10-10 23:35:33,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:33,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:35:33,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:35:33,721 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:35:33,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:35:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:33,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:35:33,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:35:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:35,184 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:35:39,498 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:39,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718582531] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:35:39,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:35:39,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-10-10 23:35:39,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152860396] [2024-10-10 23:35:39,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:39,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 23:35:39,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:39,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 23:35:39,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:35:39,503 INFO L87 Difference]: Start difference. First operand 10582 states and 11991 transitions. Second operand has 5 states, 5 states have (on average 70.4) internal successors, (352), 4 states have internal predecessors, (352), 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-10-10 23:35:43,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:43,054 INFO L93 Difference]: Finished difference Result 26293 states and 30186 transitions. [2024-10-10 23:35:43,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 23:35:43,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.4) internal successors, (352), 4 states have internal predecessors, (352), 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 352 [2024-10-10 23:35:43,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:43,083 INFO L225 Difference]: With dead ends: 26293 [2024-10-10 23:35:43,084 INFO L226 Difference]: Without dead ends: 16011 [2024-10-10 23:35:43,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 698 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:35:43,095 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 683 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 1035 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 3250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1035 IncrementalHoareTripleChecker+Valid, 2215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:43,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 114 Invalid, 3250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1035 Valid, 2215 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-10 23:35:43,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16011 states. [2024-10-10 23:35:43,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16011 to 11483. [2024-10-10 23:35:43,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11483 states, 11482 states have (on average 1.1698310398885212) internal successors, (13432), 11482 states have internal predecessors, (13432), 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-10-10 23:35:43,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11483 states to 11483 states and 13432 transitions. [2024-10-10 23:35:43,296 INFO L78 Accepts]: Start accepts. Automaton has 11483 states and 13432 transitions. Word has length 352 [2024-10-10 23:35:43,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:43,297 INFO L471 AbstractCegarLoop]: Abstraction has 11483 states and 13432 transitions. [2024-10-10 23:35:43,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.4) internal successors, (352), 4 states have internal predecessors, (352), 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-10-10 23:35:43,297 INFO L276 IsEmpty]: Start isEmpty. Operand 11483 states and 13432 transitions. [2024-10-10 23:35:43,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2024-10-10 23:35:43,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:43,302 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:35:43,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 23:35:43,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-10 23:35:43,503 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:43,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:43,504 INFO L85 PathProgramCache]: Analyzing trace with hash -253465236, now seen corresponding path program 1 times [2024-10-10 23:35:43,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:43,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403630649] [2024-10-10 23:35:43,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:43,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:43,790 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:43,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:43,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403630649] [2024-10-10 23:35:43,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403630649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:43,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:43,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:43,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191874549] [2024-10-10 23:35:43,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:43,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:43,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:43,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:43,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:43,793 INFO L87 Difference]: Start difference. First operand 11483 states and 13432 transitions. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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-10-10 23:35:45,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:45,247 INFO L93 Difference]: Finished difference Result 25665 states and 30680 transitions. [2024-10-10 23:35:45,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:45,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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 368 [2024-10-10 23:35:45,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:45,269 INFO L225 Difference]: With dead ends: 25665 [2024-10-10 23:35:45,270 INFO L226 Difference]: Without dead ends: 14482 [2024-10-10 23:35:45,283 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-10-10 23:35:45,284 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 246 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:45,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 620 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:35:45,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14482 states. [2024-10-10 23:35:45,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14482 to 13577. [2024-10-10 23:35:45,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13577 states, 13576 states have (on average 1.1612404242781378) internal successors, (15765), 13576 states have internal predecessors, (15765), 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-10-10 23:35:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13577 states to 13577 states and 15765 transitions. [2024-10-10 23:35:45,500 INFO L78 Accepts]: Start accepts. Automaton has 13577 states and 15765 transitions. Word has length 368 [2024-10-10 23:35:45,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:45,501 INFO L471 AbstractCegarLoop]: Abstraction has 13577 states and 15765 transitions. [2024-10-10 23:35:45,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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-10-10 23:35:45,501 INFO L276 IsEmpty]: Start isEmpty. Operand 13577 states and 15765 transitions. [2024-10-10 23:35:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2024-10-10 23:35:45,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:45,508 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:35:45,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:35:45,508 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:45,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:45,509 INFO L85 PathProgramCache]: Analyzing trace with hash -675376714, now seen corresponding path program 1 times [2024-10-10 23:35:45,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:45,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561787956] [2024-10-10 23:35:45,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:45,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:45,756 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-10-10 23:35:45,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:45,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561787956] [2024-10-10 23:35:45,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561787956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:45,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:45,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:45,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883351173] [2024-10-10 23:35:45,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:45,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:45,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:45,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:45,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:45,760 INFO L87 Difference]: Start difference. First operand 13577 states and 15765 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:47,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:47,095 INFO L93 Difference]: Finished difference Result 34646 states and 40387 transitions. [2024-10-10 23:35:47,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:47,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 414 [2024-10-10 23:35:47,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:47,128 INFO L225 Difference]: With dead ends: 34646 [2024-10-10 23:35:47,128 INFO L226 Difference]: Without dead ends: 21369 [2024-10-10 23:35:47,142 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-10-10 23:35:47,143 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 321 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:47,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 619 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:35:47,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21369 states. [2024-10-10 23:35:47,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21369 to 21055. [2024-10-10 23:35:47,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21055 states, 21054 states have (on average 1.1328963617364871) internal successors, (23852), 21054 states have internal predecessors, (23852), 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-10-10 23:35:47,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21055 states to 21055 states and 23852 transitions. [2024-10-10 23:35:47,422 INFO L78 Accepts]: Start accepts. Automaton has 21055 states and 23852 transitions. Word has length 414 [2024-10-10 23:35:47,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:47,423 INFO L471 AbstractCegarLoop]: Abstraction has 21055 states and 23852 transitions. [2024-10-10 23:35:47,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:47,423 INFO L276 IsEmpty]: Start isEmpty. Operand 21055 states and 23852 transitions. [2024-10-10 23:35:47,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2024-10-10 23:35:47,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:47,433 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:35:47,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:35:47,434 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:47,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:47,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1037854379, now seen corresponding path program 1 times [2024-10-10 23:35:47,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:47,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125365280] [2024-10-10 23:35:47,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:47,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 4 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:48,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:48,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125365280] [2024-10-10 23:35:48,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125365280] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:35:48,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824640298] [2024-10-10 23:35:48,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:48,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:35:48,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:35:48,328 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:35:48,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:35:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:48,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 23:35:48,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:35:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 4 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:51,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:35:52,063 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 85 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:52,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824640298] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:35:52,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:35:52,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-10-10 23:35:52,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156252997] [2024-10-10 23:35:52,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:35:52,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-10 23:35:52,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:52,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-10 23:35:52,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-10-10 23:35:52,067 INFO L87 Difference]: Start difference. First operand 21055 states and 23852 transitions. Second operand has 13 states, 13 states have (on average 85.07692307692308) internal successors, (1106), 12 states have internal predecessors, (1106), 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-10-10 23:36:02,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:36:02,144 INFO L93 Difference]: Finished difference Result 85653 states and 97311 transitions. [2024-10-10 23:36:02,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-10 23:36:02,145 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 85.07692307692308) internal successors, (1106), 12 states have internal predecessors, (1106), 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 459 [2024-10-10 23:36:02,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:36:02,221 INFO L225 Difference]: With dead ends: 85653 [2024-10-10 23:36:02,221 INFO L226 Difference]: Without dead ends: 64898 [2024-10-10 23:36:02,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 928 GetRequests, 910 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2024-10-10 23:36:02,241 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 5753 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 7594 mSolverCounterSat, 4364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5753 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 11958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4364 IncrementalHoareTripleChecker+Valid, 7594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:36:02,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5753 Valid, 292 Invalid, 11958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4364 Valid, 7594 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2024-10-10 23:36:02,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64898 states. [2024-10-10 23:36:02,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64898 to 28248. [2024-10-10 23:36:02,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28248 states, 28247 states have (on average 1.1451835593160336) internal successors, (32348), 28247 states have internal predecessors, (32348), 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-10-10 23:36:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28248 states to 28248 states and 32348 transitions. [2024-10-10 23:36:02,738 INFO L78 Accepts]: Start accepts. Automaton has 28248 states and 32348 transitions. Word has length 459 [2024-10-10 23:36:02,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:36:02,739 INFO L471 AbstractCegarLoop]: Abstraction has 28248 states and 32348 transitions. [2024-10-10 23:36:02,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 85.07692307692308) internal successors, (1106), 12 states have internal predecessors, (1106), 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-10-10 23:36:02,740 INFO L276 IsEmpty]: Start isEmpty. Operand 28248 states and 32348 transitions. [2024-10-10 23:36:02,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2024-10-10 23:36:02,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:36:02,745 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:36:02,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:36:02,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:36:02,946 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:36:02,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:36:02,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2087458615, now seen corresponding path program 1 times [2024-10-10 23:36:02,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:36:02,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32355307] [2024-10-10 23:36:02,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:36:02,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:36:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:36:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 83 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:36:03,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:36:03,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32355307] [2024-10-10 23:36:03,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32355307] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:36:03,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461728787] [2024-10-10 23:36:03,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:36:03,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:36:03,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:36:03,924 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:36:03,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:36:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:36:04,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:36:04,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:36:14,124 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-10 23:36:14,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:36:14,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461728787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:36:14,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:36:14,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:36:14,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560756429] [2024-10-10 23:36:14,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:36:14,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:36:14,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:36:14,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:36:14,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:36:14,127 INFO L87 Difference]: Start difference. First operand 28248 states and 32348 transitions. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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-10-10 23:36:15,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:36:15,842 INFO L93 Difference]: Finished difference Result 68158 states and 78339 transitions. [2024-10-10 23:36:15,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:36:15,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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 482 [2024-10-10 23:36:15,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:36:15,884 INFO L225 Difference]: With dead ends: 68158 [2024-10-10 23:36:15,884 INFO L226 Difference]: Without dead ends: 40210 [2024-10-10 23:36:15,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:36:15,909 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 278 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:36:15,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 189 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:36:15,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40210 states. [2024-10-10 23:36:16,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40210 to 31233. [2024-10-10 23:36:16,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31233 states, 31232 states have (on average 1.1592597336065573) internal successors, (36206), 31232 states have internal predecessors, (36206), 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-10-10 23:36:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31233 states to 31233 states and 36206 transitions. [2024-10-10 23:36:16,265 INFO L78 Accepts]: Start accepts. Automaton has 31233 states and 36206 transitions. Word has length 482 [2024-10-10 23:36:16,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:36:16,266 INFO L471 AbstractCegarLoop]: Abstraction has 31233 states and 36206 transitions. [2024-10-10 23:36:16,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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-10-10 23:36:16,266 INFO L276 IsEmpty]: Start isEmpty. Operand 31233 states and 36206 transitions. [2024-10-10 23:36:16,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-10-10 23:36:16,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:36:16,271 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:36:16,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 23:36:16,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:36:16,472 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:36:16,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:36:16,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1022333099, now seen corresponding path program 1 times [2024-10-10 23:36:16,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:36:16,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130684709] [2024-10-10 23:36:16,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:36:16,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:36:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:36:17,148 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 344 proven. 39 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 23:36:17,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:36:17,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130684709] [2024-10-10 23:36:17,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130684709] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:36:17,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841996845] [2024-10-10 23:36:17,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:36:17,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:36:17,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:36:17,151 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:36:17,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 23:36:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:36:17,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:36:17,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:36:18,094 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 23:36:18,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:36:18,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841996845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:36:18,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:36:18,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:36:18,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279513145] [2024-10-10 23:36:18,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:36:18,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:36:18,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:36:18,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:36:18,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:36:18,097 INFO L87 Difference]: Start difference. First operand 31233 states and 36206 transitions. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 3 states have internal predecessors, (487), 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)