./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_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-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_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-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 169d16a82e2efb21b41720aab8fadcf5ecf67324651e69e91d6cb4f921e3dcd4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:23:43,558 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:23:43,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:23:43,641 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:23:43,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:23:43,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:23:43,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:23:43,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:23:43,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:23:43,682 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:23:43,683 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:23:43,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:23:43,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:23:43,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:23:43,685 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:23:43,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:23:43,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:23:43,686 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:23:43,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:23:43,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:23:43,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:23:43,688 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:23:43,688 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:23:43,688 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:23:43,689 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:23:43,689 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:23:43,689 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:23:43,690 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:23:43,690 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:23:43,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:23:43,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:23:43,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:23:43,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:23:43,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:23:43,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:23:43,692 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:23:43,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:23:43,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:23:43,693 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:23:43,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:23:43,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:23:43,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:23:43,695 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 -> 169d16a82e2efb21b41720aab8fadcf5ecf67324651e69e91d6cb4f921e3dcd4 [2024-10-12 20:23:43,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:23:44,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:23:44,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:23:44,015 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:23:44,015 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:23:44,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2024-10-12 20:23:45,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:23:45,761 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:23:45,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2024-10-12 20:23:45,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c578a0f8/137170b592e74ef6ad486592540b1f9c/FLAGb49ea3d4e [2024-10-12 20:23:45,809 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c578a0f8/137170b592e74ef6ad486592540b1f9c [2024-10-12 20:23:45,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:23:45,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:23:45,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:23:45,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:23:45,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:23:45,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:23:45" (1/1) ... [2024-10-12 20:23:45,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70c01e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:45, skipping insertion in model container [2024-10-12 20:23:45,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:23:45" (1/1) ... [2024-10-12 20:23:45,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:23:46,229 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_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c[13215,13228] [2024-10-12 20:23:46,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:23:46,334 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:23:46,507 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_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c[13215,13228] [2024-10-12 20:23:46,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:23:46,670 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:23:46,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:46 WrapperNode [2024-10-12 20:23:46,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:23:46,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:23:46,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:23:46,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:23:46,678 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:23:46" (1/1) ... [2024-10-12 20:23:46,695 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:23:46" (1/1) ... [2024-10-12 20:23:46,755 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1437 [2024-10-12 20:23:46,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:23:46,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:23:46,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:23:46,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:23:46,769 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:46" (1/1) ... [2024-10-12 20:23:46,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:46" (1/1) ... [2024-10-12 20:23:46,777 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:46" (1/1) ... [2024-10-12 20:23:46,808 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:23:46,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:46" (1/1) ... [2024-10-12 20:23:46,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:46" (1/1) ... [2024-10-12 20:23:46,830 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:46" (1/1) ... [2024-10-12 20:23:46,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:46" (1/1) ... [2024-10-12 20:23:46,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:46" (1/1) ... [2024-10-12 20:23:46,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:46" (1/1) ... [2024-10-12 20:23:46,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:23:46,857 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:23:46,857 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:23:46,857 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:23:46,858 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:46" (1/1) ... [2024-10-12 20:23:46,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:23:46,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:23:46,908 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:23:46,916 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:23:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:23:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:23:46,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:23:46,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:23:47,094 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:23:47,096 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:23:48,312 INFO L? ?]: Removed 190 outVars from TransFormulas that were not future-live. [2024-10-12 20:23:48,312 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:23:48,371 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:23:48,375 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:23:48,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:23:48 BoogieIcfgContainer [2024-10-12 20:23:48,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:23:48,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:23:48,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:23:48,384 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:23:48,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:23:45" (1/3) ... [2024-10-12 20:23:48,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6257a6d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:23:48, skipping insertion in model container [2024-10-12 20:23:48,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:46" (2/3) ... [2024-10-12 20:23:48,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6257a6d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:23:48, skipping insertion in model container [2024-10-12 20:23:48,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:23:48" (3/3) ... [2024-10-12 20:23:48,387 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2024-10-12 20:23:48,405 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:23:48,405 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:23:48,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:23:48,495 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;@70792a6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:23:48,495 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:23:48,504 INFO L276 IsEmpty]: Start isEmpty. Operand has 404 states, 402 states have (on average 1.6517412935323383) internal successors, (664), 403 states have internal predecessors, (664), 0 states have call successors, (0), 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:23:48,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 20:23:48,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:48,530 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] [2024-10-12 20:23:48,531 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:48,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:48,539 INFO L85 PathProgramCache]: Analyzing trace with hash -687145031, now seen corresponding path program 1 times [2024-10-12 20:23:48,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:48,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84653955] [2024-10-12 20:23:48,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:48,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:49,131 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:23:49,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:49,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84653955] [2024-10-12 20:23:49,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84653955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:49,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:49,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:23:49,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782083351] [2024-10-12 20:23:49,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:49,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:23:49,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:49,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:23:49,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:23:49,172 INFO L87 Difference]: Start difference. First operand has 404 states, 402 states have (on average 1.6517412935323383) internal successors, (664), 403 states have internal predecessors, (664), 0 states have call successors, (0), 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 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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:23:49,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:49,371 INFO L93 Difference]: Finished difference Result 776 states and 1264 transitions. [2024-10-12 20:23:49,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:23:49,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2024-10-12 20:23:49,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:49,391 INFO L225 Difference]: With dead ends: 776 [2024-10-12 20:23:49,391 INFO L226 Difference]: Without dead ends: 402 [2024-10-12 20:23:49,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:23:49,399 INFO L432 NwaCegarLoop]: 656 mSDtfsCounter, 146 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:49,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1780 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:23:49,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-10-12 20:23:49,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2024-10-12 20:23:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 1.5511221945137157) internal successors, (622), 401 states have internal predecessors, (622), 0 states have call successors, (0), 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:23:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 622 transitions. [2024-10-12 20:23:49,454 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 622 transitions. Word has length 102 [2024-10-12 20:23:49,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:49,455 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 622 transitions. [2024-10-12 20:23:49,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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:23:49,455 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 622 transitions. [2024-10-12 20:23:49,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-12 20:23:49,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:49,459 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] [2024-10-12 20:23:49,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:23:49,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:49,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:49,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1124095584, now seen corresponding path program 1 times [2024-10-12 20:23:49,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:49,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969770995] [2024-10-12 20:23:49,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:49,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:49,647 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:23:49,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:49,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969770995] [2024-10-12 20:23:49,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969770995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:49,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:49,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:49,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412243857] [2024-10-12 20:23:49,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:49,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:49,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:49,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:49,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:49,654 INFO L87 Difference]: Start difference. First operand 402 states and 622 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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:23:49,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:49,706 INFO L93 Difference]: Finished difference Result 951 states and 1498 transitions. [2024-10-12 20:23:49,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:49,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2024-10-12 20:23:49,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:49,713 INFO L225 Difference]: With dead ends: 951 [2024-10-12 20:23:49,714 INFO L226 Difference]: Without dead ends: 610 [2024-10-12 20:23:49,716 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:23:49,717 INFO L432 NwaCegarLoop]: 608 mSDtfsCounter, 419 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:49,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1094 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:49,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-10-12 20:23:49,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 608. [2024-10-12 20:23:49,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 607 states have (on average 1.5617792421746293) internal successors, (948), 607 states have internal predecessors, (948), 0 states have call successors, (0), 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:23:49,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 948 transitions. [2024-10-12 20:23:49,747 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 948 transitions. Word has length 133 [2024-10-12 20:23:49,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:49,748 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 948 transitions. [2024-10-12 20:23:49,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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:23:49,748 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 948 transitions. [2024-10-12 20:23:49,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-12 20:23:49,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:49,752 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] [2024-10-12 20:23:49,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:23:49,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:49,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:49,753 INFO L85 PathProgramCache]: Analyzing trace with hash -949245018, now seen corresponding path program 1 times [2024-10-12 20:23:49,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:49,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538886307] [2024-10-12 20:23:49,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:49,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:49,958 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:23:49,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:49,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538886307] [2024-10-12 20:23:49,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538886307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:49,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:49,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:49,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553127484] [2024-10-12 20:23:49,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:49,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:49,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:49,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:49,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:49,963 INFO L87 Difference]: Start difference. First operand 608 states and 948 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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:23:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:50,021 INFO L93 Difference]: Finished difference Result 1493 states and 2357 transitions. [2024-10-12 20:23:50,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:50,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2024-10-12 20:23:50,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:50,027 INFO L225 Difference]: With dead ends: 1493 [2024-10-12 20:23:50,027 INFO L226 Difference]: Without dead ends: 959 [2024-10-12 20:23:50,029 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:23:50,030 INFO L432 NwaCegarLoop]: 718 mSDtfsCounter, 403 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:50,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1179 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:50,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2024-10-12 20:23:50,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 957. [2024-10-12 20:23:50,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 956 states have (on average 1.5669456066945606) internal successors, (1498), 956 states have internal predecessors, (1498), 0 states have call successors, (0), 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:23:50,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1498 transitions. [2024-10-12 20:23:50,061 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1498 transitions. Word has length 135 [2024-10-12 20:23:50,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:50,062 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 1498 transitions. [2024-10-12 20:23:50,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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:23:50,063 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1498 transitions. [2024-10-12 20:23:50,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-12 20:23:50,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:50,066 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] [2024-10-12 20:23:50,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:23:50,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:50,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:50,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1134740278, now seen corresponding path program 1 times [2024-10-12 20:23:50,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:50,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498889696] [2024-10-12 20:23:50,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:50,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:50,186 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:23:50,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:50,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498889696] [2024-10-12 20:23:50,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498889696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:50,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:50,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:50,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702809923] [2024-10-12 20:23:50,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:50,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:50,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:50,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:50,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:50,189 INFO L87 Difference]: Start difference. First operand 957 states and 1498 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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:23:50,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:50,240 INFO L93 Difference]: Finished difference Result 2396 states and 3778 transitions. [2024-10-12 20:23:50,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:50,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2024-10-12 20:23:50,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:50,249 INFO L225 Difference]: With dead ends: 2396 [2024-10-12 20:23:50,249 INFO L226 Difference]: Without dead ends: 1526 [2024-10-12 20:23:50,252 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:23:50,254 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 389 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:50,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1024 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:50,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2024-10-12 20:23:50,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1524. [2024-10-12 20:23:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 1523 states have (on average 1.5653315824031517) internal successors, (2384), 1523 states have internal predecessors, (2384), 0 states have call successors, (0), 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:23:50,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 2384 transitions. [2024-10-12 20:23:50,294 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 2384 transitions. Word has length 137 [2024-10-12 20:23:50,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:50,296 INFO L471 AbstractCegarLoop]: Abstraction has 1524 states and 2384 transitions. [2024-10-12 20:23:50,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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:23:50,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 2384 transitions. [2024-10-12 20:23:50,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-12 20:23:50,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:50,301 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] [2024-10-12 20:23:50,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:23:50,302 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:50,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:50,303 INFO L85 PathProgramCache]: Analyzing trace with hash 919943810, now seen corresponding path program 1 times [2024-10-12 20:23:50,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:50,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133658654] [2024-10-12 20:23:50,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:50,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:50,454 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:23:50,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:50,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133658654] [2024-10-12 20:23:50,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133658654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:50,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:50,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:50,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794864867] [2024-10-12 20:23:50,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:50,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:50,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:50,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:50,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:50,459 INFO L87 Difference]: Start difference. First operand 1524 states and 2384 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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:23:50,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:50,532 INFO L93 Difference]: Finished difference Result 3817 states and 5987 transitions. [2024-10-12 20:23:50,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:50,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2024-10-12 20:23:50,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:50,544 INFO L225 Difference]: With dead ends: 3817 [2024-10-12 20:23:50,544 INFO L226 Difference]: Without dead ends: 2393 [2024-10-12 20:23:50,547 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:23:50,549 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 374 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:50,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 989 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:50,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2024-10-12 20:23:50,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2391. [2024-10-12 20:23:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2391 states, 2390 states have (on average 1.5556485355648535) internal successors, (3718), 2390 states have internal predecessors, (3718), 0 states have call successors, (0), 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:23:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 3718 transitions. [2024-10-12 20:23:50,605 INFO L78 Accepts]: Start accepts. Automaton has 2391 states and 3718 transitions. Word has length 139 [2024-10-12 20:23:50,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:50,606 INFO L471 AbstractCegarLoop]: Abstraction has 2391 states and 3718 transitions. [2024-10-12 20:23:50,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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:23:50,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3718 transitions. [2024-10-12 20:23:50,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-12 20:23:50,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:50,613 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:50,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:23:50,614 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:50,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:50,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1455219060, now seen corresponding path program 1 times [2024-10-12 20:23:50,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:50,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138182385] [2024-10-12 20:23:50,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:50,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:50,894 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:23:50,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:50,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138182385] [2024-10-12 20:23:50,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138182385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:50,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:50,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:23:50,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103616404] [2024-10-12 20:23:50,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:50,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:23:50,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:50,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:23:50,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:23:50,899 INFO L87 Difference]: Start difference. First operand 2391 states and 3718 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:51,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:51,337 INFO L93 Difference]: Finished difference Result 14071 states and 21896 transitions. [2024-10-12 20:23:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:23:51,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2024-10-12 20:23:51,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:51,383 INFO L225 Difference]: With dead ends: 14071 [2024-10-12 20:23:51,383 INFO L226 Difference]: Without dead ends: 11784 [2024-10-12 20:23:51,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:23:51,393 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 4316 mSDsluCounter, 5388 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4316 SdHoareTripleChecker+Valid, 5981 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:51,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4316 Valid, 5981 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:23:51,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11784 states. [2024-10-12 20:23:51,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11784 to 4733. [2024-10-12 20:23:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4733 states, 4732 states have (on average 1.5388841927303465) internal successors, (7282), 4732 states have internal predecessors, (7282), 0 states have call successors, (0), 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:23:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4733 states to 4733 states and 7282 transitions. [2024-10-12 20:23:51,644 INFO L78 Accepts]: Start accepts. Automaton has 4733 states and 7282 transitions. Word has length 141 [2024-10-12 20:23:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:51,644 INFO L471 AbstractCegarLoop]: Abstraction has 4733 states and 7282 transitions. [2024-10-12 20:23:51,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 4733 states and 7282 transitions. [2024-10-12 20:23:51,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-12 20:23:51,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:51,658 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] [2024-10-12 20:23:51,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:23:51,659 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:51,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:51,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1251675641, now seen corresponding path program 1 times [2024-10-12 20:23:51,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:51,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782982789] [2024-10-12 20:23:51,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:51,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:51,786 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:23:51,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:51,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782982789] [2024-10-12 20:23:51,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782982789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:51,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:51,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:51,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115005238] [2024-10-12 20:23:51,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:51,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:51,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:51,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:51,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:51,789 INFO L87 Difference]: Start difference. First operand 4733 states and 7282 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:51,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:51,877 INFO L93 Difference]: Finished difference Result 13105 states and 20133 transitions. [2024-10-12 20:23:51,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:51,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2024-10-12 20:23:51,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:51,912 INFO L225 Difference]: With dead ends: 13105 [2024-10-12 20:23:51,912 INFO L226 Difference]: Without dead ends: 8415 [2024-10-12 20:23:51,920 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:23:51,921 INFO L432 NwaCegarLoop]: 948 mSDtfsCounter, 413 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:51,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1441 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:51,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8415 states. [2024-10-12 20:23:52,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8415 to 8413. [2024-10-12 20:23:52,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8413 states, 8412 states have (on average 1.5254398478364242) internal successors, (12832), 8412 states have internal predecessors, (12832), 0 states have call successors, (0), 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:23:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8413 states to 8413 states and 12832 transitions. [2024-10-12 20:23:52,169 INFO L78 Accepts]: Start accepts. Automaton has 8413 states and 12832 transitions. Word has length 144 [2024-10-12 20:23:52,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:52,169 INFO L471 AbstractCegarLoop]: Abstraction has 8413 states and 12832 transitions. [2024-10-12 20:23:52,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:52,170 INFO L276 IsEmpty]: Start isEmpty. Operand 8413 states and 12832 transitions. [2024-10-12 20:23:52,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-12 20:23:52,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:52,186 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] [2024-10-12 20:23:52,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:23:52,187 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:52,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:52,187 INFO L85 PathProgramCache]: Analyzing trace with hash 6611986, now seen corresponding path program 1 times [2024-10-12 20:23:52,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:52,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608481310] [2024-10-12 20:23:52,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:52,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:52,299 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:23:52,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:52,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608481310] [2024-10-12 20:23:52,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608481310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:52,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:52,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:52,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112250771] [2024-10-12 20:23:52,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:52,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:52,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:52,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:52,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:52,301 INFO L87 Difference]: Start difference. First operand 8413 states and 12832 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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:23:52,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:52,504 INFO L93 Difference]: Finished difference Result 24238 states and 36919 transitions. [2024-10-12 20:23:52,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:52,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2024-10-12 20:23:52,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:52,550 INFO L225 Difference]: With dead ends: 24238 [2024-10-12 20:23:52,551 INFO L226 Difference]: Without dead ends: 15970 [2024-10-12 20:23:52,564 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:23:52,566 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 449 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:52,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1085 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:52,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15970 states. [2024-10-12 20:23:52,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15970 to 15968. [2024-10-12 20:23:52,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15968 states, 15967 states have (on average 1.512745036638066) internal successors, (24154), 15967 states have internal predecessors, (24154), 0 states have call successors, (0), 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:23:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15968 states to 15968 states and 24154 transitions. [2024-10-12 20:23:53,000 INFO L78 Accepts]: Start accepts. Automaton has 15968 states and 24154 transitions. Word has length 145 [2024-10-12 20:23:53,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:53,001 INFO L471 AbstractCegarLoop]: Abstraction has 15968 states and 24154 transitions. [2024-10-12 20:23:53,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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:23:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand 15968 states and 24154 transitions. [2024-10-12 20:23:53,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-12 20:23:53,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:53,036 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] [2024-10-12 20:23:53,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:23:53,036 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:53,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:53,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1812024679, now seen corresponding path program 1 times [2024-10-12 20:23:53,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:53,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702848685] [2024-10-12 20:23:53,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:53,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:53,166 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:23:53,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:53,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702848685] [2024-10-12 20:23:53,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702848685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:53,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:53,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:53,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915513447] [2024-10-12 20:23:53,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:53,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:53,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:53,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:53,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:53,170 INFO L87 Difference]: Start difference. First operand 15968 states and 24154 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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:23:53,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:53,607 INFO L93 Difference]: Finished difference Result 45750 states and 69017 transitions. [2024-10-12 20:23:53,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:53,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2024-10-12 20:23:53,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:53,677 INFO L225 Difference]: With dead ends: 45750 [2024-10-12 20:23:53,677 INFO L226 Difference]: Without dead ends: 30163 [2024-10-12 20:23:53,706 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:23:53,708 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 431 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:53,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1085 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:23:53,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30163 states. [2024-10-12 20:23:54,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30163 to 30161. [2024-10-12 20:23:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30161 states, 30160 states have (on average 1.4971485411140584) internal successors, (45154), 30160 states have internal predecessors, (45154), 0 states have call successors, (0), 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:23:54,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30161 states to 30161 states and 45154 transitions. [2024-10-12 20:23:54,367 INFO L78 Accepts]: Start accepts. Automaton has 30161 states and 45154 transitions. Word has length 145 [2024-10-12 20:23:54,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:54,368 INFO L471 AbstractCegarLoop]: Abstraction has 30161 states and 45154 transitions. [2024-10-12 20:23:54,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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:23:54,369 INFO L276 IsEmpty]: Start isEmpty. Operand 30161 states and 45154 transitions. [2024-10-12 20:23:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-12 20:23:54,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:54,617 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] [2024-10-12 20:23:54,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:23:54,618 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:54,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:54,618 INFO L85 PathProgramCache]: Analyzing trace with hash -758664238, now seen corresponding path program 1 times [2024-10-12 20:23:54,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:54,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389654700] [2024-10-12 20:23:54,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:54,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:54,746 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:23:54,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:54,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389654700] [2024-10-12 20:23:54,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389654700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:54,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:54,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:54,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021056856] [2024-10-12 20:23:54,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:54,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:54,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:54,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:54,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:54,749 INFO L87 Difference]: Start difference. First operand 30161 states and 45154 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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:23:55,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:55,203 INFO L93 Difference]: Finished difference Result 85360 states and 127209 transitions. [2024-10-12 20:23:55,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:55,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2024-10-12 20:23:55,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:55,330 INFO L225 Difference]: With dead ends: 85360 [2024-10-12 20:23:55,331 INFO L226 Difference]: Without dead ends: 56498 [2024-10-12 20:23:55,387 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:23:55,388 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 413 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:55,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1085 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:23:55,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56498 states. [2024-10-12 20:23:56,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56498 to 56496. [2024-10-12 20:23:56,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56496 states, 56495 states have (on average 1.4774404814585362) internal successors, (83468), 56495 states have internal predecessors, (83468), 0 states have call successors, (0), 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:23:57,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56496 states to 56496 states and 83468 transitions. [2024-10-12 20:23:57,064 INFO L78 Accepts]: Start accepts. Automaton has 56496 states and 83468 transitions. Word has length 145 [2024-10-12 20:23:57,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:57,064 INFO L471 AbstractCegarLoop]: Abstraction has 56496 states and 83468 transitions. [2024-10-12 20:23:57,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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:23:57,065 INFO L276 IsEmpty]: Start isEmpty. Operand 56496 states and 83468 transitions. [2024-10-12 20:23:57,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-12 20:23:57,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:57,133 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] [2024-10-12 20:23:57,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:23:57,134 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:57,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:57,134 INFO L85 PathProgramCache]: Analyzing trace with hash -18428589, now seen corresponding path program 1 times [2024-10-12 20:23:57,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:57,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81618294] [2024-10-12 20:23:57,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:57,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:57,239 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:23:57,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:57,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81618294] [2024-10-12 20:23:57,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81618294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:57,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:57,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:57,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767823697] [2024-10-12 20:23:57,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:57,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:57,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:57,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:57,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:57,242 INFO L87 Difference]: Start difference. First operand 56496 states and 83468 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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:23:57,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:57,933 INFO L93 Difference]: Finished difference Result 155710 states and 228153 transitions. [2024-10-12 20:23:57,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:57,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2024-10-12 20:23:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:58,440 INFO L225 Difference]: With dead ends: 155710 [2024-10-12 20:23:58,440 INFO L226 Difference]: Without dead ends: 104253 [2024-10-12 20:23:58,527 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:23:58,531 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 395 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:58,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1085 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:23:58,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104253 states. [2024-10-12 20:23:59,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104253 to 104251. [2024-10-12 20:23:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104251 states, 104250 states have (on average 1.4505323741007194) internal successors, (151218), 104250 states have internal predecessors, (151218), 0 states have call successors, (0), 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:24:00,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104251 states to 104251 states and 151218 transitions. [2024-10-12 20:24:00,227 INFO L78 Accepts]: Start accepts. Automaton has 104251 states and 151218 transitions. Word has length 145 [2024-10-12 20:24:00,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:00,227 INFO L471 AbstractCegarLoop]: Abstraction has 104251 states and 151218 transitions. [2024-10-12 20:24:00,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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:24:00,227 INFO L276 IsEmpty]: Start isEmpty. Operand 104251 states and 151218 transitions. [2024-10-12 20:24:00,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-12 20:24:00,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:00,358 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] [2024-10-12 20:24:00,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:24:00,359 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:24:00,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:00,359 INFO L85 PathProgramCache]: Analyzing trace with hash 928639658, now seen corresponding path program 1 times [2024-10-12 20:24:00,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:00,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155561238] [2024-10-12 20:24:00,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:00,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:00,725 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:24:00,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:00,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155561238] [2024-10-12 20:24:00,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155561238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:00,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:00,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:24:00,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193400416] [2024-10-12 20:24:00,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:00,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:24:00,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:00,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:24:00,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:24:00,731 INFO L87 Difference]: Start difference. First operand 104251 states and 151218 transitions. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 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:24:02,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:02,025 INFO L93 Difference]: Finished difference Result 178976 states and 256726 transitions. [2024-10-12 20:24:02,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:24:02,026 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2024-10-12 20:24:02,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:02,255 INFO L225 Difference]: With dead ends: 178976 [2024-10-12 20:24:02,255 INFO L226 Difference]: Without dead ends: 114412 [2024-10-12 20:24:02,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:24:02,345 INFO L432 NwaCegarLoop]: 1201 mSDtfsCounter, 2546 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2546 SdHoareTripleChecker+Valid, 2851 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:02,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2546 Valid, 2851 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:24:02,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114412 states. [2024-10-12 20:24:03,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114412 to 110117. [2024-10-12 20:24:03,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110117 states, 110116 states have (on average 1.4261960114788041) internal successors, (157047), 110116 states have internal predecessors, (157047), 0 states have call successors, (0), 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:24:04,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110117 states to 110117 states and 157047 transitions. [2024-10-12 20:24:04,162 INFO L78 Accepts]: Start accepts. Automaton has 110117 states and 157047 transitions. Word has length 145 [2024-10-12 20:24:04,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:04,162 INFO L471 AbstractCegarLoop]: Abstraction has 110117 states and 157047 transitions. [2024-10-12 20:24:04,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 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:24:04,163 INFO L276 IsEmpty]: Start isEmpty. Operand 110117 states and 157047 transitions. [2024-10-12 20:24:04,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-12 20:24:04,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:04,275 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] [2024-10-12 20:24:04,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:24:04,275 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:24:04,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:04,276 INFO L85 PathProgramCache]: Analyzing trace with hash -664074833, now seen corresponding path program 1 times [2024-10-12 20:24:04,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:04,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124460729] [2024-10-12 20:24:04,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:04,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:05,130 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:24:05,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:05,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124460729] [2024-10-12 20:24:05,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124460729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:05,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:05,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:24:05,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412193027] [2024-10-12 20:24:05,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:05,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:24:05,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:05,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:24:05,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:24:05,137 INFO L87 Difference]: Start difference. First operand 110117 states and 157047 transitions. Second operand has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 0 states have call successors, (0), 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:24:06,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:06,268 INFO L93 Difference]: Finished difference Result 255627 states and 368380 transitions. [2024-10-12 20:24:06,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:24:06,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2024-10-12 20:24:06,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:06,624 INFO L225 Difference]: With dead ends: 255627 [2024-10-12 20:24:06,624 INFO L226 Difference]: Without dead ends: 223262 [2024-10-12 20:24:06,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:24:06,723 INFO L432 NwaCegarLoop]: 931 mSDtfsCounter, 3520 mSDsluCounter, 3710 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3520 SdHoareTripleChecker+Valid, 4641 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:06,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3520 Valid, 4641 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:24:06,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223262 states. [2024-10-12 20:24:10,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223262 to 147122. [2024-10-12 20:24:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147122 states, 147121 states have (on average 1.4258603462456074) internal successors, (209774), 147121 states have internal predecessors, (209774), 0 states have call successors, (0), 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:24:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147122 states to 147122 states and 209774 transitions. [2024-10-12 20:24:10,390 INFO L78 Accepts]: Start accepts. Automaton has 147122 states and 209774 transitions. Word has length 148 [2024-10-12 20:24:10,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:10,391 INFO L471 AbstractCegarLoop]: Abstraction has 147122 states and 209774 transitions. [2024-10-12 20:24:10,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 0 states have call successors, (0), 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:24:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 147122 states and 209774 transitions. [2024-10-12 20:24:10,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-12 20:24:10,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:10,545 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] [2024-10-12 20:24:10,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:24:10,545 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:24:10,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:10,546 INFO L85 PathProgramCache]: Analyzing trace with hash -811059225, now seen corresponding path program 1 times [2024-10-12 20:24:10,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:10,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799066702] [2024-10-12 20:24:10,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:10,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:10,638 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:24:10,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:10,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799066702] [2024-10-12 20:24:10,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799066702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:10,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:10,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:24:10,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933667575] [2024-10-12 20:24:10,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:10,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:24:10,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:10,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:24:10,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:24:10,641 INFO L87 Difference]: Start difference. First operand 147122 states and 209774 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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:24:12,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:12,069 INFO L93 Difference]: Finished difference Result 195135 states and 277777 transitions. [2024-10-12 20:24:12,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:24:12,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2024-10-12 20:24:12,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:12,260 INFO L225 Difference]: With dead ends: 195135 [2024-10-12 20:24:12,261 INFO L226 Difference]: Without dead ends: 132420 [2024-10-12 20:24:12,328 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:24:12,329 INFO L432 NwaCegarLoop]: 875 mSDtfsCounter, 426 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:12,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1393 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:24:12,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132420 states. [2024-10-12 20:24:14,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132420 to 132338. [2024-10-12 20:24:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132338 states, 132337 states have (on average 1.4151371120699427) internal successors, (187275), 132337 states have internal predecessors, (187275), 0 states have call successors, (0), 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:24:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132338 states to 132338 states and 187275 transitions. [2024-10-12 20:24:14,898 INFO L78 Accepts]: Start accepts. Automaton has 132338 states and 187275 transitions. Word has length 148 [2024-10-12 20:24:14,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:14,898 INFO L471 AbstractCegarLoop]: Abstraction has 132338 states and 187275 transitions. [2024-10-12 20:24:14,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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:24:14,899 INFO L276 IsEmpty]: Start isEmpty. Operand 132338 states and 187275 transitions. [2024-10-12 20:24:15,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-12 20:24:15,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:15,040 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] [2024-10-12 20:24:15,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:24:15,041 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:24:15,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:15,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1695826264, now seen corresponding path program 1 times [2024-10-12 20:24:15,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:15,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458383743] [2024-10-12 20:24:15,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:15,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:15,252 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:24:15,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:15,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458383743] [2024-10-12 20:24:15,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458383743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:15,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:15,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:24:15,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701389579] [2024-10-12 20:24:15,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:15,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:24:15,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:15,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:24:15,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:24:15,254 INFO L87 Difference]: Start difference. First operand 132338 states and 187275 transitions. Second operand has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 0 states have call successors, (0), 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:24:16,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:16,681 INFO L93 Difference]: Finished difference Result 255763 states and 365372 transitions. [2024-10-12 20:24:16,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:24:16,681 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2024-10-12 20:24:16,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:16,986 INFO L225 Difference]: With dead ends: 255763 [2024-10-12 20:24:16,986 INFO L226 Difference]: Without dead ends: 226678 [2024-10-12 20:24:17,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:24:17,043 INFO L432 NwaCegarLoop]: 902 mSDtfsCounter, 3742 mSDsluCounter, 3281 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3742 SdHoareTripleChecker+Valid, 4183 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:17,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3742 Valid, 4183 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:24:17,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226678 states. [2024-10-12 20:24:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226678 to 164698. [2024-10-12 20:24:20,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164698 states, 164697 states have (on average 1.4154599051591712) internal successors, (233122), 164697 states have internal predecessors, (233122), 0 states have call successors, (0), 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:24:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164698 states to 164698 states and 233122 transitions. [2024-10-12 20:24:20,984 INFO L78 Accepts]: Start accepts. Automaton has 164698 states and 233122 transitions. Word has length 148 [2024-10-12 20:24:20,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:20,985 INFO L471 AbstractCegarLoop]: Abstraction has 164698 states and 233122 transitions. [2024-10-12 20:24:20,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 0 states have call successors, (0), 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:24:20,985 INFO L276 IsEmpty]: Start isEmpty. Operand 164698 states and 233122 transitions. [2024-10-12 20:24:21,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-12 20:24:21,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:21,154 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] [2024-10-12 20:24:21,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:24:21,154 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:24:21,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:21,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1976029291, now seen corresponding path program 1 times [2024-10-12 20:24:21,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:21,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011387557] [2024-10-12 20:24:21,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:21,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:21,247 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:24:21,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:21,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011387557] [2024-10-12 20:24:21,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011387557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:21,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:21,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:24:21,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444214938] [2024-10-12 20:24:21,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:21,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:24:21,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:21,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:24:21,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:24:21,250 INFO L87 Difference]: Start difference. First operand 164698 states and 233122 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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:24:22,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:22,798 INFO L93 Difference]: Finished difference Result 212314 states and 300174 transitions. [2024-10-12 20:24:22,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:24:22,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2024-10-12 20:24:22,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:22,990 INFO L225 Difference]: With dead ends: 212314 [2024-10-12 20:24:22,990 INFO L226 Difference]: Without dead ends: 151543 [2024-10-12 20:24:23,057 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:24:23,058 INFO L432 NwaCegarLoop]: 956 mSDtfsCounter, 407 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:23,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1474 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:24:23,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151543 states. [2024-10-12 20:24:25,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151543 to 151496. [2024-10-12 20:24:25,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151496 states, 151495 states have (on average 1.405234496187993) internal successors, (212886), 151495 states have internal predecessors, (212886), 0 states have call successors, (0), 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:24:25,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151496 states to 151496 states and 212886 transitions. [2024-10-12 20:24:25,909 INFO L78 Accepts]: Start accepts. Automaton has 151496 states and 212886 transitions. Word has length 148 [2024-10-12 20:24:25,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:25,910 INFO L471 AbstractCegarLoop]: Abstraction has 151496 states and 212886 transitions. [2024-10-12 20:24:25,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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:24:25,910 INFO L276 IsEmpty]: Start isEmpty. Operand 151496 states and 212886 transitions. [2024-10-12 20:24:26,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-12 20:24:26,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:26,068 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] [2024-10-12 20:24:26,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:24:26,069 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:24:26,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:26,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1197849445, now seen corresponding path program 1 times [2024-10-12 20:24:26,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:26,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924768483] [2024-10-12 20:24:26,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:26,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:26,187 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:24:26,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:26,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924768483] [2024-10-12 20:24:26,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924768483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:26,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:26,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:24:26,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577793329] [2024-10-12 20:24:26,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:26,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:24:26,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:26,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:24:26,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:24:26,189 INFO L87 Difference]: Start difference. First operand 151496 states and 212886 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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:24:28,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:28,165 INFO L93 Difference]: Finished difference Result 409369 states and 573544 transitions. [2024-10-12 20:24:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:24:28,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2024-10-12 20:24:28,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:28,547 INFO L225 Difference]: With dead ends: 409369 [2024-10-12 20:24:28,547 INFO L226 Difference]: Without dead ends: 268318 [2024-10-12 20:24:28,676 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:24:28,676 INFO L432 NwaCegarLoop]: 1051 mSDtfsCounter, 488 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:28,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1569 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:24:28,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268318 states. [2024-10-12 20:24:33,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268318 to 268271. [2024-10-12 20:24:33,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268271 states, 268270 states have (on average 1.389178812390502) internal successors, (372675), 268270 states have internal predecessors, (372675), 0 states have call successors, (0), 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:24:34,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268271 states to 268271 states and 372675 transitions. [2024-10-12 20:24:34,087 INFO L78 Accepts]: Start accepts. Automaton has 268271 states and 372675 transitions. Word has length 149 [2024-10-12 20:24:34,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:34,087 INFO L471 AbstractCegarLoop]: Abstraction has 268271 states and 372675 transitions. [2024-10-12 20:24:34,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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:24:34,088 INFO L276 IsEmpty]: Start isEmpty. Operand 268271 states and 372675 transitions. [2024-10-12 20:24:34,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-12 20:24:34,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:34,389 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] [2024-10-12 20:24:34,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:24:34,389 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:24:34,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:34,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1407730200, now seen corresponding path program 1 times [2024-10-12 20:24:34,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:34,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669255742] [2024-10-12 20:24:34,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:34,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:34,529 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:24:34,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:34,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669255742] [2024-10-12 20:24:34,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669255742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:34,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:34,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:24:34,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015487137] [2024-10-12 20:24:34,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:34,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:24:34,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:34,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:24:34,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:24:34,531 INFO L87 Difference]: Start difference. First operand 268271 states and 372675 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)