./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b8e4f57289bafd3f29582b11c1ea3d32af0aa4d03b738aef04f29eb11d15fcf --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 17:12:25,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:12:25,818 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:12:25,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:12:25,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:12:25,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:12:25,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:12:25,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:12:25,854 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:12:25,854 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:12:25,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:12:25,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:12:25,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:12:25,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:12:25,856 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:12:25,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:12:25,856 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:12:25,856 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:12:25,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:12:25,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:12:25,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:12:25,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:12:25,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:12:25,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:12:25,862 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:12:25,862 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:12:25,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:12:25,862 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:12:25,862 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:12:25,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:12:25,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:12:25,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:12:25,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:12:25,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:12:25,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:12:25,863 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:12:25,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:12:25,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:12:25,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:12:25,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:12:25,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:12:25,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:12:25,865 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b8e4f57289bafd3f29582b11c1ea3d32af0aa4d03b738aef04f29eb11d15fcf [2024-11-08 17:12:26,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:12:26,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:12:26,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:12:26,082 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:12:26,083 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:12:26,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-08 17:12:27,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:12:27,612 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:12:27,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-08 17:12:27,643 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d33b2c44f/06c0d105c4fb487894de0722431636a2/FLAG494346ab2 [2024-11-08 17:12:27,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d33b2c44f/06c0d105c4fb487894de0722431636a2 [2024-11-08 17:12:27,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:12:27,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:12:27,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:12:27,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:12:27,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:12:27,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:12:27" (1/1) ... [2024-11-08 17:12:27,856 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2df54f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:27, skipping insertion in model container [2024-11-08 17:12:27,856 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:12:27" (1/1) ... [2024-11-08 17:12:27,962 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:12:28,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.c[26888,26901] [2024-11-08 17:12:28,277 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.c[34636,34649] [2024-11-08 17:12:28,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:12:28,765 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:12:28,799 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.c[26888,26901] [2024-11-08 17:12:28,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.c[34636,34649] [2024-11-08 17:12:29,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:12:29,132 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:12:29,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:29 WrapperNode [2024-11-08 17:12:29,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:12:29,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:12:29,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:12:29,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:12:29,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:29" (1/1) ... [2024-11-08 17:12:29,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:29" (1/1) ... [2024-11-08 17:12:29,443 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5291 [2024-11-08 17:12:29,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:12:29,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:12:29,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:12:29,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:12:29,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:29" (1/1) ... [2024-11-08 17:12:29,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:29" (1/1) ... [2024-11-08 17:12:29,493 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:29" (1/1) ... [2024-11-08 17:12:29,665 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 17:12:29,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:29" (1/1) ... [2024-11-08 17:12:29,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:29" (1/1) ... [2024-11-08 17:12:29,785 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:29" (1/1) ... [2024-11-08 17:12:29,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:29" (1/1) ... [2024-11-08 17:12:29,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:29" (1/1) ... [2024-11-08 17:12:29,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:29" (1/1) ... [2024-11-08 17:12:29,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:12:29,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:12:29,887 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:12:29,887 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:12:29,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:29" (1/1) ... [2024-11-08 17:12:29,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:12:29,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 17:12:29,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:12:29,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:12:29,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:12:29,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:12:29,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:12:29,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:12:30,074 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:12:30,076 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:12:33,213 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-11-08 17:12:33,213 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:12:33,241 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:12:33,245 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 17:12:33,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:12:33 BoogieIcfgContainer [2024-11-08 17:12:33,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:12:33,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:12:33,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:12:33,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:12:33,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:12:27" (1/3) ... [2024-11-08 17:12:33,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75461d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:12:33, skipping insertion in model container [2024-11-08 17:12:33,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:29" (2/3) ... [2024-11-08 17:12:33,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75461d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:12:33, skipping insertion in model container [2024-11-08 17:12:33,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:12:33" (3/3) ... [2024-11-08 17:12:33,252 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-08 17:12:33,263 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:12:33,263 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 17:12:33,331 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:12:33,337 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;@7b71a4d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:12:33,337 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-08 17:12:33,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 949 states, 946 states have (on average 1.9027484143763214) internal successors, (1800), 948 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:33,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 17:12:33,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:33,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:12:33,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:33,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:33,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1967767115, now seen corresponding path program 1 times [2024-11-08 17:12:33,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:33,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973951864] [2024-11-08 17:12:33,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:33,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:33,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:12:33,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:33,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973951864] [2024-11-08 17:12:33,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973951864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:33,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:33,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:12:33,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412224034] [2024-11-08 17:12:33,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:33,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:12:33,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:33,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:12:33,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:12:33,668 INFO L87 Difference]: Start difference. First operand has 949 states, 946 states have (on average 1.9027484143763214) internal successors, (1800), 948 states have internal predecessors, (1800), 0 states have call successors, (0), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:33,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:33,744 INFO L93 Difference]: Finished difference Result 1829 states and 3468 transitions. [2024-11-08 17:12:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:12:33,746 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-08 17:12:33,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:33,764 INFO L225 Difference]: With dead ends: 1829 [2024-11-08 17:12:33,764 INFO L226 Difference]: Without dead ends: 883 [2024-11-08 17:12:33,768 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-11-08 17:12:33,770 INFO L432 NwaCegarLoop]: 1731 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:33,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:12:33,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-11-08 17:12:33,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2024-11-08 17:12:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.8921679909194098) internal successors, (1667), 882 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:33,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1667 transitions. [2024-11-08 17:12:33,830 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1667 transitions. Word has length 30 [2024-11-08 17:12:33,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:33,830 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1667 transitions. [2024-11-08 17:12:33,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:33,830 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1667 transitions. [2024-11-08 17:12:33,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 17:12:33,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:33,831 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] [2024-11-08 17:12:33,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:12:33,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:33,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:33,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2101780621, now seen corresponding path program 1 times [2024-11-08 17:12:33,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:33,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182553061] [2024-11-08 17:12:33,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:33,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:12:34,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:34,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182553061] [2024-11-08 17:12:34,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182553061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:34,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:34,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:12:34,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966722959] [2024-11-08 17:12:34,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:34,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:12:34,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:34,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:12:34,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:12:34,043 INFO L87 Difference]: Start difference. First operand 883 states and 1667 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:34,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:34,171 INFO L93 Difference]: Finished difference Result 949 states and 1771 transitions. [2024-11-08 17:12:34,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:12:34,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-08 17:12:34,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:34,178 INFO L225 Difference]: With dead ends: 949 [2024-11-08 17:12:34,178 INFO L226 Difference]: Without dead ends: 883 [2024-11-08 17:12:34,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:12:34,180 INFO L432 NwaCegarLoop]: 1665 mSDtfsCounter, 0 mSDsluCounter, 4929 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6594 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-11-08 17:12:34,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6594 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:12:34,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-11-08 17:12:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2024-11-08 17:12:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.8229284903518728) internal successors, (1606), 882 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1606 transitions. [2024-11-08 17:12:34,202 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1606 transitions. Word has length 30 [2024-11-08 17:12:34,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:34,202 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1606 transitions. [2024-11-08 17:12:34,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1606 transitions. [2024-11-08 17:12:34,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 17:12:34,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:34,204 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] [2024-11-08 17:12:34,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:12:34,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:34,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:34,208 INFO L85 PathProgramCache]: Analyzing trace with hash -25756829, now seen corresponding path program 1 times [2024-11-08 17:12:34,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:34,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037208870] [2024-11-08 17:12:34,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:34,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:12:34,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:34,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037208870] [2024-11-08 17:12:34,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037208870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:34,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:34,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:12:34,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886504958] [2024-11-08 17:12:34,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:34,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:12:34,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:34,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:12:34,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:12:34,429 INFO L87 Difference]: Start difference. First operand 883 states and 1606 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:39,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:39,011 INFO L93 Difference]: Finished difference Result 3138 states and 5915 transitions. [2024-11-08 17:12:39,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:12:39,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-11-08 17:12:39,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:39,020 INFO L225 Difference]: With dead ends: 3138 [2024-11-08 17:12:39,020 INFO L226 Difference]: Without dead ends: 2385 [2024-11-08 17:12:39,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:12:39,022 INFO L432 NwaCegarLoop]: 860 mSDtfsCounter, 2519 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2519 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 6399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:39,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2519 Valid, 878 Invalid, 6399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-08 17:12:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2024-11-08 17:12:39,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2385. [2024-11-08 17:12:39,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2385 states, 2383 states have (on average 1.503147293327738) internal successors, (3582), 2384 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:39,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 3582 transitions. [2024-11-08 17:12:39,072 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 3582 transitions. Word has length 67 [2024-11-08 17:12:39,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:39,072 INFO L471 AbstractCegarLoop]: Abstraction has 2385 states and 3582 transitions. [2024-11-08 17:12:39,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:39,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 3582 transitions. [2024-11-08 17:12:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 17:12:39,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:39,074 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-11-08 17:12:39,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:12:39,075 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:39,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:39,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1651582301, now seen corresponding path program 1 times [2024-11-08 17:12:39,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:39,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357401037] [2024-11-08 17:12:39,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:39,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:39,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:12:39,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:39,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357401037] [2024-11-08 17:12:39,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357401037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:39,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:39,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:12:39,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967024665] [2024-11-08 17:12:39,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:39,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:12:39,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:39,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:12:39,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:12:39,374 INFO L87 Difference]: Start difference. First operand 2385 states and 3582 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 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-11-08 17:12:39,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:39,752 INFO L93 Difference]: Finished difference Result 3377 states and 5182 transitions. [2024-11-08 17:12:39,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:12:39,753 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 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-11-08 17:12:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:39,762 INFO L225 Difference]: With dead ends: 3377 [2024-11-08 17:12:39,762 INFO L226 Difference]: Without dead ends: 3315 [2024-11-08 17:12:39,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-08 17:12:39,764 INFO L432 NwaCegarLoop]: 1600 mSDtfsCounter, 13578 mSDsluCounter, 3975 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13578 SdHoareTripleChecker+Valid, 5575 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:39,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13578 Valid, 5575 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:12:39,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3315 states. [2024-11-08 17:12:39,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3315 to 2445. [2024-11-08 17:12:39,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2445 states, 2443 states have (on average 1.5059353254195662) internal successors, (3679), 2444 states have internal predecessors, (3679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:39,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 3679 transitions. [2024-11-08 17:12:39,802 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 3679 transitions. Word has length 90 [2024-11-08 17:12:39,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:39,802 INFO L471 AbstractCegarLoop]: Abstraction has 2445 states and 3679 transitions. [2024-11-08 17:12:39,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 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-11-08 17:12:39,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3679 transitions. [2024-11-08 17:12:39,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 17:12:39,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:39,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:12:39,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:12:39,805 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:39,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:39,805 INFO L85 PathProgramCache]: Analyzing trace with hash 551619955, now seen corresponding path program 1 times [2024-11-08 17:12:39,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:39,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13117462] [2024-11-08 17:12:39,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:39,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:39,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:12:39,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:39,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13117462] [2024-11-08 17:12:39,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13117462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:39,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:39,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:12:39,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062286842] [2024-11-08 17:12:39,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:39,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:12:39,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:39,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:12:39,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:12:39,922 INFO L87 Difference]: Start difference. First operand 2445 states and 3679 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:39,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:39,961 INFO L93 Difference]: Finished difference Result 2678 states and 4054 transitions. [2024-11-08 17:12:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:12:39,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-11-08 17:12:39,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:39,969 INFO L225 Difference]: With dead ends: 2678 [2024-11-08 17:12:39,970 INFO L226 Difference]: Without dead ends: 2556 [2024-11-08 17:12:39,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:12:39,971 INFO L432 NwaCegarLoop]: 1602 mSDtfsCounter, 1508 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:39,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1695 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:12:39,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2024-11-08 17:12:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2552. [2024-11-08 17:12:40,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2550 states have (on average 1.5094117647058825) internal successors, (3849), 2551 states have internal predecessors, (3849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:40,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3849 transitions. [2024-11-08 17:12:40,012 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3849 transitions. Word has length 92 [2024-11-08 17:12:40,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:40,013 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3849 transitions. [2024-11-08 17:12:40,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:40,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3849 transitions. [2024-11-08 17:12:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 17:12:40,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:40,016 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:12:40,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:12:40,016 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:40,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:40,017 INFO L85 PathProgramCache]: Analyzing trace with hash 618113467, now seen corresponding path program 1 times [2024-11-08 17:12:40,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:40,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321632410] [2024-11-08 17:12:40,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:40,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:40,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:12:40,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:40,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321632410] [2024-11-08 17:12:40,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321632410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:40,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:40,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:12:40,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58196292] [2024-11-08 17:12:40,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:40,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:12:40,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:40,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:12:40,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:12:40,394 INFO L87 Difference]: Start difference. First operand 2552 states and 3849 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:40,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:40,721 INFO L93 Difference]: Finished difference Result 2783 states and 4217 transitions. [2024-11-08 17:12:40,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:12:40,722 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-11-08 17:12:40,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:40,728 INFO L225 Difference]: With dead ends: 2783 [2024-11-08 17:12:40,729 INFO L226 Difference]: Without dead ends: 2554 [2024-11-08 17:12:40,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:12:40,730 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 4611 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4611 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:40,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4611 Valid, 2281 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:12:40,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2024-11-08 17:12:40,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2552. [2024-11-08 17:12:40,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2550 states have (on average 1.508627450980392) internal successors, (3847), 2551 states have internal predecessors, (3847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:40,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3847 transitions. [2024-11-08 17:12:40,771 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3847 transitions. Word has length 92 [2024-11-08 17:12:40,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:40,772 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3847 transitions. [2024-11-08 17:12:40,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:40,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3847 transitions. [2024-11-08 17:12:40,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 17:12:40,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:40,773 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:12:40,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:12:40,774 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:40,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:40,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1566925479, now seen corresponding path program 1 times [2024-11-08 17:12:40,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:40,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394256879] [2024-11-08 17:12:40,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:40,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:41,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:12:41,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:41,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394256879] [2024-11-08 17:12:41,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394256879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:41,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:41,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:12:41,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61770301] [2024-11-08 17:12:41,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:41,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:12:41,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:41,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:12:41,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:12:41,011 INFO L87 Difference]: Start difference. First operand 2552 states and 3847 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:41,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:41,047 INFO L93 Difference]: Finished difference Result 2560 states and 3856 transitions. [2024-11-08 17:12:41,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:12:41,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-11-08 17:12:41,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:41,054 INFO L225 Difference]: With dead ends: 2560 [2024-11-08 17:12:41,054 INFO L226 Difference]: Without dead ends: 2558 [2024-11-08 17:12:41,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:12:41,056 INFO L432 NwaCegarLoop]: 1603 mSDtfsCounter, 0 mSDsluCounter, 4800 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6403 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:41,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6403 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:12:41,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2024-11-08 17:12:41,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2558. [2024-11-08 17:12:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2556 states have (on average 1.5070422535211268) internal successors, (3852), 2557 states have internal predecessors, (3852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:41,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3852 transitions. [2024-11-08 17:12:41,089 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3852 transitions. Word has length 93 [2024-11-08 17:12:41,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:41,090 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 3852 transitions. [2024-11-08 17:12:41,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:41,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3852 transitions. [2024-11-08 17:12:41,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 17:12:41,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:41,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:12:41,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:12:41,093 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:41,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:41,094 INFO L85 PathProgramCache]: Analyzing trace with hash -401487589, now seen corresponding path program 1 times [2024-11-08 17:12:41,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:41,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008484481] [2024-11-08 17:12:41,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:41,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:12:41,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:41,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008484481] [2024-11-08 17:12:41,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008484481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:41,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:41,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:12:41,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782991638] [2024-11-08 17:12:41,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:41,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:12:41,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:41,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:12:41,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:12:41,156 INFO L87 Difference]: Start difference. First operand 2558 states and 3852 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:41,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:41,184 INFO L93 Difference]: Finished difference Result 3012 states and 4564 transitions. [2024-11-08 17:12:41,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:12:41,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-08 17:12:41,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:41,192 INFO L225 Difference]: With dead ends: 3012 [2024-11-08 17:12:41,192 INFO L226 Difference]: Without dead ends: 2777 [2024-11-08 17:12:41,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:12:41,193 INFO L432 NwaCegarLoop]: 1683 mSDtfsCounter, 1527 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:41,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 1788 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:12:41,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2024-11-08 17:12:41,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2775. [2024-11-08 17:12:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2775 states, 2773 states have (on average 1.5106382978723405) internal successors, (4189), 2774 states have internal predecessors, (4189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 4189 transitions. [2024-11-08 17:12:41,231 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 4189 transitions. Word has length 94 [2024-11-08 17:12:41,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:41,231 INFO L471 AbstractCegarLoop]: Abstraction has 2775 states and 4189 transitions. [2024-11-08 17:12:41,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:41,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 4189 transitions. [2024-11-08 17:12:41,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 17:12:41,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:41,233 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:12:41,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:12:41,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:41,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:41,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1540581915, now seen corresponding path program 1 times [2024-11-08 17:12:41,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:41,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101443120] [2024-11-08 17:12:41,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:41,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:12:41,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:41,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101443120] [2024-11-08 17:12:41,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101443120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:41,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:41,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:12:41,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098678144] [2024-11-08 17:12:41,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:41,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:12:41,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:41,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:12:41,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:12:41,294 INFO L87 Difference]: Start difference. First operand 2775 states and 4189 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:41,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:41,325 INFO L93 Difference]: Finished difference Result 3647 states and 5547 transitions. [2024-11-08 17:12:41,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:12:41,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-08 17:12:41,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:41,333 INFO L225 Difference]: With dead ends: 3647 [2024-11-08 17:12:41,333 INFO L226 Difference]: Without dead ends: 3195 [2024-11-08 17:12:41,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:12:41,335 INFO L432 NwaCegarLoop]: 1681 mSDtfsCounter, 1525 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:41,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 1790 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:12:41,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2024-11-08 17:12:41,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 3193. [2024-11-08 17:12:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 3191 states have (on average 1.5139454716389846) internal successors, (4831), 3192 states have internal predecessors, (4831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:41,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 4831 transitions. [2024-11-08 17:12:41,382 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 4831 transitions. Word has length 94 [2024-11-08 17:12:41,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:41,383 INFO L471 AbstractCegarLoop]: Abstraction has 3193 states and 4831 transitions. [2024-11-08 17:12:41,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4831 transitions. [2024-11-08 17:12:41,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 17:12:41,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:41,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:12:41,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:12:41,384 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:41,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:41,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1967352859, now seen corresponding path program 1 times [2024-11-08 17:12:41,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:41,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922256514] [2024-11-08 17:12:41,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:41,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:41,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:12:41,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:41,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922256514] [2024-11-08 17:12:41,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922256514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:41,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:41,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:12:41,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838062325] [2024-11-08 17:12:41,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:41,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:12:41,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:41,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:12:41,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:12:41,443 INFO L87 Difference]: Start difference. First operand 3193 states and 4831 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:41,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:41,481 INFO L93 Difference]: Finished difference Result 4869 states and 7417 transitions. [2024-11-08 17:12:41,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:12:41,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-08 17:12:41,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:41,493 INFO L225 Difference]: With dead ends: 4869 [2024-11-08 17:12:41,493 INFO L226 Difference]: Without dead ends: 3999 [2024-11-08 17:12:41,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:12:41,495 INFO L432 NwaCegarLoop]: 1669 mSDtfsCounter, 1521 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:41,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1786 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:12:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3999 states. [2024-11-08 17:12:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3999 to 3997. [2024-11-08 17:12:41,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3997 states, 3995 states have (on average 1.5146433041301628) internal successors, (6051), 3996 states have internal predecessors, (6051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:41,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3997 states to 3997 states and 6051 transitions. [2024-11-08 17:12:41,562 INFO L78 Accepts]: Start accepts. Automaton has 3997 states and 6051 transitions. Word has length 94 [2024-11-08 17:12:41,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:41,562 INFO L471 AbstractCegarLoop]: Abstraction has 3997 states and 6051 transitions. [2024-11-08 17:12:41,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:41,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3997 states and 6051 transitions. [2024-11-08 17:12:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 17:12:41,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:41,563 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:12:41,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:12:41,564 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:41,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:41,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1089352421, now seen corresponding path program 1 times [2024-11-08 17:12:41,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:41,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079740798] [2024-11-08 17:12:41,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:41,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:41,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:12:41,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:41,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079740798] [2024-11-08 17:12:41,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079740798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:41,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:41,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:12:41,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68702861] [2024-11-08 17:12:41,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:41,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:12:41,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:41,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:12:41,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:12:41,636 INFO L87 Difference]: Start difference. First operand 3997 states and 6051 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:41,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:41,698 INFO L93 Difference]: Finished difference Result 7217 states and 10965 transitions. [2024-11-08 17:12:41,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:12:41,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-08 17:12:41,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:41,707 INFO L225 Difference]: With dead ends: 7217 [2024-11-08 17:12:41,707 INFO L226 Difference]: Without dead ends: 5543 [2024-11-08 17:12:41,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:12:41,710 INFO L432 NwaCegarLoop]: 1667 mSDtfsCounter, 1519 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:41,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1788 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:12:41,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5543 states. [2024-11-08 17:12:41,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5543 to 5541. [2024-11-08 17:12:41,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5541 states, 5539 states have (on average 1.5098393211771077) internal successors, (8363), 5540 states have internal predecessors, (8363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:41,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5541 states to 5541 states and 8363 transitions. [2024-11-08 17:12:41,837 INFO L78 Accepts]: Start accepts. Automaton has 5541 states and 8363 transitions. Word has length 94 [2024-11-08 17:12:41,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:41,838 INFO L471 AbstractCegarLoop]: Abstraction has 5541 states and 8363 transitions. [2024-11-08 17:12:41,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:41,838 INFO L276 IsEmpty]: Start isEmpty. Operand 5541 states and 8363 transitions. [2024-11-08 17:12:41,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 17:12:41,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:41,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:12:41,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:12:41,840 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:41,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:41,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1523888357, now seen corresponding path program 1 times [2024-11-08 17:12:41,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:41,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785209977] [2024-11-08 17:12:41,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:41,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:41,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:12:41,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:41,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785209977] [2024-11-08 17:12:41,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785209977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:41,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:41,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:12:41,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802868795] [2024-11-08 17:12:41,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:41,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:12:41,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:41,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:12:41,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:12:41,899 INFO L87 Difference]: Start difference. First operand 5541 states and 8363 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:41,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:41,986 INFO L93 Difference]: Finished difference Result 11721 states and 17677 transitions. [2024-11-08 17:12:41,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:12:41,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-08 17:12:41,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:41,999 INFO L225 Difference]: With dead ends: 11721 [2024-11-08 17:12:42,000 INFO L226 Difference]: Without dead ends: 8503 [2024-11-08 17:12:42,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:12:42,005 INFO L432 NwaCegarLoop]: 1655 mSDtfsCounter, 1515 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:42,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1784 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:12:42,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8503 states. [2024-11-08 17:12:42,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8503 to 8501. [2024-11-08 17:12:42,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8501 states, 8499 states have (on average 1.4979409342275563) internal successors, (12731), 8500 states have internal predecessors, (12731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8501 states to 8501 states and 12731 transitions. [2024-11-08 17:12:42,165 INFO L78 Accepts]: Start accepts. Automaton has 8501 states and 12731 transitions. Word has length 94 [2024-11-08 17:12:42,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:42,165 INFO L471 AbstractCegarLoop]: Abstraction has 8501 states and 12731 transitions. [2024-11-08 17:12:42,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:42,165 INFO L276 IsEmpty]: Start isEmpty. Operand 8501 states and 12731 transitions. [2024-11-08 17:12:42,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 17:12:42,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:42,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:12:42,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:12:42,166 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:42,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:42,167 INFO L85 PathProgramCache]: Analyzing trace with hash 990146075, now seen corresponding path program 1 times [2024-11-08 17:12:42,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:42,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793647350] [2024-11-08 17:12:42,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:42,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:12:42,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:42,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793647350] [2024-11-08 17:12:42,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793647350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:42,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:42,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:12:42,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153706463] [2024-11-08 17:12:42,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:42,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:12:42,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:42,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:12:42,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:12:42,227 INFO L87 Difference]: Start difference. First operand 8501 states and 12731 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:42,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:42,384 INFO L93 Difference]: Finished difference Result 20345 states and 30333 transitions. [2024-11-08 17:12:42,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:12:42,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-08 17:12:42,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:42,406 INFO L225 Difference]: With dead ends: 20345 [2024-11-08 17:12:42,406 INFO L226 Difference]: Without dead ends: 14167 [2024-11-08 17:12:42,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:12:42,417 INFO L432 NwaCegarLoop]: 1665 mSDtfsCounter, 1517 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:42,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1790 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:12:42,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14167 states. [2024-11-08 17:12:42,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14167 to 14165. [2024-11-08 17:12:42,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14165 states, 14163 states have (on average 1.4795594153780978) internal successors, (20955), 14164 states have internal predecessors, (20955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14165 states to 14165 states and 20955 transitions. [2024-11-08 17:12:42,858 INFO L78 Accepts]: Start accepts. Automaton has 14165 states and 20955 transitions. Word has length 94 [2024-11-08 17:12:42,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:42,858 INFO L471 AbstractCegarLoop]: Abstraction has 14165 states and 20955 transitions. [2024-11-08 17:12:42,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:42,859 INFO L276 IsEmpty]: Start isEmpty. Operand 14165 states and 20955 transitions. [2024-11-08 17:12:42,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 17:12:42,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:42,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:12:42,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 17:12:42,860 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:42,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:42,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1703496475, now seen corresponding path program 1 times [2024-11-08 17:12:42,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:42,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440401040] [2024-11-08 17:12:42,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:42,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:42,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:12:42,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:42,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440401040] [2024-11-08 17:12:42,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440401040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:42,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:42,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:12:42,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247939909] [2024-11-08 17:12:42,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:42,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:12:42,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:42,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:12:42,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:12:42,936 INFO L87 Difference]: Start difference. First operand 14165 states and 20955 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:43,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:43,231 INFO L93 Difference]: Finished difference Result 36825 states and 54109 transitions. [2024-11-08 17:12:43,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:12:43,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-08 17:12:43,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:43,272 INFO L225 Difference]: With dead ends: 36825 [2024-11-08 17:12:43,272 INFO L226 Difference]: Without dead ends: 24983 [2024-11-08 17:12:43,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:12:43,292 INFO L432 NwaCegarLoop]: 1679 mSDtfsCounter, 1523 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:43,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1792 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:12:43,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24983 states. [2024-11-08 17:12:43,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24983 to 24981. [2024-11-08 17:12:43,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24981 states, 24979 states have (on average 1.4563833620241002) internal successors, (36379), 24980 states have internal predecessors, (36379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24981 states to 24981 states and 36379 transitions. [2024-11-08 17:12:43,917 INFO L78 Accepts]: Start accepts. Automaton has 24981 states and 36379 transitions. Word has length 94 [2024-11-08 17:12:43,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:43,917 INFO L471 AbstractCegarLoop]: Abstraction has 24981 states and 36379 transitions. [2024-11-08 17:12:43,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 24981 states and 36379 transitions. [2024-11-08 17:12:43,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 17:12:43,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:43,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:12:43,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 17:12:43,918 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:43,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:43,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1087415530, now seen corresponding path program 1 times [2024-11-08 17:12:43,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:43,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868219566] [2024-11-08 17:12:43,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:43,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:12:43,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:43,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868219566] [2024-11-08 17:12:43,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868219566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:43,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:43,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:12:43,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516577788] [2024-11-08 17:12:43,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:43,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:12:43,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:43,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:12:43,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:12:43,981 INFO L87 Difference]: Start difference. First operand 24981 states and 36379 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:44,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:44,452 INFO L93 Difference]: Finished difference Result 48540 states and 70945 transitions. [2024-11-08 17:12:44,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:12:44,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-08 17:12:44,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:44,502 INFO L225 Difference]: With dead ends: 48540 [2024-11-08 17:12:44,503 INFO L226 Difference]: Without dead ends: 35993 [2024-11-08 17:12:44,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:12:44,521 INFO L432 NwaCegarLoop]: 1688 mSDtfsCounter, 1526 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:44,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1789 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:12:44,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35993 states. [2024-11-08 17:12:45,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35993 to 35991. [2024-11-08 17:12:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35991 states, 35989 states have (on average 1.4483592208730445) internal successors, (52125), 35990 states have internal predecessors, (52125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:45,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35991 states to 35991 states and 52125 transitions. [2024-11-08 17:12:45,343 INFO L78 Accepts]: Start accepts. Automaton has 35991 states and 52125 transitions. Word has length 96 [2024-11-08 17:12:45,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:45,344 INFO L471 AbstractCegarLoop]: Abstraction has 35991 states and 52125 transitions. [2024-11-08 17:12:45,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:45,344 INFO L276 IsEmpty]: Start isEmpty. Operand 35991 states and 52125 transitions. [2024-11-08 17:12:45,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 17:12:45,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:45,350 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:12:45,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 17:12:45,350 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:45,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:45,351 INFO L85 PathProgramCache]: Analyzing trace with hash 54573310, now seen corresponding path program 1 times [2024-11-08 17:12:45,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:45,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286078856] [2024-11-08 17:12:45,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:45,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:45,604 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 17:12:45,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:45,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286078856] [2024-11-08 17:12:45,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286078856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:45,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:45,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:12:45,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034263891] [2024-11-08 17:12:45,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:45,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:12:45,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:45,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:12:45,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:12:45,605 INFO L87 Difference]: Start difference. First operand 35991 states and 52125 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:49,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:49,645 INFO L93 Difference]: Finished difference Result 312105 states and 450726 transitions. [2024-11-08 17:12:49,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:12:49,646 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 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 119 [2024-11-08 17:12:49,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:50,370 INFO L225 Difference]: With dead ends: 312105 [2024-11-08 17:12:50,370 INFO L226 Difference]: Without dead ends: 278439 [2024-11-08 17:12:50,441 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-11-08 17:12:50,442 INFO L432 NwaCegarLoop]: 1706 mSDtfsCounter, 11836 mSDsluCounter, 3303 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11836 SdHoareTripleChecker+Valid, 5009 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:50,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11836 Valid, 5009 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:12:50,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278439 states. [2024-11-08 17:12:53,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278439 to 69655. [2024-11-08 17:12:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69655 states, 69653 states have (on average 1.4411583133533372) internal successors, (100381), 69654 states have internal predecessors, (100381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69655 states to 69655 states and 100381 transitions. [2024-11-08 17:12:53,881 INFO L78 Accepts]: Start accepts. Automaton has 69655 states and 100381 transitions. Word has length 119 [2024-11-08 17:12:53,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:53,883 INFO L471 AbstractCegarLoop]: Abstraction has 69655 states and 100381 transitions. [2024-11-08 17:12:53,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:12:53,883 INFO L276 IsEmpty]: Start isEmpty. Operand 69655 states and 100381 transitions. [2024-11-08 17:12:53,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 17:12:53,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:53,892 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:12:53,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 17:12:53,892 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:53,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:53,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1996642814, now seen corresponding path program 1 times [2024-11-08 17:12:53,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:53,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180953266] [2024-11-08 17:12:53,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:53,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 17:12:54,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:54,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180953266] [2024-11-08 17:12:54,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180953266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:54,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:54,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:12:54,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132142279] [2024-11-08 17:12:54,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:54,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:12:54,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:54,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:12:54,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:12:54,121 INFO L87 Difference]: Start difference. First operand 69655 states and 100381 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-11-08 17:12:59,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:59,521 INFO L93 Difference]: Finished difference Result 345769 states and 498982 transitions. [2024-11-08 17:12:59,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:12:59,522 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 119 [2024-11-08 17:12:59,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:59,955 INFO L225 Difference]: With dead ends: 345769 [2024-11-08 17:12:59,956 INFO L226 Difference]: Without dead ends: 312103 [2024-11-08 17:13:00,028 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-11-08 17:13:00,028 INFO L432 NwaCegarLoop]: 1703 mSDtfsCounter, 11886 mSDsluCounter, 3103 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11886 SdHoareTripleChecker+Valid, 4806 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:13:00,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11886 Valid, 4806 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:13:00,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312103 states. [2024-11-08 17:13:04,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312103 to 120215. [2024-11-08 17:13:04,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120215 states, 120213 states have (on average 1.4344954372655203) internal successors, (172445), 120214 states have internal predecessors, (172445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:13:05,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120215 states to 120215 states and 172445 transitions. [2024-11-08 17:13:05,117 INFO L78 Accepts]: Start accepts. Automaton has 120215 states and 172445 transitions. Word has length 119 [2024-11-08 17:13:05,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:13:05,118 INFO L471 AbstractCegarLoop]: Abstraction has 120215 states and 172445 transitions. [2024-11-08 17:13:05,118 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-11-08 17:13:05,118 INFO L276 IsEmpty]: Start isEmpty. Operand 120215 states and 172445 transitions. [2024-11-08 17:13:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 17:13:05,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:13:05,125 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:13:05,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 17:13:05,125 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:13:05,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:13:05,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1871553538, now seen corresponding path program 1 times [2024-11-08 17:13:05,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:13:05,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102520558] [2024-11-08 17:13:05,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:13:05,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:13:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 17:13:05,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:13:05,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102520558] [2024-11-08 17:13:05,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102520558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:13:05,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:13:05,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:13:05,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180624139] [2024-11-08 17:13:05,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:13:05,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:13:05,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:13:05,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:13:05,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:13:05,321 INFO L87 Difference]: Start difference. First operand 120215 states and 172445 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:13:11,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:13:11,930 INFO L93 Difference]: Finished difference Result 379433 states and 547238 transitions. [2024-11-08 17:13:11,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:13:11,931 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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 119 [2024-11-08 17:13:11,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:13:12,415 INFO L225 Difference]: With dead ends: 379433 [2024-11-08 17:13:12,415 INFO L226 Difference]: Without dead ends: 345767 [2024-11-08 17:13:12,482 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-11-08 17:13:12,483 INFO L432 NwaCegarLoop]: 1700 mSDtfsCounter, 11959 mSDsluCounter, 3100 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11959 SdHoareTripleChecker+Valid, 4800 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:13:12,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11959 Valid, 4800 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:13:12,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345767 states. [2024-11-08 17:13:18,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345767 to 153879. [2024-11-08 17:13:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153879 states, 153877 states have (on average 1.4342689290797195) internal successors, (220701), 153878 states have internal predecessors, (220701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:13:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153879 states to 153879 states and 220701 transitions. [2024-11-08 17:13:18,754 INFO L78 Accepts]: Start accepts. Automaton has 153879 states and 220701 transitions. Word has length 119 [2024-11-08 17:13:18,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:13:18,755 INFO L471 AbstractCegarLoop]: Abstraction has 153879 states and 220701 transitions. [2024-11-08 17:13:18,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:13:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 153879 states and 220701 transitions. [2024-11-08 17:13:18,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 17:13:18,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:13:18,768 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:13:18,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 17:13:18,768 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:13:18,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:13:18,769 INFO L85 PathProgramCache]: Analyzing trace with hash -633291522, now seen corresponding path program 1 times [2024-11-08 17:13:18,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:13:18,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001828966] [2024-11-08 17:13:18,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:13:18,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:13:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:18,955 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 17:13:18,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:13:18,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001828966] [2024-11-08 17:13:18,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001828966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:13:18,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:13:18,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:13:18,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137326540] [2024-11-08 17:13:18,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:13:18,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:13:18,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:13:18,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:13:18,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:13:18,958 INFO L87 Difference]: Start difference. First operand 153879 states and 220701 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)