./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label55.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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/eca-rers2012/Problem15_label55.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 b72ce2b63fc45ad9e7a0a19d4e53676fd1965a82647477e906aa1505ccdd455f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 04:11:02,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 04:11:02,466 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 04:11:02,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 04:11:02,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 04:11:02,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 04:11:02,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 04:11:02,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 04:11:02,508 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 04:11:02,509 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 04:11:02,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 04:11:02,510 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 04:11:02,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 04:11:02,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 04:11:02,513 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 04:11:02,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 04:11:02,513 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 04:11:02,514 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 04:11:02,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 04:11:02,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 04:11:02,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 04:11:02,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 04:11:02,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 04:11:02,519 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 04:11:02,519 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 04:11:02,519 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 04:11:02,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 04:11:02,520 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 04:11:02,520 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 04:11:02,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 04:11:02,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 04:11:02,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 04:11:02,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 04:11:02,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 04:11:02,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 04:11:02,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 04:11:02,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 04:11:02,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 04:11:02,524 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 04:11:02,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 04:11:02,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 04:11:02,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 04:11:02,525 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 -> b72ce2b63fc45ad9e7a0a19d4e53676fd1965a82647477e906aa1505ccdd455f [2024-11-16 04:11:02,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 04:11:02,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 04:11:02,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 04:11:02,843 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 04:11:02,843 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 04:11:02,845 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label55.c [2024-11-16 04:11:04,314 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 04:11:04,675 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 04:11:04,676 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label55.c [2024-11-16 04:11:04,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e608147ab/d19d65cbd04f4681b67dc1ecbbe21ba6/FLAG0d332988d [2024-11-16 04:11:04,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e608147ab/d19d65cbd04f4681b67dc1ecbbe21ba6 [2024-11-16 04:11:04,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 04:11:04,724 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 04:11:04,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 04:11:04,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 04:11:04,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 04:11:04,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:11:04" (1/1) ... [2024-11-16 04:11:04,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f795159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:11:04, skipping insertion in model container [2024-11-16 04:11:04,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:11:04" (1/1) ... [2024-11-16 04:11:04,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 04:11:05,132 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/eca-rers2012/Problem15_label55.c[6938,6951] [2024-11-16 04:11:05,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 04:11:05,504 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 04:11:05,536 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/eca-rers2012/Problem15_label55.c[6938,6951] [2024-11-16 04:11:05,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 04:11:05,739 INFO L204 MainTranslator]: Completed translation [2024-11-16 04:11:05,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:11:05 WrapperNode [2024-11-16 04:11:05,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 04:11:05,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 04:11:05,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 04:11:05,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 04:11:05,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:11:05" (1/1) ... [2024-11-16 04:11:05,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:11:05" (1/1) ... [2024-11-16 04:11:05,980 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1759 [2024-11-16 04:11:05,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 04:11:05,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 04:11:05,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 04:11:05,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 04:11:05,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:11:05" (1/1) ... [2024-11-16 04:11:05,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:11:05" (1/1) ... [2024-11-16 04:11:06,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:11:05" (1/1) ... [2024-11-16 04:11:06,176 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-16 04:11:06,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:11:05" (1/1) ... [2024-11-16 04:11:06,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:11:05" (1/1) ... [2024-11-16 04:11:06,303 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:11:05" (1/1) ... [2024-11-16 04:11:06,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:11:05" (1/1) ... [2024-11-16 04:11:06,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:11:05" (1/1) ... [2024-11-16 04:11:06,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:11:05" (1/1) ... [2024-11-16 04:11:06,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 04:11:06,361 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 04:11:06,361 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 04:11:06,362 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 04:11:06,363 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:11:05" (1/1) ... [2024-11-16 04:11:06,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 04:11:06,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:11:06,396 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-16 04:11:06,398 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-16 04:11:06,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 04:11:06,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 04:11:06,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 04:11:06,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 04:11:06,506 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 04:11:06,508 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 04:11:08,847 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2024-11-16 04:11:08,945 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-11-16 04:11:08,946 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 04:11:08,982 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 04:11:08,983 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 04:11:08,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:11:08 BoogieIcfgContainer [2024-11-16 04:11:08,984 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 04:11:08,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 04:11:08,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 04:11:08,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 04:11:08,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:11:04" (1/3) ... [2024-11-16 04:11:08,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6633022c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:11:08, skipping insertion in model container [2024-11-16 04:11:08,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:11:05" (2/3) ... [2024-11-16 04:11:08,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6633022c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:11:08, skipping insertion in model container [2024-11-16 04:11:08,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:11:08" (3/3) ... [2024-11-16 04:11:08,994 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label55.c [2024-11-16 04:11:09,014 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 04:11:09,015 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 04:11:09,100 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 04:11:09,108 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;@292c963d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 04:11:09,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 04:11:09,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 427 states, 425 states have (on average 1.771764705882353) internal successors, (753), 426 states have internal predecessors, (753), 0 states have call successors, (0), 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-16 04:11:09,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-16 04:11:09,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:11:09,127 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] [2024-11-16 04:11:09,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:11:09,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:11:09,135 INFO L85 PathProgramCache]: Analyzing trace with hash 125186478, now seen corresponding path program 1 times [2024-11-16 04:11:09,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:11:09,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105720000] [2024-11-16 04:11:09,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:11:09,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:11:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:11:09,587 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-16 04:11:09,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:11:09,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105720000] [2024-11-16 04:11:09,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105720000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:11:09,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:11:09,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 04:11:09,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516011795] [2024-11-16 04:11:09,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:11:09,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:11:09,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:11:09,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:11:09,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:09,635 INFO L87 Difference]: Start difference. First operand has 427 states, 425 states have (on average 1.771764705882353) internal successors, (753), 426 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 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-16 04:11:11,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:11:11,597 INFO L93 Difference]: Finished difference Result 1203 states and 2169 transitions. [2024-11-16 04:11:11,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:11:11,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-11-16 04:11:11,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:11:11,616 INFO L225 Difference]: With dead ends: 1203 [2024-11-16 04:11:11,617 INFO L226 Difference]: Without dead ends: 697 [2024-11-16 04:11:11,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:11,625 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 361 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-16 04:11:11,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 119 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-16 04:11:11,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-16 04:11:11,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 687. [2024-11-16 04:11:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 1.715743440233236) internal successors, (1177), 686 states have internal predecessors, (1177), 0 states have call successors, (0), 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-16 04:11:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1177 transitions. [2024-11-16 04:11:11,731 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1177 transitions. Word has length 59 [2024-11-16 04:11:11,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:11:11,732 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1177 transitions. [2024-11-16 04:11:11,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 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-16 04:11:11,732 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1177 transitions. [2024-11-16 04:11:11,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-16 04:11:11,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:11:11,736 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:11:11,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 04:11:11,737 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:11:11,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:11:11,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1291996522, now seen corresponding path program 1 times [2024-11-16 04:11:11,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:11:11,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394122175] [2024-11-16 04:11:11,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:11:11,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:11:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:11:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:11:12,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:11:12,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394122175] [2024-11-16 04:11:12,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394122175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:11:12,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:11:12,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 04:11:12,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116958093] [2024-11-16 04:11:12,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:11:12,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:11:12,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:11:12,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:11:12,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:12,137 INFO L87 Difference]: Start difference. First operand 687 states and 1177 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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-16 04:11:13,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:11:13,839 INFO L93 Difference]: Finished difference Result 1688 states and 2903 transitions. [2024-11-16 04:11:13,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:11:13,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-11-16 04:11:13,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:11:13,845 INFO L225 Difference]: With dead ends: 1688 [2024-11-16 04:11:13,845 INFO L226 Difference]: Without dead ends: 1003 [2024-11-16 04:11:13,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:13,849 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 254 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-16 04:11:13,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 231 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-16 04:11:13,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2024-11-16 04:11:13,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 993. [2024-11-16 04:11:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 992 states have (on average 1.6169354838709677) internal successors, (1604), 992 states have internal predecessors, (1604), 0 states have call successors, (0), 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-16 04:11:13,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1604 transitions. [2024-11-16 04:11:13,905 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1604 transitions. Word has length 125 [2024-11-16 04:11:13,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:11:13,906 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 1604 transitions. [2024-11-16 04:11:13,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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-16 04:11:13,906 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1604 transitions. [2024-11-16 04:11:13,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 04:11:13,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:11:13,909 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:11:13,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 04:11:13,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:11:13,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:11:13,911 INFO L85 PathProgramCache]: Analyzing trace with hash -45480695, now seen corresponding path program 1 times [2024-11-16 04:11:13,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:11:13,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873809055] [2024-11-16 04:11:13,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:11:13,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:11:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:11:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:11:14,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:11:14,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873809055] [2024-11-16 04:11:14,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873809055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:11:14,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:11:14,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 04:11:14,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023203527] [2024-11-16 04:11:14,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:11:14,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:11:14,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:11:14,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:11:14,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:14,102 INFO L87 Difference]: Start difference. First operand 993 states and 1604 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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-16 04:11:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:11:15,688 INFO L93 Difference]: Finished difference Result 2586 states and 4266 transitions. [2024-11-16 04:11:15,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:11:15,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-11-16 04:11:15,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:11:15,694 INFO L225 Difference]: With dead ends: 2586 [2024-11-16 04:11:15,695 INFO L226 Difference]: Without dead ends: 1595 [2024-11-16 04:11:15,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:15,698 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 285 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-16 04:11:15,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 342 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-16 04:11:15,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2024-11-16 04:11:15,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1590. [2024-11-16 04:11:15,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1589 states have (on average 1.3971050975456263) internal successors, (2220), 1589 states have internal predecessors, (2220), 0 states have call successors, (0), 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-16 04:11:15,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 2220 transitions. [2024-11-16 04:11:15,728 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 2220 transitions. Word has length 126 [2024-11-16 04:11:15,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:11:15,729 INFO L471 AbstractCegarLoop]: Abstraction has 1590 states and 2220 transitions. [2024-11-16 04:11:15,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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-16 04:11:15,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2220 transitions. [2024-11-16 04:11:15,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-16 04:11:15,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:11:15,732 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:11:15,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 04:11:15,732 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:11:15,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:11:15,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1072492277, now seen corresponding path program 1 times [2024-11-16 04:11:15,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:11:15,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830447612] [2024-11-16 04:11:15,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:11:15,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:11:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:11:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:11:15,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:11:15,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830447612] [2024-11-16 04:11:15,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830447612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:11:15,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:11:15,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 04:11:15,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650862938] [2024-11-16 04:11:15,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:11:15,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:11:15,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:11:15,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:11:15,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:15,875 INFO L87 Difference]: Start difference. First operand 1590 states and 2220 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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-16 04:11:17,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:11:17,434 INFO L93 Difference]: Finished difference Result 4083 states and 5881 transitions. [2024-11-16 04:11:17,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:11:17,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-11-16 04:11:17,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:11:17,443 INFO L225 Difference]: With dead ends: 4083 [2024-11-16 04:11:17,444 INFO L226 Difference]: Without dead ends: 2795 [2024-11-16 04:11:17,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:17,449 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 243 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-16 04:11:17,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 367 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-16 04:11:17,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2795 states. [2024-11-16 04:11:17,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2795 to 2192. [2024-11-16 04:11:17,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2192 states, 2191 states have (on average 1.329073482428115) internal successors, (2912), 2191 states have internal predecessors, (2912), 0 states have call successors, (0), 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-16 04:11:17,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 2912 transitions. [2024-11-16 04:11:17,496 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 2912 transitions. Word has length 130 [2024-11-16 04:11:17,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:11:17,497 INFO L471 AbstractCegarLoop]: Abstraction has 2192 states and 2912 transitions. [2024-11-16 04:11:17,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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-16 04:11:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 2912 transitions. [2024-11-16 04:11:17,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-16 04:11:17,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:11:17,503 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:11:17,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 04:11:17,504 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:11:17,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:11:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash 901394213, now seen corresponding path program 1 times [2024-11-16 04:11:17,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:11:17,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267273236] [2024-11-16 04:11:17,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:11:17,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:11:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:11:17,891 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-16 04:11:17,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:11:17,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267273236] [2024-11-16 04:11:17,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267273236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:11:17,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:11:17,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 04:11:17,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450185613] [2024-11-16 04:11:17,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:11:17,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:11:17,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:11:17,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:11:17,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:17,897 INFO L87 Difference]: Start difference. First operand 2192 states and 2912 transitions. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 2 states have internal predecessors, (276), 0 states have call successors, (0), 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-16 04:11:19,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:11:19,173 INFO L93 Difference]: Finished difference Result 5889 states and 7911 transitions. [2024-11-16 04:11:19,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:11:19,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 2 states have internal predecessors, (276), 0 states have call successors, (0), 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 330 [2024-11-16 04:11:19,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:11:19,186 INFO L225 Difference]: With dead ends: 5889 [2024-11-16 04:11:19,187 INFO L226 Difference]: Without dead ends: 3699 [2024-11-16 04:11:19,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:19,195 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 43 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 04:11:19,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 323 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 04:11:19,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3699 states. [2024-11-16 04:11:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3699 to 3697. [2024-11-16 04:11:19,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3697 states, 3696 states have (on average 1.2573051948051948) internal successors, (4647), 3696 states have internal predecessors, (4647), 0 states have call successors, (0), 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-16 04:11:19,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3697 states to 3697 states and 4647 transitions. [2024-11-16 04:11:19,265 INFO L78 Accepts]: Start accepts. Automaton has 3697 states and 4647 transitions. Word has length 330 [2024-11-16 04:11:19,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:11:19,267 INFO L471 AbstractCegarLoop]: Abstraction has 3697 states and 4647 transitions. [2024-11-16 04:11:19,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 2 states have internal predecessors, (276), 0 states have call successors, (0), 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-16 04:11:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3697 states and 4647 transitions. [2024-11-16 04:11:19,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2024-11-16 04:11:19,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:11:19,274 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:11:19,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 04:11:19,275 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:11:19,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:11:19,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1483532924, now seen corresponding path program 1 times [2024-11-16 04:11:19,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:11:19,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380282528] [2024-11-16 04:11:19,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:11:19,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:11:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:11:20,093 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-16 04:11:20,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:11:20,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380282528] [2024-11-16 04:11:20,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380282528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:11:20,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:11:20,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 04:11:20,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001812927] [2024-11-16 04:11:20,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:11:20,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:11:20,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:11:20,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:11:20,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:20,098 INFO L87 Difference]: Start difference. First operand 3697 states and 4647 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 2 states have internal predecessors, (324), 0 states have call successors, (0), 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-16 04:11:21,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:11:21,337 INFO L93 Difference]: Finished difference Result 7692 states and 9604 transitions. [2024-11-16 04:11:21,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:11:21,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 2 states have internal predecessors, (324), 0 states have call successors, (0), 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 379 [2024-11-16 04:11:21,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:11:21,355 INFO L225 Difference]: With dead ends: 7692 [2024-11-16 04:11:21,356 INFO L226 Difference]: Without dead ends: 3997 [2024-11-16 04:11:21,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:21,365 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 105 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 04:11:21,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 363 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 04:11:21,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3997 states. [2024-11-16 04:11:21,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3997 to 3997. [2024-11-16 04:11:21,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3997 states, 3996 states have (on average 1.2394894894894894) internal successors, (4953), 3996 states have internal predecessors, (4953), 0 states have call successors, (0), 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-16 04:11:21,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3997 states to 3997 states and 4953 transitions. [2024-11-16 04:11:21,445 INFO L78 Accepts]: Start accepts. Automaton has 3997 states and 4953 transitions. Word has length 379 [2024-11-16 04:11:21,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:11:21,446 INFO L471 AbstractCegarLoop]: Abstraction has 3997 states and 4953 transitions. [2024-11-16 04:11:21,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 2 states have internal predecessors, (324), 0 states have call successors, (0), 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-16 04:11:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3997 states and 4953 transitions. [2024-11-16 04:11:21,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2024-11-16 04:11:21,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:11:21,453 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:11:21,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 04:11:21,453 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:11:21,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:11:21,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2080852608, now seen corresponding path program 1 times [2024-11-16 04:11:21,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:11:21,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218428593] [2024-11-16 04:11:21,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:11:21,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:11:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:11:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-16 04:11:21,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:11:21,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218428593] [2024-11-16 04:11:21,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218428593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:11:21,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:11:21,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:11:21,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091851843] [2024-11-16 04:11:21,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:11:21,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:11:21,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:11:21,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:11:21,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:21,747 INFO L87 Difference]: Start difference. First operand 3997 states and 4953 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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-16 04:11:23,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:11:23,089 INFO L93 Difference]: Finished difference Result 8892 states and 11364 transitions. [2024-11-16 04:11:23,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:11:23,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 422 [2024-11-16 04:11:23,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:11:23,108 INFO L225 Difference]: With dead ends: 8892 [2024-11-16 04:11:23,108 INFO L226 Difference]: Without dead ends: 5197 [2024-11-16 04:11:23,114 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-16 04:11:23,114 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 257 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-16 04:11:23,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 328 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-16 04:11:23,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5197 states. [2024-11-16 04:11:23,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5197 to 3393. [2024-11-16 04:11:23,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3393 states, 3392 states have (on average 1.2620872641509433) internal successors, (4281), 3392 states have internal predecessors, (4281), 0 states have call successors, (0), 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-16 04:11:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3393 states to 3393 states and 4281 transitions. [2024-11-16 04:11:23,181 INFO L78 Accepts]: Start accepts. Automaton has 3393 states and 4281 transitions. Word has length 422 [2024-11-16 04:11:23,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:11:23,182 INFO L471 AbstractCegarLoop]: Abstraction has 3393 states and 4281 transitions. [2024-11-16 04:11:23,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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-16 04:11:23,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3393 states and 4281 transitions. [2024-11-16 04:11:23,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2024-11-16 04:11:23,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:11:23,188 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:11:23,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 04:11:23,189 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:11:23,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:11:23,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1465971351, now seen corresponding path program 1 times [2024-11-16 04:11:23,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:11:23,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333161909] [2024-11-16 04:11:23,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:11:23,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:11:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:11:23,594 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:11:23,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:11:23,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333161909] [2024-11-16 04:11:23,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333161909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:11:23,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:11:23,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:11:23,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119097262] [2024-11-16 04:11:23,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:11:23,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:11:23,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:11:23,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:11:23,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:23,597 INFO L87 Difference]: Start difference. First operand 3393 states and 4281 transitions. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 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-16 04:11:25,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:11:25,054 INFO L93 Difference]: Finished difference Result 8293 states and 10742 transitions. [2024-11-16 04:11:25,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:11:25,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 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 426 [2024-11-16 04:11:25,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:11:25,069 INFO L225 Difference]: With dead ends: 8293 [2024-11-16 04:11:25,069 INFO L226 Difference]: Without dead ends: 5202 [2024-11-16 04:11:25,074 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-16 04:11:25,075 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 223 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 04:11:25,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 670 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 04:11:25,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5202 states. [2024-11-16 04:11:25,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5202 to 4897. [2024-11-16 04:11:25,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4897 states, 4896 states have (on average 1.2052696078431373) internal successors, (5901), 4896 states have internal predecessors, (5901), 0 states have call successors, (0), 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-16 04:11:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4897 states to 4897 states and 5901 transitions. [2024-11-16 04:11:25,205 INFO L78 Accepts]: Start accepts. Automaton has 4897 states and 5901 transitions. Word has length 426 [2024-11-16 04:11:25,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:11:25,206 INFO L471 AbstractCegarLoop]: Abstraction has 4897 states and 5901 transitions. [2024-11-16 04:11:25,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 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-16 04:11:25,207 INFO L276 IsEmpty]: Start isEmpty. Operand 4897 states and 5901 transitions. [2024-11-16 04:11:25,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2024-11-16 04:11:25,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:11:25,217 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:11:25,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 04:11:25,217 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:11:25,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:11:25,218 INFO L85 PathProgramCache]: Analyzing trace with hash -754966987, now seen corresponding path program 1 times [2024-11-16 04:11:25,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:11:25,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092980787] [2024-11-16 04:11:25,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:11:25,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:11:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:11:25,675 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-16 04:11:25,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:11:25,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092980787] [2024-11-16 04:11:25,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092980787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:11:25,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:11:25,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:11:25,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359851957] [2024-11-16 04:11:25,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:11:25,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:11:25,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:11:25,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:11:25,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:25,679 INFO L87 Difference]: Start difference. First operand 4897 states and 5901 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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-16 04:11:26,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:11:26,998 INFO L93 Difference]: Finished difference Result 10994 states and 13619 transitions. [2024-11-16 04:11:27,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:11:27,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 438 [2024-11-16 04:11:27,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:11:27,028 INFO L225 Difference]: With dead ends: 10994 [2024-11-16 04:11:27,032 INFO L226 Difference]: Without dead ends: 6399 [2024-11-16 04:11:27,037 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-16 04:11:27,041 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 271 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-16 04:11:27,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 624 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-16 04:11:27,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6399 states. [2024-11-16 04:11:27,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6399 to 6396. [2024-11-16 04:11:27,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6396 states, 6395 states have (on average 1.1821735731039875) internal successors, (7560), 6395 states have internal predecessors, (7560), 0 states have call successors, (0), 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-16 04:11:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6396 states to 6396 states and 7560 transitions. [2024-11-16 04:11:27,132 INFO L78 Accepts]: Start accepts. Automaton has 6396 states and 7560 transitions. Word has length 438 [2024-11-16 04:11:27,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:11:27,133 INFO L471 AbstractCegarLoop]: Abstraction has 6396 states and 7560 transitions. [2024-11-16 04:11:27,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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-16 04:11:27,134 INFO L276 IsEmpty]: Start isEmpty. Operand 6396 states and 7560 transitions. [2024-11-16 04:11:27,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2024-11-16 04:11:27,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:11:27,139 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:11:27,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 04:11:27,140 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:11:27,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:11:27,144 INFO L85 PathProgramCache]: Analyzing trace with hash -716923156, now seen corresponding path program 1 times [2024-11-16 04:11:27,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:11:27,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481713186] [2024-11-16 04:11:27,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:11:27,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:11:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:11:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2024-11-16 04:11:27,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:11:27,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481713186] [2024-11-16 04:11:27,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481713186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:11:27,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:11:27,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:11:27,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082488194] [2024-11-16 04:11:27,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:11:27,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:11:27,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:11:28,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:11:28,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:28,003 INFO L87 Difference]: Start difference. First operand 6396 states and 7560 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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-16 04:11:29,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:11:29,268 INFO L93 Difference]: Finished difference Result 13994 states and 16936 transitions. [2024-11-16 04:11:29,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:11:29,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 536 [2024-11-16 04:11:29,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:11:29,281 INFO L225 Difference]: With dead ends: 13994 [2024-11-16 04:11:29,281 INFO L226 Difference]: Without dead ends: 7900 [2024-11-16 04:11:29,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-16 04:11:29,322 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 321 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 04:11:29,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 206 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 04:11:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2024-11-16 04:11:29,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7600. [2024-11-16 04:11:29,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7600 states, 7599 states have (on average 1.210948809053823) internal successors, (9202), 7599 states have internal predecessors, (9202), 0 states have call successors, (0), 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-16 04:11:29,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7600 states to 7600 states and 9202 transitions. [2024-11-16 04:11:29,427 INFO L78 Accepts]: Start accepts. Automaton has 7600 states and 9202 transitions. Word has length 536 [2024-11-16 04:11:29,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:11:29,428 INFO L471 AbstractCegarLoop]: Abstraction has 7600 states and 9202 transitions. [2024-11-16 04:11:29,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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-16 04:11:29,429 INFO L276 IsEmpty]: Start isEmpty. Operand 7600 states and 9202 transitions. [2024-11-16 04:11:29,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2024-11-16 04:11:29,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:11:29,435 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:11:29,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 04:11:29,436 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:11:29,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:11:29,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1291216452, now seen corresponding path program 1 times [2024-11-16 04:11:29,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:11:29,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585364983] [2024-11-16 04:11:29,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:11:29,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:11:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:11:29,879 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2024-11-16 04:11:29,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:11:29,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585364983] [2024-11-16 04:11:29,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585364983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:11:29,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:11:29,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:11:29,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596726253] [2024-11-16 04:11:29,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:11:29,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:11:29,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:11:29,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:11:29,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:29,882 INFO L87 Difference]: Start difference. First operand 7600 states and 9202 transitions. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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-16 04:11:31,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:11:31,390 INFO L93 Difference]: Finished difference Result 18512 states and 22501 transitions. [2024-11-16 04:11:31,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:11:31,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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 554 [2024-11-16 04:11:31,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:11:31,411 INFO L225 Difference]: With dead ends: 18512 [2024-11-16 04:11:31,412 INFO L226 Difference]: Without dead ends: 11214 [2024-11-16 04:11:31,421 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-16 04:11:31,422 INFO L432 NwaCegarLoop]: 594 mSDtfsCounter, 243 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 04:11:31,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 629 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 04:11:31,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11214 states. [2024-11-16 04:11:31,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11214 to 11202. [2024-11-16 04:11:31,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11202 states, 11201 states have (on average 1.1827515400410678) internal successors, (13248), 11201 states have internal predecessors, (13248), 0 states have call successors, (0), 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-16 04:11:31,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11202 states to 11202 states and 13248 transitions. [2024-11-16 04:11:31,559 INFO L78 Accepts]: Start accepts. Automaton has 11202 states and 13248 transitions. Word has length 554 [2024-11-16 04:11:31,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:11:31,560 INFO L471 AbstractCegarLoop]: Abstraction has 11202 states and 13248 transitions. [2024-11-16 04:11:31,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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-16 04:11:31,560 INFO L276 IsEmpty]: Start isEmpty. Operand 11202 states and 13248 transitions. [2024-11-16 04:11:31,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2024-11-16 04:11:31,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:11:31,568 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:11:31,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 04:11:31,568 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:11:31,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:11:31,569 INFO L85 PathProgramCache]: Analyzing trace with hash 2057351871, now seen corresponding path program 1 times [2024-11-16 04:11:31,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:11:31,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989262952] [2024-11-16 04:11:31,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:11:31,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:11:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:11:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-11-16 04:11:32,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:11:32,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989262952] [2024-11-16 04:11:32,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989262952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:11:32,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:11:32,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:11:32,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391624322] [2024-11-16 04:11:32,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:11:32,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:11:32,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:11:32,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:11:32,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:32,031 INFO L87 Difference]: Start difference. First operand 11202 states and 13248 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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-16 04:11:33,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:11:33,228 INFO L93 Difference]: Finished difference Result 22400 states and 26528 transitions. [2024-11-16 04:11:33,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:11:33,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 563 [2024-11-16 04:11:33,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:11:33,248 INFO L225 Difference]: With dead ends: 22400 [2024-11-16 04:11:33,248 INFO L226 Difference]: Without dead ends: 11500 [2024-11-16 04:11:33,258 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-16 04:11:33,259 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 467 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 04:11:33,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 74 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 04:11:33,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11500 states. [2024-11-16 04:11:33,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11500 to 11200. [2024-11-16 04:11:33,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11200 states, 11199 states have (on average 1.1826055897848022) internal successors, (13244), 11199 states have internal predecessors, (13244), 0 states have call successors, (0), 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-16 04:11:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11200 states to 11200 states and 13244 transitions. [2024-11-16 04:11:33,381 INFO L78 Accepts]: Start accepts. Automaton has 11200 states and 13244 transitions. Word has length 563 [2024-11-16 04:11:33,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:11:33,382 INFO L471 AbstractCegarLoop]: Abstraction has 11200 states and 13244 transitions. [2024-11-16 04:11:33,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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-16 04:11:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 11200 states and 13244 transitions. [2024-11-16 04:11:33,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2024-11-16 04:11:33,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:11:33,397 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:11:33,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 04:11:33,397 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:11:33,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:11:33,398 INFO L85 PathProgramCache]: Analyzing trace with hash 537584211, now seen corresponding path program 1 times [2024-11-16 04:11:33,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:11:33,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469761486] [2024-11-16 04:11:33,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:11:33,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:11:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:11:33,742 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 448 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-11-16 04:11:33,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:11:33,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469761486] [2024-11-16 04:11:33,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469761486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:11:33,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:11:33,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:11:33,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573260278] [2024-11-16 04:11:33,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:11:33,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:11:33,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:11:33,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:11:33,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:33,746 INFO L87 Difference]: Start difference. First operand 11200 states and 13244 transitions. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 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-16 04:11:34,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:11:34,822 INFO L93 Difference]: Finished difference Result 23298 states and 27530 transitions. [2024-11-16 04:11:34,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:11:34,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 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 584 [2024-11-16 04:11:34,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:11:34,840 INFO L225 Difference]: With dead ends: 23298 [2024-11-16 04:11:34,841 INFO L226 Difference]: Without dead ends: 12400 [2024-11-16 04:11:34,852 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-16 04:11:34,853 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 268 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 04:11:34,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 335 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 04:11:34,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12400 states. [2024-11-16 04:11:34,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12400 to 9097. [2024-11-16 04:11:34,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9097 states, 9096 states have (on average 1.2049252418645557) internal successors, (10960), 9096 states have internal predecessors, (10960), 0 states have call successors, (0), 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-16 04:11:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9097 states to 9097 states and 10960 transitions. [2024-11-16 04:11:34,972 INFO L78 Accepts]: Start accepts. Automaton has 9097 states and 10960 transitions. Word has length 584 [2024-11-16 04:11:34,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:11:34,973 INFO L471 AbstractCegarLoop]: Abstraction has 9097 states and 10960 transitions. [2024-11-16 04:11:34,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 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-16 04:11:34,973 INFO L276 IsEmpty]: Start isEmpty. Operand 9097 states and 10960 transitions. [2024-11-16 04:11:34,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2024-11-16 04:11:34,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:11:34,983 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:11:34,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 04:11:34,983 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:11:34,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:11:34,984 INFO L85 PathProgramCache]: Analyzing trace with hash 202596090, now seen corresponding path program 1 times [2024-11-16 04:11:34,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:11:34,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280906139] [2024-11-16 04:11:34,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:11:34,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:11:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:11:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 610 proven. 39 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-16 04:11:35,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:11:35,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280906139] [2024-11-16 04:11:35,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280906139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 04:11:35,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254070883] [2024-11-16 04:11:35,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:11:35,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:11:35,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:11:35,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 04:11:35,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 04:11:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:11:35,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 04:11:35,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:11:36,978 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 610 proven. 39 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-16 04:11:36,978 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 04:11:37,885 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 610 proven. 39 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-16 04:11:37,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254070883] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 04:11:37,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 04:11:37,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-16 04:11:37,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100494110] [2024-11-16 04:11:37,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 04:11:37,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 04:11:37,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:11:37,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 04:11:37,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-16 04:11:37,891 INFO L87 Difference]: Start difference. First operand 9097 states and 10960 transitions. Second operand has 9 states, 9 states have (on average 87.22222222222223) internal successors, (785), 8 states have internal predecessors, (785), 0 states have call successors, (0), 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-16 04:11:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:11:42,748 INFO L93 Difference]: Finished difference Result 25253 states and 30019 transitions. [2024-11-16 04:11:42,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 04:11:42,748 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 87.22222222222223) internal successors, (785), 8 states have internal predecessors, (785), 0 states have call successors, (0), 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 627 [2024-11-16 04:11:42,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:11:42,764 INFO L225 Difference]: With dead ends: 25253 [2024-11-16 04:11:42,764 INFO L226 Difference]: Without dead ends: 10599 [2024-11-16 04:11:42,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1263 GetRequests, 1249 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2024-11-16 04:11:42,778 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 3062 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 5651 mSolverCounterSat, 672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3062 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 6323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 5651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-16 04:11:42,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3062 Valid, 260 Invalid, 6323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [672 Valid, 5651 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-16 04:11:42,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10599 states. [2024-11-16 04:11:42,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10599 to 10595. [2024-11-16 04:11:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10595 states, 10594 states have (on average 1.0864640362469322) internal successors, (11510), 10594 states have internal predecessors, (11510), 0 states have call successors, (0), 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-16 04:11:42,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10595 states to 10595 states and 11510 transitions. [2024-11-16 04:11:42,903 INFO L78 Accepts]: Start accepts. Automaton has 10595 states and 11510 transitions. Word has length 627 [2024-11-16 04:11:42,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:11:42,903 INFO L471 AbstractCegarLoop]: Abstraction has 10595 states and 11510 transitions. [2024-11-16 04:11:42,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.22222222222223) internal successors, (785), 8 states have internal predecessors, (785), 0 states have call successors, (0), 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-16 04:11:42,904 INFO L276 IsEmpty]: Start isEmpty. Operand 10595 states and 11510 transitions. [2024-11-16 04:11:42,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2024-11-16 04:11:42,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:11:42,912 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:11:42,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 04:11:43,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-16 04:11:43,113 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:11:43,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:11:43,114 INFO L85 PathProgramCache]: Analyzing trace with hash 646478306, now seen corresponding path program 1 times [2024-11-16 04:11:43,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:11:43,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158659071] [2024-11-16 04:11:43,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:11:43,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:11:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:11:43,439 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 469 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-16 04:11:43,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:11:43,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158659071] [2024-11-16 04:11:43,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158659071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:11:43,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:11:43,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:11:43,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71680854] [2024-11-16 04:11:43,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:11:43,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:11:43,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:11:43,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:11:43,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:43,444 INFO L87 Difference]: Start difference. First operand 10595 states and 11510 transitions. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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-16 04:11:44,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:11:44,285 INFO L93 Difference]: Finished difference Result 23287 states and 25424 transitions. [2024-11-16 04:11:44,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:11:44,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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 635 [2024-11-16 04:11:44,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:11:44,299 INFO L225 Difference]: With dead ends: 23287 [2024-11-16 04:11:44,299 INFO L226 Difference]: Without dead ends: 12994 [2024-11-16 04:11:44,306 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-16 04:11:44,307 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 299 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 04:11:44,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 417 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 04:11:44,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12994 states. [2024-11-16 04:11:44,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12994 to 10294. [2024-11-16 04:11:44,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10294 states, 10293 states have (on average 1.0856893034100845) internal successors, (11175), 10293 states have internal predecessors, (11175), 0 states have call successors, (0), 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-16 04:11:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10294 states to 10294 states and 11175 transitions. [2024-11-16 04:11:44,456 INFO L78 Accepts]: Start accepts. Automaton has 10294 states and 11175 transitions. Word has length 635 [2024-11-16 04:11:44,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:11:44,456 INFO L471 AbstractCegarLoop]: Abstraction has 10294 states and 11175 transitions. [2024-11-16 04:11:44,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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-16 04:11:44,457 INFO L276 IsEmpty]: Start isEmpty. Operand 10294 states and 11175 transitions. [2024-11-16 04:11:44,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2024-11-16 04:11:44,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:11:44,465 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:11:44,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 04:11:44,466 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:11:44,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:11:44,466 INFO L85 PathProgramCache]: Analyzing trace with hash -147710435, now seen corresponding path program 1 times [2024-11-16 04:11:44,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:11:44,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028163961] [2024-11-16 04:11:44,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:11:44,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:11:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:11:44,849 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-11-16 04:11:44,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:11:44,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028163961] [2024-11-16 04:11:44,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028163961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:11:44,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:11:44,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:11:44,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327338204] [2024-11-16 04:11:44,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:11:44,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:11:44,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:11:44,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:11:44,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:44,851 INFO L87 Difference]: Start difference. First operand 10294 states and 11175 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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-16 04:11:45,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:11:45,637 INFO L93 Difference]: Finished difference Result 24784 states and 27037 transitions. [2024-11-16 04:11:45,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:11:45,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 663 [2024-11-16 04:11:45,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:11:45,653 INFO L225 Difference]: With dead ends: 24784 [2024-11-16 04:11:45,653 INFO L226 Difference]: Without dead ends: 14492 [2024-11-16 04:11:45,662 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-16 04:11:45,663 INFO L432 NwaCegarLoop]: 480 mSDtfsCounter, 262 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 04:11:45,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 520 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 04:11:45,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14492 states. [2024-11-16 04:11:45,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14492 to 12990. [2024-11-16 04:11:45,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12990 states, 12989 states have (on average 1.0741396566325352) internal successors, (13952), 12989 states have internal predecessors, (13952), 0 states have call successors, (0), 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-16 04:11:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12990 states to 12990 states and 13952 transitions. [2024-11-16 04:11:45,865 INFO L78 Accepts]: Start accepts. Automaton has 12990 states and 13952 transitions. Word has length 663 [2024-11-16 04:11:45,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:11:45,866 INFO L471 AbstractCegarLoop]: Abstraction has 12990 states and 13952 transitions. [2024-11-16 04:11:45,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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-16 04:11:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 12990 states and 13952 transitions. [2024-11-16 04:11:45,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 825 [2024-11-16 04:11:45,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:11:45,884 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:11:45,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 04:11:45,884 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:11:45,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:11:45,885 INFO L85 PathProgramCache]: Analyzing trace with hash -2146063892, now seen corresponding path program 1 times [2024-11-16 04:11:45,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:11:45,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974647129] [2024-11-16 04:11:45,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:11:45,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:11:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:11:46,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 770 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2024-11-16 04:11:46,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:11:46,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974647129] [2024-11-16 04:11:46,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974647129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:11:46,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:11:46,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:11:46,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147986093] [2024-11-16 04:11:46,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:11:46,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:11:46,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:11:46,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:11:46,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:46,276 INFO L87 Difference]: Start difference. First operand 12990 states and 13952 transitions. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 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-16 04:11:47,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:11:47,148 INFO L93 Difference]: Finished difference Result 29576 states and 31881 transitions. [2024-11-16 04:11:47,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:11:47,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 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 824 [2024-11-16 04:11:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:11:47,164 INFO L225 Difference]: With dead ends: 29576 [2024-11-16 04:11:47,164 INFO L226 Difference]: Without dead ends: 16888 [2024-11-16 04:11:47,173 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-16 04:11:47,173 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 153 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 04:11:47,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 154 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 04:11:47,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16888 states. [2024-11-16 04:11:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16888 to 15388. [2024-11-16 04:11:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15388 states, 15387 states have (on average 1.063625138103594) internal successors, (16366), 15387 states have internal predecessors, (16366), 0 states have call successors, (0), 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-16 04:11:47,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15388 states to 15388 states and 16366 transitions. [2024-11-16 04:11:47,428 INFO L78 Accepts]: Start accepts. Automaton has 15388 states and 16366 transitions. Word has length 824 [2024-11-16 04:11:47,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:11:47,428 INFO L471 AbstractCegarLoop]: Abstraction has 15388 states and 16366 transitions. [2024-11-16 04:11:47,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 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-16 04:11:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 15388 states and 16366 transitions. [2024-11-16 04:11:47,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2024-11-16 04:11:47,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:11:47,465 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:11:47,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 04:11:47,465 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:11:47,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:11:47,466 INFO L85 PathProgramCache]: Analyzing trace with hash 543808523, now seen corresponding path program 1 times [2024-11-16 04:11:47,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:11:47,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68861986] [2024-11-16 04:11:47,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:11:47,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:11:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:11:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1899 backedges. 335 proven. 0 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked. [2024-11-16 04:11:47,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:11:47,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68861986] [2024-11-16 04:11:47,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68861986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:11:47,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:11:47,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:11:47,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754042383] [2024-11-16 04:11:47,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:11:47,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:11:47,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:11:47,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:11:47,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:11:47,947 INFO L87 Difference]: Start difference. First operand 15388 states and 16366 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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-16 04:11:48,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:11:48,745 INFO L93 Difference]: Finished difference Result 32568 states and 34749 transitions. [2024-11-16 04:11:48,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:11:48,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 926 [2024-11-16 04:11:48,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:11:48,746 INFO L225 Difference]: With dead ends: 32568 [2024-11-16 04:11:48,747 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 04:11:48,760 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-16 04:11:48,761 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 284 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 04:11:48,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 451 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 04:11:48,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 04:11:48,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 04:11:48,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-16 04:11:48,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 04:11:48,762 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 926 [2024-11-16 04:11:48,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:11:48,762 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 04:11:48,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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-16 04:11:48,763 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 04:11:48,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 04:11:48,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 04:11:48,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 04:11:48,768 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:11:48,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 04:11:50,823 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 04:11:50,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:11:50 BoogieIcfgContainer [2024-11-16 04:11:50,836 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 04:11:50,836 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 04:11:50,837 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 04:11:50,837 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 04:11:50,837 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:11:08" (3/4) ... [2024-11-16 04:11:50,841 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 04:11:50,878 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-16 04:11:50,881 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-16 04:11:50,883 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 04:11:50,885 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 04:11:51,085 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 04:11:51,085 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 04:11:51,085 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 04:11:51,087 INFO L158 Benchmark]: Toolchain (without parser) took 46362.50ms. Allocated memory was 151.0MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 75.0MB in the beginning and 563.4MB in the end (delta: -488.4MB). Peak memory consumption was 486.3MB. Max. memory is 16.1GB. [2024-11-16 04:11:51,088 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 151.0MB. Free memory is still 101.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 04:11:51,088 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1012.71ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 74.8MB in the beginning and 90.1MB in the end (delta: -15.3MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2024-11-16 04:11:51,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 239.78ms. Allocated memory is still 192.9MB. Free memory was 90.1MB in the beginning and 136.4MB in the end (delta: -46.3MB). Peak memory consumption was 55.5MB. Max. memory is 16.1GB. [2024-11-16 04:11:51,089 INFO L158 Benchmark]: Boogie Preprocessor took 378.58ms. Allocated memory is still 192.9MB. Free memory was 136.4MB in the beginning and 126.7MB in the end (delta: 9.7MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. [2024-11-16 04:11:51,092 INFO L158 Benchmark]: IcfgBuilder took 2622.80ms. Allocated memory was 192.9MB in the beginning and 310.4MB in the end (delta: 117.4MB). Free memory was 126.7MB in the beginning and 146.9MB in the end (delta: -20.2MB). Peak memory consumption was 118.1MB. Max. memory is 16.1GB. [2024-11-16 04:11:51,092 INFO L158 Benchmark]: TraceAbstraction took 41850.46ms. Allocated memory was 310.4MB in the beginning and 1.1GB in the end (delta: 813.7MB). Free memory was 146.9MB in the beginning and 590.6MB in the end (delta: -443.6MB). Peak memory consumption was 636.3MB. Max. memory is 16.1GB. [2024-11-16 04:11:51,093 INFO L158 Benchmark]: Witness Printer took 249.04ms. Allocated memory is still 1.1GB. Free memory was 590.6MB in the beginning and 563.4MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-16 04:11:51,095 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 151.0MB. Free memory is still 101.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1012.71ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 74.8MB in the beginning and 90.1MB in the end (delta: -15.3MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 239.78ms. Allocated memory is still 192.9MB. Free memory was 90.1MB in the beginning and 136.4MB in the end (delta: -46.3MB). Peak memory consumption was 55.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 378.58ms. Allocated memory is still 192.9MB. Free memory was 136.4MB in the beginning and 126.7MB in the end (delta: 9.7MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. * IcfgBuilder took 2622.80ms. Allocated memory was 192.9MB in the beginning and 310.4MB in the end (delta: 117.4MB). Free memory was 126.7MB in the beginning and 146.9MB in the end (delta: -20.2MB). Peak memory consumption was 118.1MB. Max. memory is 16.1GB. * TraceAbstraction took 41850.46ms. Allocated memory was 310.4MB in the beginning and 1.1GB in the end (delta: 813.7MB). Free memory was 146.9MB in the beginning and 590.6MB in the end (delta: -443.6MB). Peak memory consumption was 636.3MB. Max. memory is 16.1GB. * Witness Printer took 249.04ms. Allocated memory is still 1.1GB. Free memory was 590.6MB in the beginning and 563.4MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 188]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 427 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.7s, OverallIterations: 18, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 27.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7401 SdHoareTripleChecker+Valid, 25.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7401 mSDsluCounter, 6413 SdHoareTripleChecker+Invalid, 21.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 795 mSDsCounter, 3869 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20371 IncrementalHoareTripleChecker+Invalid, 24240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3869 mSolverCounterUnsat, 5618 mSDtfsCounter, 20371 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1311 GetRequests, 1280 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15388occurred in iteration=17, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 12363 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 8974 NumberOfCodeBlocks, 8974 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 9581 ConstructedInterpolants, 0 QuantifiedInterpolants, 22704 SizeOfPredicates, 5 NumberOfNonLiveVariables, 766 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 10574/10691 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-16 04:11:51,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE