./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label01.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1d51b990e6445ed156c5ede746535f5b5f7ba06d95cc894d4b94049499df3553 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:57:37,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:57:37,793 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:57:37,797 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:57:37,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:57:37,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:57:37,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:57:37,835 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:57:37,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:57:37,836 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:57:37,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:57:37,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:57:37,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:57:37,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:57:37,840 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:57:37,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:57:37,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:57:37,841 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:57:37,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:57:37,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:57:37,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:57:37,846 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:57:37,847 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:57:37,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:57:37,847 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:57:37,847 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:57:37,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:57:37,848 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:57:37,848 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:57:37,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:57:37,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:57:37,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:57:37,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:57:37,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:57:37,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:57:37,850 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:57:37,850 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:57:37,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:57:37,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:57:37,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:57:37,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:57:37,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:57:37,853 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1d51b990e6445ed156c5ede746535f5b5f7ba06d95cc894d4b94049499df3553 [2024-10-11 04:57:38,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:57:38,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:57:38,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:57:38,173 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:57:38,173 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:57:38,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label01.c [2024-10-11 04:57:39,659 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:57:40,148 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:57:40,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label01.c [2024-10-11 04:57:40,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8a740c2df/05c91969815a464a967b58e11a7cc1d3/FLAGbe0efa1df [2024-10-11 04:57:40,212 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8a740c2df/05c91969815a464a967b58e11a7cc1d3 [2024-10-11 04:57:40,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:57:40,217 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:57:40,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:57:40,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:57:40,225 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:57:40,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:57:40" (1/1) ... [2024-10-11 04:57:40,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@729dbc96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:40, skipping insertion in model container [2024-10-11 04:57:40,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:57:40" (1/1) ... [2024-10-11 04:57:40,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:57:40,850 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/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label01.c[26860,26873] [2024-10-11 04:57:40,919 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/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label01.c[32415,32428] [2024-10-11 04:57:41,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:57:41,597 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:57:41,652 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/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label01.c[26860,26873] [2024-10-11 04:57:41,663 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/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label01.c[32415,32428] [2024-10-11 04:57:42,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:57:42,106 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:57:42,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:42 WrapperNode [2024-10-11 04:57:42,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:57:42,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:57:42,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:57:42,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:57:42,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:42" (1/1) ... [2024-10-11 04:57:42,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:42" (1/1) ... [2024-10-11 04:57:42,595 INFO L138 Inliner]: procedures = 39, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5293 [2024-10-11 04:57:42,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:57:42,597 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:57:42,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:57:42,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:57:42,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:42" (1/1) ... [2024-10-11 04:57:42,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:42" (1/1) ... [2024-10-11 04:57:42,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:42" (1/1) ... [2024-10-11 04:57:42,841 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-11 04:57:42,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:42" (1/1) ... [2024-10-11 04:57:42,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:42" (1/1) ... [2024-10-11 04:57:42,945 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:42" (1/1) ... [2024-10-11 04:57:42,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:42" (1/1) ... [2024-10-11 04:57:43,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:42" (1/1) ... [2024-10-11 04:57:43,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:42" (1/1) ... [2024-10-11 04:57:43,106 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:57:43,107 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:57:43,107 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:57:43,107 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:57:43,108 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:42" (1/1) ... [2024-10-11 04:57:43,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:57:43,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:57:43,143 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:57:43,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:57:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:57:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:57:43,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:57:43,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:57:43,520 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:57:43,522 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:57:48,318 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-10-11 04:57:48,319 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:57:48,398 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:57:48,399 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:57:48,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:57:48 BoogieIcfgContainer [2024-10-11 04:57:48,400 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:57:48,402 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:57:48,402 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:57:48,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:57:48,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:57:40" (1/3) ... [2024-10-11 04:57:48,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328ea8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:57:48, skipping insertion in model container [2024-10-11 04:57:48,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:42" (2/3) ... [2024-10-11 04:57:48,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328ea8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:57:48, skipping insertion in model container [2024-10-11 04:57:48,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:57:48" (3/3) ... [2024-10-11 04:57:48,408 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label01.c [2024-10-11 04:57:48,424 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:57:48,424 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:57:48,527 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:57:48,535 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;@401f1224, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:57:48,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:57:48,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 882 states, 879 states have (on average 1.9704209328782707) internal successors, (1732), 881 states have internal predecessors, (1732), 0 states have call successors, (0), 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-11 04:57:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 04:57:48,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:48,557 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] [2024-10-11 04:57:48,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:48,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:48,564 INFO L85 PathProgramCache]: Analyzing trace with hash -31988621, now seen corresponding path program 1 times [2024-10-11 04:57:48,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:48,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788325881] [2024-10-11 04:57:48,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:48,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:48,945 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-11 04:57:48,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:48,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788325881] [2024-10-11 04:57:48,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788325881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:48,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:48,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:57:48,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086472798] [2024-10-11 04:57:48,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:48,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 04:57:48,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:48,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 04:57:48,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:57:48,983 INFO L87 Difference]: Start difference. First operand has 882 states, 879 states have (on average 1.9704209328782707) internal successors, (1732), 881 states have internal predecessors, (1732), 0 states have call successors, (0), 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 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 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-11 04:57:49,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:49,085 INFO L93 Difference]: Finished difference Result 1699 states and 3336 transitions. [2024-10-11 04:57:49,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 04:57:49,088 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-10-11 04:57:49,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:49,107 INFO L225 Difference]: With dead ends: 1699 [2024-10-11 04:57:49,107 INFO L226 Difference]: Without dead ends: 878 [2024-10-11 04:57:49,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:57:49,119 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:49,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1661 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:57:49,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-10-11 04:57:49,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2024-10-11 04:57:49,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 876 states have (on average 1.8961187214611872) internal successors, (1661), 877 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:49,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1661 transitions. [2024-10-11 04:57:49,214 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1661 transitions. Word has length 27 [2024-10-11 04:57:49,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:49,215 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1661 transitions. [2024-10-11 04:57:49,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 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-11 04:57:49,215 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1661 transitions. [2024-10-11 04:57:49,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 04:57:49,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:49,221 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] [2024-10-11 04:57:49,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:57:49,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:49,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:49,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1837426955, now seen corresponding path program 1 times [2024-10-11 04:57:49,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:49,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738602212] [2024-10-11 04:57:49,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:49,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:49,466 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-11 04:57:49,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:49,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738602212] [2024-10-11 04:57:49,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738602212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:49,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:49,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:57:49,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070150894] [2024-10-11 04:57:49,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:49,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:57:49,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:49,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:57:49,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:57:49,472 INFO L87 Difference]: Start difference. First operand 878 states and 1661 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-11 04:57:49,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:49,608 INFO L93 Difference]: Finished difference Result 940 states and 1760 transitions. [2024-10-11 04:57:49,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:57:49,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-10-11 04:57:49,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:49,614 INFO L225 Difference]: With dead ends: 940 [2024-10-11 04:57:49,615 INFO L226 Difference]: Without dead ends: 878 [2024-10-11 04:57:49,616 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-11 04:57:49,617 INFO L432 NwaCegarLoop]: 1658 mSDtfsCounter, 0 mSDsluCounter, 3251 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4909 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:49,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4909 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:57:49,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-10-11 04:57:49,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2024-10-11 04:57:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 876 states have (on average 1.82648401826484) internal successors, (1600), 877 states have internal predecessors, (1600), 0 states have call successors, (0), 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-11 04:57:49,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1600 transitions. [2024-10-11 04:57:49,648 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1600 transitions. Word has length 27 [2024-10-11 04:57:49,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:49,649 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1600 transitions. [2024-10-11 04:57:49,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-11 04:57:49,649 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1600 transitions. [2024-10-11 04:57:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 04:57:49,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:49,652 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] [2024-10-11 04:57:49,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:57:49,653 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:49,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:49,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1474592282, now seen corresponding path program 1 times [2024-10-11 04:57:49,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:49,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299319067] [2024-10-11 04:57:49,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:49,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:49,779 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-11 04:57:49,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:49,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299319067] [2024-10-11 04:57:49,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299319067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:49,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:49,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:57:49,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567980328] [2024-10-11 04:57:49,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:49,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:49,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:49,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:49,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:49,785 INFO L87 Difference]: Start difference. First operand 878 states and 1600 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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-11 04:57:53,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:53,159 INFO L93 Difference]: Finished difference Result 2382 states and 4473 transitions. [2024-10-11 04:57:53,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:53,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-10-11 04:57:53,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:53,168 INFO L225 Difference]: With dead ends: 2382 [2024-10-11 04:57:53,168 INFO L226 Difference]: Without dead ends: 1629 [2024-10-11 04:57:53,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:53,171 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 929 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 3278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:53,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 235 Invalid, 3278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 04:57:53,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2024-10-11 04:57:53,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1629. [2024-10-11 04:57:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1627 states have (on average 1.8285187461585741) internal successors, (2975), 1628 states have internal predecessors, (2975), 0 states have call successors, (0), 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-11 04:57:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2975 transitions. [2024-10-11 04:57:53,217 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2975 transitions. Word has length 47 [2024-10-11 04:57:53,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:53,217 INFO L471 AbstractCegarLoop]: Abstraction has 1629 states and 2975 transitions. [2024-10-11 04:57:53,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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-11 04:57:53,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2975 transitions. [2024-10-11 04:57:53,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 04:57:53,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:53,220 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] [2024-10-11 04:57:53,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:57:53,221 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:53,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:53,222 INFO L85 PathProgramCache]: Analyzing trace with hash -470628699, now seen corresponding path program 1 times [2024-10-11 04:57:53,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:53,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572839809] [2024-10-11 04:57:53,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:53,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:53,624 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-11 04:57:53,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:53,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572839809] [2024-10-11 04:57:53,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572839809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:53,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:53,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:57:53,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108262165] [2024-10-11 04:57:53,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:53,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:57:53,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:53,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:57:53,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:57:53,627 INFO L87 Difference]: Start difference. First operand 1629 states and 2975 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 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-11 04:57:54,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:54,250 INFO L93 Difference]: Finished difference Result 2573 states and 4511 transitions. [2024-10-11 04:57:54,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 04:57:54,251 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-11 04:57:54,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:54,265 INFO L225 Difference]: With dead ends: 2573 [2024-10-11 04:57:54,265 INFO L226 Difference]: Without dead ends: 2514 [2024-10-11 04:57:54,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-10-11 04:57:54,270 INFO L432 NwaCegarLoop]: 1593 mSDtfsCounter, 13341 mSDsluCounter, 4679 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13341 SdHoareTripleChecker+Valid, 6272 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:54,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13341 Valid, 6272 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 04:57:54,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2024-10-11 04:57:54,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 1686. [2024-10-11 04:57:54,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1686 states, 1684 states have (on average 1.821852731591449) internal successors, (3068), 1685 states have internal predecessors, (3068), 0 states have call successors, (0), 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-11 04:57:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 3068 transitions. [2024-10-11 04:57:54,327 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 3068 transitions. Word has length 87 [2024-10-11 04:57:54,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:54,329 INFO L471 AbstractCegarLoop]: Abstraction has 1686 states and 3068 transitions. [2024-10-11 04:57:54,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 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-11 04:57:54,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 3068 transitions. [2024-10-11 04:57:54,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 04:57:54,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:54,332 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] [2024-10-11 04:57:54,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:57:54,332 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:54,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:54,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1442819851, now seen corresponding path program 1 times [2024-10-11 04:57:54,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:54,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351473304] [2024-10-11 04:57:54,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:54,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:54,490 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-11 04:57:54,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:54,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351473304] [2024-10-11 04:57:54,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351473304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:54,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:54,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:54,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530198610] [2024-10-11 04:57:54,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:54,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:54,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:54,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:54,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:54,493 INFO L87 Difference]: Start difference. First operand 1686 states and 3068 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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-11 04:57:54,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:54,536 INFO L93 Difference]: Finished difference Result 1907 states and 3427 transitions. [2024-10-11 04:57:54,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:54,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-10-11 04:57:54,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:54,544 INFO L225 Difference]: With dead ends: 1907 [2024-10-11 04:57:54,544 INFO L226 Difference]: Without dead ends: 1791 [2024-10-11 04:57:54,545 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-11 04:57:54,545 INFO L432 NwaCegarLoop]: 1595 mSDtfsCounter, 1504 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:54,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1685 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:57:54,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2024-10-11 04:57:54,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1789. [2024-10-11 04:57:54,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1787 states have (on average 1.8097369893676554) internal successors, (3234), 1788 states have internal predecessors, (3234), 0 states have call successors, (0), 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-11 04:57:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 3234 transitions. [2024-10-11 04:57:54,588 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 3234 transitions. Word has length 89 [2024-10-11 04:57:54,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:54,588 INFO L471 AbstractCegarLoop]: Abstraction has 1789 states and 3234 transitions. [2024-10-11 04:57:54,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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-11 04:57:54,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 3234 transitions. [2024-10-11 04:57:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 04:57:54,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:54,590 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] [2024-10-11 04:57:54,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:57:54,591 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:54,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:54,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1440674899, now seen corresponding path program 1 times [2024-10-11 04:57:54,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:54,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375958244] [2024-10-11 04:57:54,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:54,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:55,123 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-11 04:57:55,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:55,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375958244] [2024-10-11 04:57:55,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375958244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:55,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:55,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:57:55,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536142147] [2024-10-11 04:57:55,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:55,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:57:55,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:55,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:57:55,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:57:55,126 INFO L87 Difference]: Start difference. First operand 1789 states and 3234 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 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-11 04:57:55,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:55,653 INFO L93 Difference]: Finished difference Result 2010 states and 3590 transitions. [2024-10-11 04:57:55,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:57:55,655 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-10-11 04:57:55,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:55,666 INFO L225 Difference]: With dead ends: 2010 [2024-10-11 04:57:55,667 INFO L226 Difference]: Without dead ends: 1791 [2024-10-11 04:57:55,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:57:55,672 INFO L432 NwaCegarLoop]: 1587 mSDtfsCounter, 4596 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4596 SdHoareTripleChecker+Valid, 2234 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:55,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4596 Valid, 2234 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:57:55,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2024-10-11 04:57:55,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1789. [2024-10-11 04:57:55,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1787 states have (on average 1.8086177951874651) internal successors, (3232), 1788 states have internal predecessors, (3232), 0 states have call successors, (0), 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-11 04:57:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 3232 transitions. [2024-10-11 04:57:55,730 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 3232 transitions. Word has length 89 [2024-10-11 04:57:55,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:55,732 INFO L471 AbstractCegarLoop]: Abstraction has 1789 states and 3232 transitions. [2024-10-11 04:57:55,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 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-11 04:57:55,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 3232 transitions. [2024-10-11 04:57:55,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 04:57:55,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:55,736 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] [2024-10-11 04:57:55,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:57:55,736 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:55,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:55,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1840151110, now seen corresponding path program 1 times [2024-10-11 04:57:55,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:55,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258122056] [2024-10-11 04:57:55,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:55,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:55,980 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-11 04:57:55,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:55,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258122056] [2024-10-11 04:57:55,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258122056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:55,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:55,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:57:55,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371775566] [2024-10-11 04:57:55,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:55,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:57:55,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:55,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:57:55,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:57:55,985 INFO L87 Difference]: Start difference. First operand 1789 states and 3232 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 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-11 04:57:56,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:56,039 INFO L93 Difference]: Finished difference Result 1795 states and 3239 transitions. [2024-10-11 04:57:56,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:57:56,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-10-11 04:57:56,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:56,048 INFO L225 Difference]: With dead ends: 1795 [2024-10-11 04:57:56,048 INFO L226 Difference]: Without dead ends: 1793 [2024-10-11 04:57:56,049 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-11 04:57:56,050 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 0 mSDsluCounter, 3184 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4780 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:56,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4780 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:57:56,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2024-10-11 04:57:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1793. [2024-10-11 04:57:56,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1791 states have (on average 1.806253489670575) internal successors, (3235), 1792 states have internal predecessors, (3235), 0 states have call successors, (0), 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-11 04:57:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 3235 transitions. [2024-10-11 04:57:56,103 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 3235 transitions. Word has length 90 [2024-10-11 04:57:56,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:56,103 INFO L471 AbstractCegarLoop]: Abstraction has 1793 states and 3235 transitions. [2024-10-11 04:57:56,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 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-11 04:57:56,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 3235 transitions. [2024-10-11 04:57:56,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:56,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:56,105 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] [2024-10-11 04:57:56,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:57:56,105 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:56,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:56,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1591939181, now seen corresponding path program 1 times [2024-10-11 04:57:56,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:56,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614910459] [2024-10-11 04:57:56,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:56,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:56,216 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-11 04:57:56,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:56,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614910459] [2024-10-11 04:57:56,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614910459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:56,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:56,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:56,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142354519] [2024-10-11 04:57:56,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:56,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:56,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:56,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:56,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:56,219 INFO L87 Difference]: Start difference. First operand 1793 states and 3235 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:56,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:56,271 INFO L93 Difference]: Finished difference Result 2027 states and 3608 transitions. [2024-10-11 04:57:56,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:56,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:57:56,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:56,279 INFO L225 Difference]: With dead ends: 2027 [2024-10-11 04:57:56,279 INFO L226 Difference]: Without dead ends: 1907 [2024-10-11 04:57:56,280 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-11 04:57:56,281 INFO L432 NwaCegarLoop]: 1677 mSDtfsCounter, 1524 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:56,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1773 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:57:56,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2024-10-11 04:57:56,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1905. [2024-10-11 04:57:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1905 states, 1903 states have (on average 1.7929584866001052) internal successors, (3412), 1904 states have internal predecessors, (3412), 0 states have call successors, (0), 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-11 04:57:56,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 3412 transitions. [2024-10-11 04:57:56,338 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 3412 transitions. Word has length 91 [2024-10-11 04:57:56,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:56,338 INFO L471 AbstractCegarLoop]: Abstraction has 1905 states and 3412 transitions. [2024-10-11 04:57:56,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:56,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 3412 transitions. [2024-10-11 04:57:56,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:56,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:56,340 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] [2024-10-11 04:57:56,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:57:56,341 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:56,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:56,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1666551661, now seen corresponding path program 1 times [2024-10-11 04:57:56,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:56,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487678872] [2024-10-11 04:57:56,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:56,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:56,425 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-11 04:57:56,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:56,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487678872] [2024-10-11 04:57:56,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487678872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:56,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:56,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:56,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985527566] [2024-10-11 04:57:56,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:56,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:56,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:56,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:56,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:56,427 INFO L87 Difference]: Start difference. First operand 1905 states and 3412 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:56,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:56,478 INFO L93 Difference]: Finished difference Result 2547 states and 4432 transitions. [2024-10-11 04:57:56,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:56,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:57:56,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:56,487 INFO L225 Difference]: With dead ends: 2547 [2024-10-11 04:57:56,487 INFO L226 Difference]: Without dead ends: 2214 [2024-10-11 04:57:56,488 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-11 04:57:56,489 INFO L432 NwaCegarLoop]: 1679 mSDtfsCounter, 1522 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:56,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 1779 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:57:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2024-10-11 04:57:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 2212. [2024-10-11 04:57:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2212 states, 2210 states have (on average 1.7619909502262443) internal successors, (3894), 2211 states have internal predecessors, (3894), 0 states have call successors, (0), 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-11 04:57:56,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 2212 states and 3894 transitions. [2024-10-11 04:57:56,543 INFO L78 Accepts]: Start accepts. Automaton has 2212 states and 3894 transitions. Word has length 91 [2024-10-11 04:57:56,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:56,543 INFO L471 AbstractCegarLoop]: Abstraction has 2212 states and 3894 transitions. [2024-10-11 04:57:56,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:56,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 3894 transitions. [2024-10-11 04:57:56,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:56,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:56,544 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] [2024-10-11 04:57:56,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:57:56,545 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:56,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:56,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2011549037, now seen corresponding path program 1 times [2024-10-11 04:57:56,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:56,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802835300] [2024-10-11 04:57:56,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:56,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:56,621 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-11 04:57:56,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:56,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802835300] [2024-10-11 04:57:56,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802835300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:56,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:56,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:56,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389752151] [2024-10-11 04:57:56,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:56,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:56,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:56,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:56,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:56,623 INFO L87 Difference]: Start difference. First operand 2212 states and 3894 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:56,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:56,673 INFO L93 Difference]: Finished difference Result 3444 states and 5836 transitions. [2024-10-11 04:57:56,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:56,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:57:56,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:56,685 INFO L225 Difference]: With dead ends: 3444 [2024-10-11 04:57:56,685 INFO L226 Difference]: Without dead ends: 2804 [2024-10-11 04:57:56,686 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-11 04:57:56,687 INFO L432 NwaCegarLoop]: 1667 mSDtfsCounter, 1518 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:56,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 1775 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:57:56,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2804 states. [2024-10-11 04:57:56,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2804 to 2802. [2024-10-11 04:57:56,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2802 states, 2800 states have (on average 1.7178571428571427) internal successors, (4810), 2801 states have internal predecessors, (4810), 0 states have call successors, (0), 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-11 04:57:56,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 4810 transitions. [2024-10-11 04:57:56,764 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 4810 transitions. Word has length 91 [2024-10-11 04:57:56,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:56,765 INFO L471 AbstractCegarLoop]: Abstraction has 2802 states and 4810 transitions. [2024-10-11 04:57:56,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:56,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 4810 transitions. [2024-10-11 04:57:56,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:56,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:56,766 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] [2024-10-11 04:57:56,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:57:56,767 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:56,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:56,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1742965869, now seen corresponding path program 1 times [2024-10-11 04:57:56,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:56,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506611716] [2024-10-11 04:57:56,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:56,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:56,856 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-11 04:57:56,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:56,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506611716] [2024-10-11 04:57:56,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506611716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:56,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:56,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:56,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385803007] [2024-10-11 04:57:56,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:56,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:56,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:56,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:56,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:56,899 INFO L87 Difference]: Start difference. First operand 2802 states and 4810 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:56,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:56,969 INFO L93 Difference]: Finished difference Result 5166 states and 8500 transitions. [2024-10-11 04:57:56,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:56,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:57:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:56,985 INFO L225 Difference]: With dead ends: 5166 [2024-10-11 04:57:56,989 INFO L226 Difference]: Without dead ends: 3936 [2024-10-11 04:57:56,993 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-11 04:57:56,995 INFO L432 NwaCegarLoop]: 1665 mSDtfsCounter, 1516 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:56,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1777 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:57:57,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3936 states. [2024-10-11 04:57:57,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3936 to 3934. [2024-10-11 04:57:57,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3934 states, 3932 states have (on average 1.6648016276703967) internal successors, (6546), 3933 states have internal predecessors, (6546), 0 states have call successors, (0), 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-11 04:57:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3934 states to 3934 states and 6546 transitions. [2024-10-11 04:57:57,110 INFO L78 Accepts]: Start accepts. Automaton has 3934 states and 6546 transitions. Word has length 91 [2024-10-11 04:57:57,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:57,110 INFO L471 AbstractCegarLoop]: Abstraction has 3934 states and 6546 transitions. [2024-10-11 04:57:57,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:57,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3934 states and 6546 transitions. [2024-10-11 04:57:57,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:57,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:57,115 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] [2024-10-11 04:57:57,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:57:57,116 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:57,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:57,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1782909805, now seen corresponding path program 1 times [2024-10-11 04:57:57,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:57,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778689973] [2024-10-11 04:57:57,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:57,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:57,210 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-11 04:57:57,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:57,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778689973] [2024-10-11 04:57:57,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778689973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:57,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:57,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:57,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511083499] [2024-10-11 04:57:57,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:57,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:57,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:57,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:57,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:57,213 INFO L87 Difference]: Start difference. First operand 3934 states and 6546 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:57,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:57,320 INFO L93 Difference]: Finished difference Result 8466 states and 13540 transitions. [2024-10-11 04:57:57,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:57,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:57:57,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:57,335 INFO L225 Difference]: With dead ends: 8466 [2024-10-11 04:57:57,336 INFO L226 Difference]: Without dead ends: 6104 [2024-10-11 04:57:57,343 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-11 04:57:57,343 INFO L432 NwaCegarLoop]: 1663 mSDtfsCounter, 1514 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:57,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1779 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:57:57,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6104 states. [2024-10-11 04:57:57,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6104 to 6102. [2024-10-11 04:57:57,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6102 states, 6100 states have (on average 1.6108196721311476) internal successors, (9826), 6101 states have internal predecessors, (9826), 0 states have call successors, (0), 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-11 04:57:57,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6102 states to 6102 states and 9826 transitions. [2024-10-11 04:57:57,539 INFO L78 Accepts]: Start accepts. Automaton has 6102 states and 9826 transitions. Word has length 91 [2024-10-11 04:57:57,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:57,540 INFO L471 AbstractCegarLoop]: Abstraction has 6102 states and 9826 transitions. [2024-10-11 04:57:57,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:57,541 INFO L276 IsEmpty]: Start isEmpty. Operand 6102 states and 9826 transitions. [2024-10-11 04:57:57,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:57,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:57,542 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] [2024-10-11 04:57:57,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:57:57,542 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:57,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:57,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1157253741, now seen corresponding path program 1 times [2024-10-11 04:57:57,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:57,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562813117] [2024-10-11 04:57:57,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:57,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:57,648 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-11 04:57:57,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:57,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562813117] [2024-10-11 04:57:57,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562813117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:57,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:57,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:57,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324789531] [2024-10-11 04:57:57,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:57,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:57,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:57,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:57,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:57,650 INFO L87 Difference]: Start difference. First operand 6102 states and 9826 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:57,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:57,841 INFO L93 Difference]: Finished difference Result 14778 states and 23044 transitions. [2024-10-11 04:57:57,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:57,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:57:57,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:57,867 INFO L225 Difference]: With dead ends: 14778 [2024-10-11 04:57:57,868 INFO L226 Difference]: Without dead ends: 10248 [2024-10-11 04:57:57,878 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-11 04:57:57,880 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 1512 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:57,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1781 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:57:57,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10248 states. [2024-10-11 04:57:58,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10248 to 10246. [2024-10-11 04:57:58,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10246 states, 10244 states have (on average 1.5620851229988286) internal successors, (16002), 10245 states have internal predecessors, (16002), 0 states have call successors, (0), 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-11 04:57:58,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10246 states to 10246 states and 16002 transitions. [2024-10-11 04:57:58,313 INFO L78 Accepts]: Start accepts. Automaton has 10246 states and 16002 transitions. Word has length 91 [2024-10-11 04:57:58,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:58,313 INFO L471 AbstractCegarLoop]: Abstraction has 10246 states and 16002 transitions. [2024-10-11 04:57:58,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:58,314 INFO L276 IsEmpty]: Start isEmpty. Operand 10246 states and 16002 transitions. [2024-10-11 04:57:58,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:58,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:58,315 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] [2024-10-11 04:57:58,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:57:58,315 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:58,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:58,316 INFO L85 PathProgramCache]: Analyzing trace with hash 2045987181, now seen corresponding path program 1 times [2024-10-11 04:57:58,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:58,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395249500] [2024-10-11 04:57:58,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:58,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:58,453 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-11 04:57:58,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:58,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395249500] [2024-10-11 04:57:58,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395249500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:58,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:58,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:58,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755461059] [2024-10-11 04:57:58,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:58,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:58,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:58,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:58,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:58,455 INFO L87 Difference]: Start difference. First operand 10246 states and 16002 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:58,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:58,773 INFO L93 Difference]: Finished difference Result 26826 states and 40900 transitions. [2024-10-11 04:57:58,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:58,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:57:58,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:58,817 INFO L225 Difference]: With dead ends: 26826 [2024-10-11 04:57:58,817 INFO L226 Difference]: Without dead ends: 18152 [2024-10-11 04:57:58,837 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-11 04:57:58,838 INFO L432 NwaCegarLoop]: 1659 mSDtfsCounter, 1510 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:58,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1783 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:57:58,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18152 states. [2024-10-11 04:57:59,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18152 to 18150. [2024-10-11 04:57:59,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18150 states, 18148 states have (on average 1.5200573065902578) internal successors, (27586), 18149 states have internal predecessors, (27586), 0 states have call successors, (0), 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-11 04:57:59,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18150 states to 18150 states and 27586 transitions. [2024-10-11 04:57:59,557 INFO L78 Accepts]: Start accepts. Automaton has 18150 states and 27586 transitions. Word has length 91 [2024-10-11 04:57:59,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:59,557 INFO L471 AbstractCegarLoop]: Abstraction has 18150 states and 27586 transitions. [2024-10-11 04:57:59,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:59,558 INFO L276 IsEmpty]: Start isEmpty. Operand 18150 states and 27586 transitions. [2024-10-11 04:57:59,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:59,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:59,559 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] [2024-10-11 04:57:59,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:57:59,559 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:59,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:59,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1873031571, now seen corresponding path program 1 times [2024-10-11 04:57:59,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:59,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299519230] [2024-10-11 04:57:59,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:59,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:59,649 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-11 04:57:59,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:59,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299519230] [2024-10-11 04:57:59,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299519230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:59,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:59,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:59,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403432286] [2024-10-11 04:57:59,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:59,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:59,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:59,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:59,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:59,652 INFO L87 Difference]: Start difference. First operand 18150 states and 27586 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:58:00,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:00,416 INFO L93 Difference]: Finished difference Result 49770 states and 74308 transitions. [2024-10-11 04:58:00,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:58:00,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:58:00,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:00,484 INFO L225 Difference]: With dead ends: 49770 [2024-10-11 04:58:00,484 INFO L226 Difference]: Without dead ends: 33192 [2024-10-11 04:58:00,513 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-11 04:58:00,514 INFO L432 NwaCegarLoop]: 1677 mSDtfsCounter, 1520 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:58:00,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 1781 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:58:00,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33192 states. [2024-10-11 04:58:01,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33192 to 33190. [2024-10-11 04:58:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33190 states, 33188 states have (on average 1.4830059057490659) internal successors, (49218), 33189 states have internal predecessors, (49218), 0 states have call successors, (0), 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-11 04:58:01,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33190 states to 33190 states and 49218 transitions. [2024-10-11 04:58:01,913 INFO L78 Accepts]: Start accepts. Automaton has 33190 states and 49218 transitions. Word has length 91 [2024-10-11 04:58:01,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:58:01,914 INFO L471 AbstractCegarLoop]: Abstraction has 33190 states and 49218 transitions. [2024-10-11 04:58:01,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:58:01,914 INFO L276 IsEmpty]: Start isEmpty. Operand 33190 states and 49218 transitions. [2024-10-11 04:58:01,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 04:58:01,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:01,923 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:58:01,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:58:01,924 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:01,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:01,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1900714775, now seen corresponding path program 1 times [2024-10-11 04:58:01,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:01,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315528177] [2024-10-11 04:58:01,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:01,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:02,263 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:58:02,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:02,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315528177] [2024-10-11 04:58:02,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315528177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:02,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:02,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:58:02,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835720853] [2024-10-11 04:58:02,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:02,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:58:02,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:02,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:58:02,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:58:02,266 INFO L87 Difference]: Start difference. First operand 33190 states and 49218 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 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-11 04:58:07,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:07,017 INFO L93 Difference]: Finished difference Result 282808 states and 414923 transitions. [2024-10-11 04:58:07,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:58:07,018 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 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 115 [2024-10-11 04:58:07,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:08,000 INFO L225 Difference]: With dead ends: 282808 [2024-10-11 04:58:08,001 INFO L226 Difference]: Without dead ends: 260790 [2024-10-11 04:58:08,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:58:08,141 INFO L432 NwaCegarLoop]: 1693 mSDtfsCounter, 11680 mSDsluCounter, 3496 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11680 SdHoareTripleChecker+Valid, 5189 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:58:08,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11680 Valid, 5189 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:58:08,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260790 states. [2024-10-11 04:58:11,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260790 to 60070. [2024-10-11 04:58:11,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60070 states, 60068 states have (on average 1.4693014583472066) internal successors, (88258), 60069 states have internal predecessors, (88258), 0 states have call successors, (0), 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-11 04:58:11,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60070 states to 60070 states and 88258 transitions. [2024-10-11 04:58:11,820 INFO L78 Accepts]: Start accepts. Automaton has 60070 states and 88258 transitions. Word has length 115 [2024-10-11 04:58:11,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:58:11,823 INFO L471 AbstractCegarLoop]: Abstraction has 60070 states and 88258 transitions. [2024-10-11 04:58:11,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 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-11 04:58:11,823 INFO L276 IsEmpty]: Start isEmpty. Operand 60070 states and 88258 transitions. [2024-10-11 04:58:11,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 04:58:11,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:11,834 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:58:11,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 04:58:11,835 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:11,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:11,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1975327255, now seen corresponding path program 1 times [2024-10-11 04:58:11,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:11,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469269934] [2024-10-11 04:58:11,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:11,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:12,392 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 04:58:12,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:12,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469269934] [2024-10-11 04:58:12,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469269934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:12,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:12,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:58:12,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055697511] [2024-10-11 04:58:12,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:12,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:58:12,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:12,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:58:12,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:58:12,395 INFO L87 Difference]: Start difference. First operand 60070 states and 88258 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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-11 04:58:18,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:18,210 INFO L93 Difference]: Finished difference Result 314424 states and 461003 transitions. [2024-10-11 04:58:18,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:58:18,210 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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 115 [2024-10-11 04:58:18,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:19,149 INFO L225 Difference]: With dead ends: 314424 [2024-10-11 04:58:19,149 INFO L226 Difference]: Without dead ends: 282806 [2024-10-11 04:58:19,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:58:19,233 INFO L432 NwaCegarLoop]: 1692 mSDtfsCounter, 11682 mSDsluCounter, 3456 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11682 SdHoareTripleChecker+Valid, 5148 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:58:19,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11682 Valid, 5148 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:58:19,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282806 states. [2024-10-11 04:58:23,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282806 to 102694. [2024-10-11 04:58:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102694 states, 102692 states have (on average 1.4614770381334476) internal successors, (150082), 102693 states have internal predecessors, (150082), 0 states have call successors, (0), 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-11 04:58:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102694 states to 102694 states and 150082 transitions. [2024-10-11 04:58:24,308 INFO L78 Accepts]: Start accepts. Automaton has 102694 states and 150082 transitions. Word has length 115 [2024-10-11 04:58:24,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:58:24,309 INFO L471 AbstractCegarLoop]: Abstraction has 102694 states and 150082 transitions. [2024-10-11 04:58:24,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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-11 04:58:24,309 INFO L276 IsEmpty]: Start isEmpty. Operand 102694 states and 150082 transitions. [2024-10-11 04:58:24,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 04:58:24,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:24,321 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:58:24,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 04:58:24,321 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:24,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:24,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1974642665, now seen corresponding path program 1 times [2024-10-11 04:58:24,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:24,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965214754] [2024-10-11 04:58:24,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:24,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:24,943 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 04:58:24,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:24,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965214754] [2024-10-11 04:58:24,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965214754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:24,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:24,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:58:24,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391762263] [2024-10-11 04:58:24,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:24,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:58:24,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:24,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:58:24,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:58:24,946 INFO L87 Difference]: Start difference. First operand 102694 states and 150082 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 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-11 04:58:31,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:31,937 INFO L93 Difference]: Finished difference Result 346040 states and 506955 transitions. [2024-10-11 04:58:31,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:58:31,938 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 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 115 [2024-10-11 04:58:31,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:32,463 INFO L225 Difference]: With dead ends: 346040 [2024-10-11 04:58:32,464 INFO L226 Difference]: Without dead ends: 314422 [2024-10-11 04:58:32,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:58:32,554 INFO L432 NwaCegarLoop]: 1690 mSDtfsCounter, 11722 mSDsluCounter, 3485 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11722 SdHoareTripleChecker+Valid, 5175 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:58:32,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11722 Valid, 5175 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:58:32,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314422 states. [2024-10-11 04:58:38,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314422 to 134310. [2024-10-11 04:58:38,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134310 states, 134308 states have (on average 1.459585430503023) internal successors, (196034), 134309 states have internal predecessors, (196034), 0 states have call successors, (0), 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-11 04:58:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134310 states to 134310 states and 196034 transitions. [2024-10-11 04:58:39,106 INFO L78 Accepts]: Start accepts. Automaton has 134310 states and 196034 transitions. Word has length 115 [2024-10-11 04:58:39,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:58:39,107 INFO L471 AbstractCegarLoop]: Abstraction has 134310 states and 196034 transitions. [2024-10-11 04:58:39,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 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-11 04:58:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 134310 states and 196034 transitions. [2024-10-11 04:58:39,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 04:58:39,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:39,119 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:58:39,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 04:58:39,120 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:39,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:39,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2051741463, now seen corresponding path program 1 times [2024-10-11 04:58:39,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:39,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233313046] [2024-10-11 04:58:39,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:39,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:39,437 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 04:58:39,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:39,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233313046] [2024-10-11 04:58:39,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233313046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:39,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:39,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:58:39,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851965282] [2024-10-11 04:58:39,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:39,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:58:39,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:39,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:58:39,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:58:39,441 INFO L87 Difference]: Start difference. First operand 134310 states and 196034 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)