./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e88e261bdd8209c6645351b9246697a266f2a89be3660180d29cb5cfb2f2528f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:37:28,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:37:28,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:37:28,936 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:37:28,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:37:28,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:37:28,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:37:28,953 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:37:28,953 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:37:28,954 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:37:28,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:37:28,954 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:37:28,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:37:28,955 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:37:28,955 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:37:28,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:37:28,955 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:37:28,956 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:37:28,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:37:28,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:37:28,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:37:28,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:37:28,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:37:28,963 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:37:28,963 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:37:28,963 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:37:28,963 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:37:28,964 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:37:28,964 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:37:28,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:37:28,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:37:28,964 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:37:28,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:37:28,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:37:28,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:37:28,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:37:28,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:37:28,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:37:28,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:37:28,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:37:28,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:37:28,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:37:28,967 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e88e261bdd8209c6645351b9246697a266f2a89be3660180d29cb5cfb2f2528f [2024-10-12 20:37:29,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:37:29,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:37:29,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:37:29,167 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:37:29,167 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:37:29,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2024-10-12 20:37:30,347 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:37:30,573 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:37:30,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2024-10-12 20:37:30,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/461631a3e/856683dc93804af8af7dbc93e2558fe3/FLAG41b6b6208 [2024-10-12 20:37:30,598 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/461631a3e/856683dc93804af8af7dbc93e2558fe3 [2024-10-12 20:37:30,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:37:30,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:37:30,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:37:30,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:37:30,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:37:30,606 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:37:30" (1/1) ... [2024-10-12 20:37:30,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b0a0d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:37:30, skipping insertion in model container [2024-10-12 20:37:30,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:37:30" (1/1) ... [2024-10-12 20:37:30,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:37:30,924 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/seq-mthreaded-reduced/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c[22673,22686] [2024-10-12 20:37:31,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:37:31,066 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:37:31,155 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/seq-mthreaded-reduced/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c[22673,22686] [2024-10-12 20:37:31,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:37:31,224 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:37:31,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:37:31 WrapperNode [2024-10-12 20:37:31,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:37:31,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:37:31,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:37:31,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:37:31,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:37:31" (1/1) ... [2024-10-12 20:37:31,257 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:37:31" (1/1) ... [2024-10-12 20:37:31,332 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2936 [2024-10-12 20:37:31,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:37:31,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:37:31,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:37:31,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:37:31,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:37:31" (1/1) ... [2024-10-12 20:37:31,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:37:31" (1/1) ... [2024-10-12 20:37:31,400 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:37:31" (1/1) ... [2024-10-12 20:37:31,452 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-12 20:37:31,453 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:37:31" (1/1) ... [2024-10-12 20:37:31,453 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:37:31" (1/1) ... [2024-10-12 20:37:31,485 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:37:31" (1/1) ... [2024-10-12 20:37:31,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:37:31" (1/1) ... [2024-10-12 20:37:31,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:37:31" (1/1) ... [2024-10-12 20:37:31,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:37:31" (1/1) ... [2024-10-12 20:37:31,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:37:31,543 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:37:31,543 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:37:31,543 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:37:31,544 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:37:31" (1/1) ... [2024-10-12 20:37:31,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:37:31,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:37:31,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:37:31,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:37:31,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:37:31,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:37:31,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:37:31,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:37:31,754 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:37:31,755 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:37:33,498 INFO L? ?]: Removed 237 outVars from TransFormulas that were not future-live. [2024-10-12 20:37:33,498 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:37:33,579 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:37:33,579 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:37:33,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:37:33 BoogieIcfgContainer [2024-10-12 20:37:33,580 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:37:33,581 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:37:33,582 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:37:33,584 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:37:33,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:37:30" (1/3) ... [2024-10-12 20:37:33,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71063d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:37:33, skipping insertion in model container [2024-10-12 20:37:33,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:37:31" (2/3) ... [2024-10-12 20:37:33,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71063d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:37:33, skipping insertion in model container [2024-10-12 20:37:33,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:37:33" (3/3) ... [2024-10-12 20:37:33,586 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2024-10-12 20:37:33,599 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:37:33,599 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:37:33,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:37:33,679 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;@74b69f38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:37:33,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:37:33,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 748 states, 746 states have (on average 1.8351206434316354) internal successors, (1369), 747 states have internal predecessors, (1369), 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-12 20:37:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-12 20:37:33,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:37:33,710 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:37:33,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:37:33,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:37:33,716 INFO L85 PathProgramCache]: Analyzing trace with hash 938918786, now seen corresponding path program 1 times [2024-10-12 20:37:33,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:37:33,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384952371] [2024-10-12 20:37:33,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:37:33,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:37:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:37:34,339 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-12 20:37:34,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:37:34,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384952371] [2024-10-12 20:37:34,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384952371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:37:34,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:37:34,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:37:34,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228680607] [2024-10-12 20:37:34,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:37:34,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:37:34,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:37:34,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:37:34,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:37:34,370 INFO L87 Difference]: Start difference. First operand has 748 states, 746 states have (on average 1.8351206434316354) internal successors, (1369), 747 states have internal predecessors, (1369), 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 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-12 20:37:34,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:37:34,500 INFO L93 Difference]: Finished difference Result 1176 states and 2095 transitions. [2024-10-12 20:37:34,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:37:34,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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 192 [2024-10-12 20:37:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:37:34,521 INFO L225 Difference]: With dead ends: 1176 [2024-10-12 20:37:34,521 INFO L226 Difference]: Without dead ends: 951 [2024-10-12 20:37:34,524 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-12 20:37:34,530 INFO L432 NwaCegarLoop]: 1361 mSDtfsCounter, 371 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 2652 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:37:34,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 2652 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:37:34,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2024-10-12 20:37:34,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 949. [2024-10-12 20:37:34,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 948 states have (on average 1.7521097046413503) internal successors, (1661), 948 states have internal predecessors, (1661), 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-12 20:37:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1661 transitions. [2024-10-12 20:37:34,600 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1661 transitions. Word has length 192 [2024-10-12 20:37:34,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:37:34,601 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1661 transitions. [2024-10-12 20:37:34,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-12 20:37:34,601 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1661 transitions. [2024-10-12 20:37:34,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-12 20:37:34,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:37:34,606 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:37:34,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:37:34,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:37:34,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:37:34,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1521085881, now seen corresponding path program 1 times [2024-10-12 20:37:34,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:37:34,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368935865] [2024-10-12 20:37:34,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:37:34,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:37:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:37:34,925 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-12 20:37:34,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:37:34,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368935865] [2024-10-12 20:37:34,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368935865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:37:34,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:37:34,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:37:34,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831181379] [2024-10-12 20:37:34,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:37:34,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:37:34,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:37:34,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:37:34,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:37:34,930 INFO L87 Difference]: Start difference. First operand 949 states and 1661 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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-12 20:37:34,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:37:34,984 INFO L93 Difference]: Finished difference Result 1769 states and 3045 transitions. [2024-10-12 20:37:34,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:37:34,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 196 [2024-10-12 20:37:34,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:37:34,991 INFO L225 Difference]: With dead ends: 1769 [2024-10-12 20:37:34,991 INFO L226 Difference]: Without dead ends: 1347 [2024-10-12 20:37:34,994 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-12 20:37:34,995 INFO L432 NwaCegarLoop]: 1317 mSDtfsCounter, 339 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 2601 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:37:34,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 2601 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:37:34,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2024-10-12 20:37:35,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1345. [2024-10-12 20:37:35,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1344 states have (on average 1.7321428571428572) internal successors, (2328), 1344 states have internal predecessors, (2328), 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-12 20:37:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 2328 transitions. [2024-10-12 20:37:35,022 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 2328 transitions. Word has length 196 [2024-10-12 20:37:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:37:35,022 INFO L471 AbstractCegarLoop]: Abstraction has 1345 states and 2328 transitions. [2024-10-12 20:37:35,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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-12 20:37:35,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 2328 transitions. [2024-10-12 20:37:35,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-12 20:37:35,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:37:35,026 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:37:35,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:37:35,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:37:35,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:37:35,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1588337652, now seen corresponding path program 1 times [2024-10-12 20:37:35,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:37:35,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13682574] [2024-10-12 20:37:35,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:37:35,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:37:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:37:35,283 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-12 20:37:35,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:37:35,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13682574] [2024-10-12 20:37:35,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13682574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:37:35,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:37:35,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:37:35,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775299835] [2024-10-12 20:37:35,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:37:35,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:37:35,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:37:35,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:37:35,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:37:35,286 INFO L87 Difference]: Start difference. First operand 1345 states and 2328 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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-12 20:37:35,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:37:35,335 INFO L93 Difference]: Finished difference Result 2933 states and 5002 transitions. [2024-10-12 20:37:35,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:37:35,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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 200 [2024-10-12 20:37:35,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:37:35,343 INFO L225 Difference]: With dead ends: 2933 [2024-10-12 20:37:35,345 INFO L226 Difference]: Without dead ends: 2115 [2024-10-12 20:37:35,347 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-12 20:37:35,350 INFO L432 NwaCegarLoop]: 1317 mSDtfsCounter, 331 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 2602 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:37:35,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 2602 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:37:35,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2024-10-12 20:37:35,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 2113. [2024-10-12 20:37:35,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2113 states, 2112 states have (on average 1.7121212121212122) internal successors, (3616), 2112 states have internal predecessors, (3616), 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-12 20:37:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 3616 transitions. [2024-10-12 20:37:35,394 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 3616 transitions. Word has length 200 [2024-10-12 20:37:35,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:37:35,395 INFO L471 AbstractCegarLoop]: Abstraction has 2113 states and 3616 transitions. [2024-10-12 20:37:35,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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-12 20:37:35,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 3616 transitions. [2024-10-12 20:37:35,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-12 20:37:35,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:37:35,400 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:37:35,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:37:35,400 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:37:35,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:37:35,401 INFO L85 PathProgramCache]: Analyzing trace with hash 646910929, now seen corresponding path program 1 times [2024-10-12 20:37:35,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:37:35,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59664397] [2024-10-12 20:37:35,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:37:35,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:37:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:37:35,614 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-12 20:37:35,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:37:35,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59664397] [2024-10-12 20:37:35,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59664397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:37:35,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:37:35,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:37:35,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271955962] [2024-10-12 20:37:35,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:37:35,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:37:35,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:37:35,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:37:35,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:37:35,617 INFO L87 Difference]: Start difference. First operand 2113 states and 3616 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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-12 20:37:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:37:35,720 INFO L93 Difference]: Finished difference Result 5189 states and 8778 transitions. [2024-10-12 20:37:35,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:37:35,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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 204 [2024-10-12 20:37:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:37:35,729 INFO L225 Difference]: With dead ends: 5189 [2024-10-12 20:37:35,729 INFO L226 Difference]: Without dead ends: 3603 [2024-10-12 20:37:35,732 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-12 20:37:35,733 INFO L432 NwaCegarLoop]: 1317 mSDtfsCounter, 323 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 2603 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:37:35,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 2603 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:37:35,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3603 states. [2024-10-12 20:37:35,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3603 to 3601. [2024-10-12 20:37:35,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3601 states, 3600 states have (on average 1.6944444444444444) internal successors, (6100), 3600 states have internal predecessors, (6100), 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-12 20:37:35,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3601 states to 3601 states and 6100 transitions. [2024-10-12 20:37:35,806 INFO L78 Accepts]: Start accepts. Automaton has 3601 states and 6100 transitions. Word has length 204 [2024-10-12 20:37:35,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:37:35,807 INFO L471 AbstractCegarLoop]: Abstraction has 3601 states and 6100 transitions. [2024-10-12 20:37:35,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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-12 20:37:35,807 INFO L276 IsEmpty]: Start isEmpty. Operand 3601 states and 6100 transitions. [2024-10-12 20:37:35,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-12 20:37:35,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:37:35,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:37:35,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:37:35,811 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:37:35,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:37:35,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1479277718, now seen corresponding path program 1 times [2024-10-12 20:37:35,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:37:35,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40112321] [2024-10-12 20:37:35,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:37:35,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:37:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:37:36,016 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-12 20:37:36,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:37:36,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40112321] [2024-10-12 20:37:36,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40112321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:37:36,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:37:36,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:37:36,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61297940] [2024-10-12 20:37:36,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:37:36,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:37:36,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:37:36,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:37:36,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:37:36,019 INFO L87 Difference]: Start difference. First operand 3601 states and 6100 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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-12 20:37:36,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:37:36,144 INFO L93 Difference]: Finished difference Result 9557 states and 16054 transitions. [2024-10-12 20:37:36,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:37:36,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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 208 [2024-10-12 20:37:36,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:37:36,162 INFO L225 Difference]: With dead ends: 9557 [2024-10-12 20:37:36,163 INFO L226 Difference]: Without dead ends: 6483 [2024-10-12 20:37:36,168 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-12 20:37:36,171 INFO L432 NwaCegarLoop]: 1317 mSDtfsCounter, 315 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 2604 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:37:36,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 2604 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:37:36,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6483 states. [2024-10-12 20:37:36,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6483 to 6481. [2024-10-12 20:37:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6481 states, 6480 states have (on average 1.6796296296296296) internal successors, (10884), 6480 states have internal predecessors, (10884), 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-12 20:37:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6481 states to 6481 states and 10884 transitions. [2024-10-12 20:37:36,272 INFO L78 Accepts]: Start accepts. Automaton has 6481 states and 10884 transitions. Word has length 208 [2024-10-12 20:37:36,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:37:36,272 INFO L471 AbstractCegarLoop]: Abstraction has 6481 states and 10884 transitions. [2024-10-12 20:37:36,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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-12 20:37:36,273 INFO L276 IsEmpty]: Start isEmpty. Operand 6481 states and 10884 transitions. [2024-10-12 20:37:36,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-12 20:37:36,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:37:36,277 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:37:36,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:37:36,277 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:37:36,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:37:36,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1890289317, now seen corresponding path program 1 times [2024-10-12 20:37:36,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:37:36,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725771484] [2024-10-12 20:37:36,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:37:36,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:37:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:37:36,642 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-12 20:37:36,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:37:36,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725771484] [2024-10-12 20:37:36,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725771484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:37:36,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:37:36,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:37:36,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125093090] [2024-10-12 20:37:36,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:37:36,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:37:36,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:37:36,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:37:36,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:37:36,644 INFO L87 Difference]: Start difference. First operand 6481 states and 10884 transitions. Second operand has 7 states, 7 states have (on average 30.285714285714285) internal successors, (212), 7 states have internal predecessors, (212), 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-12 20:37:37,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:37:37,235 INFO L93 Difference]: Finished difference Result 40005 states and 67166 transitions. [2024-10-12 20:37:37,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:37:37,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 30.285714285714285) internal successors, (212), 7 states have internal predecessors, (212), 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 212 [2024-10-12 20:37:37,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:37:37,311 INFO L225 Difference]: With dead ends: 40005 [2024-10-12 20:37:37,311 INFO L226 Difference]: Without dead ends: 34051 [2024-10-12 20:37:37,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-12 20:37:37,330 INFO L432 NwaCegarLoop]: 1307 mSDtfsCounter, 4630 mSDsluCounter, 10022 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4630 SdHoareTripleChecker+Valid, 11329 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:37:37,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4630 Valid, 11329 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:37:37,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34051 states. [2024-10-12 20:37:37,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34051 to 12218. [2024-10-12 20:37:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12218 states, 12217 states have (on average 1.6737333224195792) internal successors, (20448), 12217 states have internal predecessors, (20448), 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-12 20:37:37,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12218 states to 12218 states and 20448 transitions. [2024-10-12 20:37:37,750 INFO L78 Accepts]: Start accepts. Automaton has 12218 states and 20448 transitions. Word has length 212 [2024-10-12 20:37:37,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:37:37,751 INFO L471 AbstractCegarLoop]: Abstraction has 12218 states and 20448 transitions. [2024-10-12 20:37:37,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.285714285714285) internal successors, (212), 7 states have internal predecessors, (212), 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-12 20:37:37,751 INFO L276 IsEmpty]: Start isEmpty. Operand 12218 states and 20448 transitions. [2024-10-12 20:37:37,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-12 20:37:37,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:37:37,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:37:37,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:37:37,761 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:37:37,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:37:37,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1458953532, now seen corresponding path program 1 times [2024-10-12 20:37:37,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:37:37,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104096869] [2024-10-12 20:37:37,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:37:37,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:37:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:37:37,972 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-12 20:37:37,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:37:37,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104096869] [2024-10-12 20:37:37,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104096869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:37:37,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:37:37,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:37:37,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855346460] [2024-10-12 20:37:37,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:37:37,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:37:37,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:37:37,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:37:37,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:37:37,975 INFO L87 Difference]: Start difference. First operand 12218 states and 20448 transitions. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 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-12 20:37:38,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:37:38,291 INFO L93 Difference]: Finished difference Result 35927 states and 60191 transitions. [2024-10-12 20:37:38,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:37:38,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 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 213 [2024-10-12 20:37:38,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:37:38,329 INFO L225 Difference]: With dead ends: 35927 [2024-10-12 20:37:38,329 INFO L226 Difference]: Without dead ends: 24236 [2024-10-12 20:37:38,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:37:38,343 INFO L432 NwaCegarLoop]: 1310 mSDtfsCounter, 1087 mSDsluCounter, 2936 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 4246 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:37:38,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 4246 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:37:38,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24236 states. [2024-10-12 20:37:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24236 to 18194. [2024-10-12 20:37:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18194 states, 18193 states have (on average 1.6733908646182598) internal successors, (30444), 18193 states have internal predecessors, (30444), 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-12 20:37:38,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18194 states to 18194 states and 30444 transitions. [2024-10-12 20:37:38,587 INFO L78 Accepts]: Start accepts. Automaton has 18194 states and 30444 transitions. Word has length 213 [2024-10-12 20:37:38,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:37:38,587 INFO L471 AbstractCegarLoop]: Abstraction has 18194 states and 30444 transitions. [2024-10-12 20:37:38,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 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-12 20:37:38,587 INFO L276 IsEmpty]: Start isEmpty. Operand 18194 states and 30444 transitions. [2024-10-12 20:37:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-12 20:37:38,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:37:38,595 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:37:38,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:37:38,595 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:37:38,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:37:38,596 INFO L85 PathProgramCache]: Analyzing trace with hash -790637102, now seen corresponding path program 1 times [2024-10-12 20:37:38,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:37:38,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018142136] [2024-10-12 20:37:38,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:37:38,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:37:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:37:38,791 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-12 20:37:38,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:37:38,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018142136] [2024-10-12 20:37:38,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018142136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:37:38,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:37:38,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:37:38,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120065118] [2024-10-12 20:37:38,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:37:38,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:37:38,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:37:38,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:37:38,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:37:38,793 INFO L87 Difference]: Start difference. First operand 18194 states and 30444 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-12 20:37:38,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:37:38,937 INFO L93 Difference]: Finished difference Result 35158 states and 58815 transitions. [2024-10-12 20:37:38,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:37:38,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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 214 [2024-10-12 20:37:38,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:37:38,975 INFO L225 Difference]: With dead ends: 35158 [2024-10-12 20:37:38,976 INFO L226 Difference]: Without dead ends: 25876 [2024-10-12 20:37:38,994 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-12 20:37:38,995 INFO L432 NwaCegarLoop]: 1489 mSDtfsCounter, 332 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 2753 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:37:38,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 2753 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:37:39,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25876 states. [2024-10-12 20:37:39,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25876 to 25874. [2024-10-12 20:37:39,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25874 states, 25873 states have (on average 1.6695010242337571) internal successors, (43195), 25873 states have internal predecessors, (43195), 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-12 20:37:39,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25874 states to 25874 states and 43195 transitions. [2024-10-12 20:37:39,422 INFO L78 Accepts]: Start accepts. Automaton has 25874 states and 43195 transitions. Word has length 214 [2024-10-12 20:37:39,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:37:39,422 INFO L471 AbstractCegarLoop]: Abstraction has 25874 states and 43195 transitions. [2024-10-12 20:37:39,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-12 20:37:39,423 INFO L276 IsEmpty]: Start isEmpty. Operand 25874 states and 43195 transitions. [2024-10-12 20:37:39,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-12 20:37:39,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:37:39,427 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:37:39,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:37:39,428 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:37:39,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:37:39,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2084142526, now seen corresponding path program 1 times [2024-10-12 20:37:39,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:37:39,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078560062] [2024-10-12 20:37:39,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:37:39,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:37:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:37:39,723 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-12 20:37:39,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:37:39,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078560062] [2024-10-12 20:37:39,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078560062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:37:39,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:37:39,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:37:39,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27204637] [2024-10-12 20:37:39,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:37:39,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:37:39,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:37:39,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:37:39,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:37:39,726 INFO L87 Difference]: Start difference. First operand 25874 states and 43195 transitions. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 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-12 20:37:40,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:37:40,005 INFO L93 Difference]: Finished difference Result 76634 states and 128033 transitions. [2024-10-12 20:37:40,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:37:40,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 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 214 [2024-10-12 20:37:40,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:37:40,099 INFO L225 Difference]: With dead ends: 76634 [2024-10-12 20:37:40,100 INFO L226 Difference]: Without dead ends: 51511 [2024-10-12 20:37:40,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:37:40,146 INFO L432 NwaCegarLoop]: 1331 mSDtfsCounter, 1085 mSDsluCounter, 2742 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 4073 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:37:40,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 4073 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:37:40,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51511 states. [2024-10-12 20:37:40,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51511 to 38625. [2024-10-12 20:37:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38625 states, 38624 states have (on average 1.6671758492129245) internal successors, (64393), 38624 states have internal predecessors, (64393), 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-12 20:37:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38625 states to 38625 states and 64393 transitions. [2024-10-12 20:37:40,758 INFO L78 Accepts]: Start accepts. Automaton has 38625 states and 64393 transitions. Word has length 214 [2024-10-12 20:37:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:37:40,759 INFO L471 AbstractCegarLoop]: Abstraction has 38625 states and 64393 transitions. [2024-10-12 20:37:40,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 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-12 20:37:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 38625 states and 64393 transitions. [2024-10-12 20:37:40,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-12 20:37:40,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:37:40,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:37:40,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:37:40,766 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:37:40,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:37:40,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1621773826, now seen corresponding path program 1 times [2024-10-12 20:37:40,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:37:40,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177238895] [2024-10-12 20:37:40,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:37:40,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:37:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:37:41,029 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-12 20:37:41,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:37:41,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177238895] [2024-10-12 20:37:41,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177238895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:37:41,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:37:41,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:37:41,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285542375] [2024-10-12 20:37:41,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:37:41,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:37:41,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:37:41,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:37:41,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:37:41,031 INFO L87 Difference]: Start difference. First operand 38625 states and 64393 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-12 20:37:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:37:41,187 INFO L93 Difference]: Finished difference Result 75333 states and 125637 transitions. [2024-10-12 20:37:41,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:37:41,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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 214 [2024-10-12 20:37:41,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:37:41,257 INFO L225 Difference]: With dead ends: 75333 [2024-10-12 20:37:41,257 INFO L226 Difference]: Without dead ends: 55423 [2024-10-12 20:37:41,288 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-12 20:37:41,289 INFO L432 NwaCegarLoop]: 1378 mSDtfsCounter, 316 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 2644 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:37:41,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 2644 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:37:41,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55423 states. [2024-10-12 20:37:41,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55423 to 55421. [2024-10-12 20:37:42,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55421 states, 55420 states have (on average 1.6632443161313606) internal successors, (92177), 55420 states have internal predecessors, (92177), 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-12 20:37:42,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55421 states to 55421 states and 92177 transitions. [2024-10-12 20:37:42,165 INFO L78 Accepts]: Start accepts. Automaton has 55421 states and 92177 transitions. Word has length 214 [2024-10-12 20:37:42,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:37:42,165 INFO L471 AbstractCegarLoop]: Abstraction has 55421 states and 92177 transitions. [2024-10-12 20:37:42,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-12 20:37:42,166 INFO L276 IsEmpty]: Start isEmpty. Operand 55421 states and 92177 transitions. [2024-10-12 20:37:42,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-12 20:37:42,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:37:42,172 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:37:42,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:37:42,172 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:37:42,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:37:42,172 INFO L85 PathProgramCache]: Analyzing trace with hash 2049773352, now seen corresponding path program 1 times [2024-10-12 20:37:42,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:37:42,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159005805] [2024-10-12 20:37:42,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:37:42,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:37:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:37:42,443 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-12 20:37:42,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:37:42,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159005805] [2024-10-12 20:37:42,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159005805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:37:42,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:37:42,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:37:42,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151516451] [2024-10-12 20:37:42,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:37:42,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:37:42,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:37:42,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:37:42,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:37:42,448 INFO L87 Difference]: Start difference. First operand 55421 states and 92177 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-12 20:37:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:37:42,706 INFO L93 Difference]: Finished difference Result 105537 states and 175717 transitions. [2024-10-12 20:37:42,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:37:42,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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 214 [2024-10-12 20:37:42,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:37:42,967 INFO L225 Difference]: With dead ends: 105537 [2024-10-12 20:37:42,968 INFO L226 Difference]: Without dead ends: 77193 [2024-10-12 20:37:42,986 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-12 20:37:42,987 INFO L432 NwaCegarLoop]: 1445 mSDtfsCounter, 324 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:37:42,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 2710 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:37:43,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77193 states. [2024-10-12 20:37:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77193 to 77191. [2024-10-12 20:37:43,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77191 states, 77190 states have (on average 1.6602798289933929) internal successors, (128157), 77190 states have internal predecessors, (128157), 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-12 20:37:43,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77191 states to 77191 states and 128157 transitions. [2024-10-12 20:37:43,841 INFO L78 Accepts]: Start accepts. Automaton has 77191 states and 128157 transitions. Word has length 214 [2024-10-12 20:37:43,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:37:43,842 INFO L471 AbstractCegarLoop]: Abstraction has 77191 states and 128157 transitions. [2024-10-12 20:37:43,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-12 20:37:43,842 INFO L276 IsEmpty]: Start isEmpty. Operand 77191 states and 128157 transitions. [2024-10-12 20:37:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-12 20:37:43,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:37:43,846 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:37:43,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:37:43,847 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:37:43,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:37:43,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1652622844, now seen corresponding path program 1 times [2024-10-12 20:37:43,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:37:43,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137773644] [2024-10-12 20:37:43,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:37:43,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:37:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:37:44,181 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-12 20:37:44,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:37:44,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137773644] [2024-10-12 20:37:44,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137773644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:37:44,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:37:44,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:37:44,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553375894] [2024-10-12 20:37:44,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:37:44,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:37:44,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:37:44,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:37:44,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:37:44,183 INFO L87 Difference]: Start difference. First operand 77191 states and 128157 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-12 20:37:44,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:37:44,538 INFO L93 Difference]: Finished difference Result 168657 states and 280201 transitions. [2024-10-12 20:37:44,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:37:44,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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 214 [2024-10-12 20:37:44,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:37:44,927 INFO L225 Difference]: With dead ends: 168657 [2024-10-12 20:37:44,928 INFO L226 Difference]: Without dead ends: 116252 [2024-10-12 20:37:44,981 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-12 20:37:44,985 INFO L432 NwaCegarLoop]: 1555 mSDtfsCounter, 340 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:37:44,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 2818 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:37:45,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116252 states. [2024-10-12 20:37:45,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116252 to 116250. [2024-10-12 20:37:46,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116250 states, 116249 states have (on average 1.656384140938847) internal successors, (192553), 116249 states have internal predecessors, (192553), 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-12 20:37:46,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116250 states to 116250 states and 192553 transitions. [2024-10-12 20:37:46,292 INFO L78 Accepts]: Start accepts. Automaton has 116250 states and 192553 transitions. Word has length 214 [2024-10-12 20:37:46,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:37:46,293 INFO L471 AbstractCegarLoop]: Abstraction has 116250 states and 192553 transitions. [2024-10-12 20:37:46,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-12 20:37:46,293 INFO L276 IsEmpty]: Start isEmpty. Operand 116250 states and 192553 transitions. [2024-10-12 20:37:46,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-12 20:37:46,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:37:46,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:37:46,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:37:46,296 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:37:46,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:37:46,297 INFO L85 PathProgramCache]: Analyzing trace with hash -828137562, now seen corresponding path program 1 times [2024-10-12 20:37:46,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:37:46,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559129639] [2024-10-12 20:37:46,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:37:46,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:37:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:37:46,451 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-12 20:37:46,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:37:46,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559129639] [2024-10-12 20:37:46,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559129639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:37:46,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:37:46,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:37:46,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90338481] [2024-10-12 20:37:46,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:37:46,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:37:46,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:37:46,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:37:46,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:37:46,454 INFO L87 Difference]: Start difference. First operand 116250 states and 192553 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-12 20:37:47,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:37:47,368 INFO L93 Difference]: Finished difference Result 255733 states and 424952 transitions. [2024-10-12 20:37:47,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:37:47,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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 214 [2024-10-12 20:37:47,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:37:47,608 INFO L225 Difference]: With dead ends: 255733 [2024-10-12 20:37:47,609 INFO L226 Difference]: Without dead ends: 175650 [2024-10-12 20:37:47,712 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-12 20:37:47,712 INFO L432 NwaCegarLoop]: 1614 mSDtfsCounter, 348 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:37:47,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 2876 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:37:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175650 states. [2024-10-12 20:37:49,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175650 to 175648. [2024-10-12 20:37:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175648 states, 175647 states have (on average 1.654466059767602) internal successors, (290602), 175647 states have internal predecessors, (290602), 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-12 20:37:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175648 states to 175648 states and 290602 transitions. [2024-10-12 20:37:50,297 INFO L78 Accepts]: Start accepts. Automaton has 175648 states and 290602 transitions. Word has length 214 [2024-10-12 20:37:50,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:37:50,298 INFO L471 AbstractCegarLoop]: Abstraction has 175648 states and 290602 transitions. [2024-10-12 20:37:50,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-12 20:37:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 175648 states and 290602 transitions. [2024-10-12 20:37:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-12 20:37:50,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:37:50,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:37:50,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:37:50,300 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:37:50,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:37:50,301 INFO L85 PathProgramCache]: Analyzing trace with hash -246412605, now seen corresponding path program 1 times [2024-10-12 20:37:50,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:37:50,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416210247] [2024-10-12 20:37:50,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:37:50,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:37:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:37:50,524 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-12 20:37:50,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:37:50,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416210247] [2024-10-12 20:37:50,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416210247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:37:50,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:37:50,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:37:50,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243257291] [2024-10-12 20:37:50,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:37:50,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:37:50,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:37:50,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:37:50,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:37:50,526 INFO L87 Difference]: Start difference. First operand 175648 states and 290602 transitions. Second operand has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 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-12 20:37:52,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:37:52,908 INFO L93 Difference]: Finished difference Result 576571 states and 954745 transitions. [2024-10-12 20:37:52,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:37:52,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 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 215 [2024-10-12 20:37:52,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:37:53,588 INFO L225 Difference]: With dead ends: 576571 [2024-10-12 20:37:53,588 INFO L226 Difference]: Without dead ends: 401564 [2024-10-12 20:37:53,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:37:53,739 INFO L432 NwaCegarLoop]: 1311 mSDtfsCounter, 1083 mSDsluCounter, 2788 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 4099 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:37:53,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 4099 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:37:54,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401564 states. [2024-10-12 20:37:57,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401564 to 288163. [2024-10-12 20:37:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288163 states, 288162 states have (on average 1.6509081697100936) internal successors, (475729), 288162 states have internal predecessors, (475729), 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-12 20:37:58,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288163 states to 288163 states and 475729 transitions. [2024-10-12 20:37:58,700 INFO L78 Accepts]: Start accepts. Automaton has 288163 states and 475729 transitions. Word has length 215 [2024-10-12 20:37:58,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:37:58,700 INFO L471 AbstractCegarLoop]: Abstraction has 288163 states and 475729 transitions. [2024-10-12 20:37:58,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 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-12 20:37:58,700 INFO L276 IsEmpty]: Start isEmpty. Operand 288163 states and 475729 transitions. [2024-10-12 20:37:58,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-12 20:37:58,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:37:58,702 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:37:58,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:37:58,702 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:37:58,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:37:58,702 INFO L85 PathProgramCache]: Analyzing trace with hash 893198121, now seen corresponding path program 1 times [2024-10-12 20:37:58,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:37:58,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852356141] [2024-10-12 20:37:58,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:37:58,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:37:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:37:58,869 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-12 20:37:58,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:37:58,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852356141] [2024-10-12 20:37:58,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852356141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:37:58,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:37:58,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:37:58,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105674178] [2024-10-12 20:37:58,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:37:58,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:37:58,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:37:58,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:37:58,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:37:58,871 INFO L87 Difference]: Start difference. First operand 288163 states and 475729 transitions. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:38:02,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:38:02,281 INFO L93 Difference]: Finished difference Result 942725 states and 1557827 transitions. [2024-10-12 20:38:02,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:38:02,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 216 [2024-10-12 20:38:02,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:38:03,402 INFO L225 Difference]: With dead ends: 942725 [2024-10-12 20:38:03,402 INFO L226 Difference]: Without dead ends: 655203 [2024-10-12 20:38:03,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:38:03,611 INFO L432 NwaCegarLoop]: 1308 mSDtfsCounter, 1081 mSDsluCounter, 2942 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 4250 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:38:03,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 4250 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:38:04,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655203 states. [2024-10-12 20:38:09,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655203 to 470958. [2024-10-12 20:38:10,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470958 states, 470957 states have (on average 1.647411547126383) internal successors, (775860), 470957 states have internal predecessors, (775860), 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-12 20:38:11,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470958 states to 470958 states and 775860 transitions. [2024-10-12 20:38:11,847 INFO L78 Accepts]: Start accepts. Automaton has 470958 states and 775860 transitions. Word has length 216 [2024-10-12 20:38:11,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:38:11,848 INFO L471 AbstractCegarLoop]: Abstraction has 470958 states and 775860 transitions. [2024-10-12 20:38:11,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:38:11,848 INFO L276 IsEmpty]: Start isEmpty. Operand 470958 states and 775860 transitions. [2024-10-12 20:38:11,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-12 20:38:11,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:38:11,849 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:38:11,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:38:11,849 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:38:11,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:38:11,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1865950282, now seen corresponding path program 1 times [2024-10-12 20:38:11,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:38:11,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530291920] [2024-10-12 20:38:11,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:38:11,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:38:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:38:12,007 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-12 20:38:12,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:38:12,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530291920] [2024-10-12 20:38:12,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530291920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:38:12,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:38:12,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:38:12,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892816006] [2024-10-12 20:38:12,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:38:12,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:38:12,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:38:12,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:38:12,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:38:12,011 INFO L87 Difference]: Start difference. First operand 470958 states and 775860 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 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)