./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label03.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e05216e875976d2a927f5405c2e5bc5a3ea5afc4bbe64c3ca3f67a96ae3961 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:56:10,336 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:56:10,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:56:10,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:56:10,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:56:10,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:56:10,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:56:10,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:56:10,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:56:10,457 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:56:10,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:56:10,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:56:10,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:56:10,460 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:56:10,460 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:56:10,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:56:10,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:56:10,463 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:56:10,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:56:10,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:56:10,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:56:10,464 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:56:10,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:56:10,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:56:10,469 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:56:10,469 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:56:10,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:56:10,469 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:56:10,470 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:56:10,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:56:10,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:56:10,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:56:10,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:56:10,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:56:10,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:56:10,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:56:10,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:56:10,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:56:10,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:56:10,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:56:10,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:56:10,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:56:10,475 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26e05216e875976d2a927f5405c2e5bc5a3ea5afc4bbe64c3ca3f67a96ae3961 [2024-10-10 23:56:10,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:56:10,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:56:10,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:56:10,749 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:56:10,750 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:56:10,751 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label03.c [2024-10-10 23:56:12,173 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:56:12,752 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:56:12,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label03.c [2024-10-10 23:56:12,810 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b6e4830ae/d7c3aaf0838d4a8abc46cd3dab6038d0/FLAG777470110 [2024-10-10 23:56:13,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b6e4830ae/d7c3aaf0838d4a8abc46cd3dab6038d0 [2024-10-10 23:56:13,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:56:13,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:56:13,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:56:13,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:56:13,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:56:13,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:56:13" (1/1) ... [2024-10-10 23:56:13,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@183d4d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:56:13, skipping insertion in model container [2024-10-10 23:56:13,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:56:13" (1/1) ... [2024-10-10 23:56:13,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:56:13,746 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label03.c[7444,7457] [2024-10-10 23:56:14,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:56:14,976 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:56:15,005 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label03.c[7444,7457] [2024-10-10 23:56:15,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:56:15,731 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:56:15,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:56:15 WrapperNode [2024-10-10 23:56:15,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:56:15,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:56:15,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:56:15,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:56:15,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:56:15" (1/1) ... [2024-10-10 23:56:15,877 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:56:15" (1/1) ... [2024-10-10 23:56:16,785 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9431 [2024-10-10 23:56:16,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:56:16,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:56:16,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:56:16,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:56:16,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:56:15" (1/1) ... [2024-10-10 23:56:16,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:56:15" (1/1) ... [2024-10-10 23:56:17,066 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:56:15" (1/1) ... [2024-10-10 23:56:17,410 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:56:17,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:56:15" (1/1) ... [2024-10-10 23:56:17,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:56:15" (1/1) ... [2024-10-10 23:56:17,719 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:56:15" (1/1) ... [2024-10-10 23:56:17,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:56:15" (1/1) ... [2024-10-10 23:56:17,813 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:56:15" (1/1) ... [2024-10-10 23:56:17,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:56:15" (1/1) ... [2024-10-10 23:56:17,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:56:17,983 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:56:17,983 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:56:17,984 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:56:17,985 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:56:15" (1/1) ... [2024-10-10 23:56:17,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:56:18,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:56:18,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:56:18,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:56:18,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:56:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:56:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:56:18,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:56:18,169 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:56:18,171 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:56:25,768 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2024-10-10 23:56:25,769 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:56:25,861 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:56:25,863 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:56:25,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:56:25 BoogieIcfgContainer [2024-10-10 23:56:25,864 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:56:25,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:56:25,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:56:25,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:56:25,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:56:13" (1/3) ... [2024-10-10 23:56:25,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac36b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:56:25, skipping insertion in model container [2024-10-10 23:56:25,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:56:15" (2/3) ... [2024-10-10 23:56:25,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac36b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:56:25, skipping insertion in model container [2024-10-10 23:56:25,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:56:25" (3/3) ... [2024-10-10 23:56:25,873 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem19_label03.c [2024-10-10 23:56:25,891 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:56:25,891 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:56:26,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:56:26,015 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;@505cc5c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:56:26,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:56:26,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 1686 states, 1684 states have (on average 1.902019002375297) internal successors, (3203), 1685 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:26,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-10 23:56:26,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:56:26,037 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] [2024-10-10 23:56:26,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:56:26,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:56:26,045 INFO L85 PathProgramCache]: Analyzing trace with hash 671291313, now seen corresponding path program 1 times [2024-10-10 23:56:26,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:56:26,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476493801] [2024-10-10 23:56:26,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:56:26,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:56:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:56:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:56:26,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:56:26,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476493801] [2024-10-10 23:56:26,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476493801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:56:26,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:56:26,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:56:26,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682917533] [2024-10-10 23:56:26,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:56:26,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:56:26,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:56:26,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:56:26,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:56:26,307 INFO L87 Difference]: Start difference. First operand has 1686 states, 1684 states have (on average 1.902019002375297) internal successors, (3203), 1685 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:26,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:56:26,433 INFO L93 Difference]: Finished difference Result 3371 states and 6405 transitions. [2024-10-10 23:56:26,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:56:26,436 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-10-10 23:56:26,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:56:26,468 INFO L225 Difference]: With dead ends: 3371 [2024-10-10 23:56:26,469 INFO L226 Difference]: Without dead ends: 1684 [2024-10-10 23:56:26,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:56:26,481 INFO L432 NwaCegarLoop]: 3138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3138 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:56:26,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3138 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:56:26,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2024-10-10 23:56:26,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2024-10-10 23:56:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.8645276292335116) internal successors, (3138), 1683 states have internal predecessors, (3138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:26,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 3138 transitions. [2024-10-10 23:56:26,610 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 3138 transitions. Word has length 56 [2024-10-10 23:56:26,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:56:26,610 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 3138 transitions. [2024-10-10 23:56:26,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:26,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 3138 transitions. [2024-10-10 23:56:26,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-10 23:56:26,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:56:26,616 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] [2024-10-10 23:56:26,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:56:26,616 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:56:26,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:56:26,617 INFO L85 PathProgramCache]: Analyzing trace with hash -134463984, now seen corresponding path program 1 times [2024-10-10 23:56:26,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:56:26,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259676364] [2024-10-10 23:56:26,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:56:26,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:56:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:56:27,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:56:27,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:56:27,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259676364] [2024-10-10 23:56:27,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259676364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:56:27,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:56:27,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:56:27,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26574091] [2024-10-10 23:56:27,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:56:27,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:56:27,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:56:27,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:56:27,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:56:27,035 INFO L87 Difference]: Start difference. First operand 1684 states and 3138 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:38,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:56:38,424 INFO L93 Difference]: Finished difference Result 6149 states and 11654 transitions. [2024-10-10 23:56:38,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:56:38,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-10-10 23:56:38,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:56:38,444 INFO L225 Difference]: With dead ends: 6149 [2024-10-10 23:56:38,444 INFO L226 Difference]: Without dead ends: 4466 [2024-10-10 23:56:38,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:56:38,452 INFO L432 NwaCegarLoop]: 1749 mSDtfsCounter, 4213 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 10668 mSolverCounterSat, 2237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4213 SdHoareTripleChecker+Valid, 2018 SdHoareTripleChecker+Invalid, 12905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2237 IncrementalHoareTripleChecker+Valid, 10668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:56:38,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4213 Valid, 2018 Invalid, 12905 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2237 Valid, 10668 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2024-10-10 23:56:38,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4466 states. [2024-10-10 23:56:38,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4466 to 4464. [2024-10-10 23:56:38,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4464 states, 4463 states have (on average 1.5646426170737173) internal successors, (6983), 4463 states have internal predecessors, (6983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:38,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4464 states to 4464 states and 6983 transitions. [2024-10-10 23:56:38,573 INFO L78 Accepts]: Start accepts. Automaton has 4464 states and 6983 transitions. Word has length 56 [2024-10-10 23:56:38,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:56:38,573 INFO L471 AbstractCegarLoop]: Abstraction has 4464 states and 6983 transitions. [2024-10-10 23:56:38,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 4464 states and 6983 transitions. [2024-10-10 23:56:38,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-10-10 23:56:38,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:56:38,581 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:56:38,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:56:38,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:56:38,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:56:38,586 INFO L85 PathProgramCache]: Analyzing trace with hash -138637276, now seen corresponding path program 1 times [2024-10-10 23:56:38,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:56:38,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384750482] [2024-10-10 23:56:38,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:56:38,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:56:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:56:39,656 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:56:39,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:56:39,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384750482] [2024-10-10 23:56:39,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384750482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:56:39,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:56:39,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:56:39,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408562032] [2024-10-10 23:56:39,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:56:39,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:56:39,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:56:39,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:56:39,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:56:39,663 INFO L87 Difference]: Start difference. First operand 4464 states and 6983 transitions. Second operand has 4 states, 4 states have (on average 65.75) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:48,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:56:48,490 INFO L93 Difference]: Finished difference Result 11707 states and 20175 transitions. [2024-10-10 23:56:48,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:56:48,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.75) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 263 [2024-10-10 23:56:48,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:56:48,522 INFO L225 Difference]: With dead ends: 11707 [2024-10-10 23:56:48,522 INFO L226 Difference]: Without dead ends: 8609 [2024-10-10 23:56:48,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:56:48,531 INFO L432 NwaCegarLoop]: 1802 mSDtfsCounter, 3757 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 9458 mSolverCounterSat, 1336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3757 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 10794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1336 IncrementalHoareTripleChecker+Valid, 9458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:56:48,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3757 Valid, 2157 Invalid, 10794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1336 Valid, 9458 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2024-10-10 23:56:48,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8609 states. [2024-10-10 23:56:48,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8609 to 8593. [2024-10-10 23:56:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8593 states, 8592 states have (on average 1.3482309124767224) internal successors, (11584), 8592 states have internal predecessors, (11584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:48,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8593 states to 8593 states and 11584 transitions. [2024-10-10 23:56:48,691 INFO L78 Accepts]: Start accepts. Automaton has 8593 states and 11584 transitions. Word has length 263 [2024-10-10 23:56:48,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:56:48,691 INFO L471 AbstractCegarLoop]: Abstraction has 8593 states and 11584 transitions. [2024-10-10 23:56:48,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.75) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 8593 states and 11584 transitions. [2024-10-10 23:56:48,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-10-10 23:56:48,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:56:48,696 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:56:48,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:56:48,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:56:48,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:56:48,697 INFO L85 PathProgramCache]: Analyzing trace with hash 420223370, now seen corresponding path program 1 times [2024-10-10 23:56:48,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:56:48,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391528554] [2024-10-10 23:56:48,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:56:48,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:56:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:56:49,310 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:56:49,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:56:49,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391528554] [2024-10-10 23:56:49,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391528554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:56:49,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:56:49,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:56:49,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128800481] [2024-10-10 23:56:49,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:56:49,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:56:49,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:56:49,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:56:49,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:56:49,316 INFO L87 Difference]: Start difference. First operand 8593 states and 11584 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:54,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:56:54,138 INFO L93 Difference]: Finished difference Result 14486 states and 20450 transitions. [2024-10-10 23:56:54,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:56:54,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 291 [2024-10-10 23:56:54,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:56:54,169 INFO L225 Difference]: With dead ends: 14486 [2024-10-10 23:56:54,170 INFO L226 Difference]: Without dead ends: 8593 [2024-10-10 23:56:54,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:56:54,182 INFO L432 NwaCegarLoop]: 1773 mSDtfsCounter, 1151 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 5716 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1951 SdHoareTripleChecker+Invalid, 5724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:56:54,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1951 Invalid, 5724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 5716 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-10 23:56:54,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8593 states. [2024-10-10 23:56:54,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8593 to 8593. [2024-10-10 23:56:54,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8593 states, 8592 states have (on average 1.3467178770949721) internal successors, (11571), 8592 states have internal predecessors, (11571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8593 states to 8593 states and 11571 transitions. [2024-10-10 23:56:54,357 INFO L78 Accepts]: Start accepts. Automaton has 8593 states and 11571 transitions. Word has length 291 [2024-10-10 23:56:54,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:56:54,358 INFO L471 AbstractCegarLoop]: Abstraction has 8593 states and 11571 transitions. [2024-10-10 23:56:54,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:54,359 INFO L276 IsEmpty]: Start isEmpty. Operand 8593 states and 11571 transitions. [2024-10-10 23:56:54,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2024-10-10 23:56:54,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:56:54,370 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:56:54,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:56:54,371 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:56:54,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:56:54,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1849662066, now seen corresponding path program 1 times [2024-10-10 23:56:54,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:56:54,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136414268] [2024-10-10 23:56:54,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:56:54,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:56:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:56:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-10 23:56:54,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:56:54,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136414268] [2024-10-10 23:56:54,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136414268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:56:54,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:56:54,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:56:54,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454403846] [2024-10-10 23:56:54,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:56:54,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:56:54,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:56:54,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:56:54,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:56:54,982 INFO L87 Difference]: Start difference. First operand 8593 states and 11571 transitions. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 2 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:57:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:57:00,711 INFO L93 Difference]: Finished difference Result 20122 states and 28983 transitions. [2024-10-10 23:57:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:57:00,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 2 states have internal predecessors, (545), 0 states have call successors, (0), 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 612 [2024-10-10 23:57:00,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:57:00,752 INFO L225 Difference]: With dead ends: 20122 [2024-10-10 23:57:00,752 INFO L226 Difference]: Without dead ends: 14260 [2024-10-10 23:57:00,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:57:00,765 INFO L432 NwaCegarLoop]: 1336 mSDtfsCounter, 1356 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 4197 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 5627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:57:00,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1356 Valid, 1608 Invalid, 5627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4197 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-10-10 23:57:00,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14260 states. [2024-10-10 23:57:00,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14260 to 14243. [2024-10-10 23:57:00,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14243 states, 14242 states have (on average 1.2723634321022328) internal successors, (18121), 14242 states have internal predecessors, (18121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:57:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14243 states to 14243 states and 18121 transitions. [2024-10-10 23:57:00,990 INFO L78 Accepts]: Start accepts. Automaton has 14243 states and 18121 transitions. Word has length 612 [2024-10-10 23:57:00,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:57:00,991 INFO L471 AbstractCegarLoop]: Abstraction has 14243 states and 18121 transitions. [2024-10-10 23:57:00,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 2 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:57:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 14243 states and 18121 transitions. [2024-10-10 23:57:01,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2024-10-10 23:57:01,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:57:01,004 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:57:01,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:57:01,004 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:57:01,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:57:01,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1678200381, now seen corresponding path program 1 times [2024-10-10 23:57:01,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:57:01,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939916231] [2024-10-10 23:57:01,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:57:01,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:57:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:57:01,475 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-10 23:57:01,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:57:01,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939916231] [2024-10-10 23:57:01,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939916231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:57:01,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:57:01,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:57:01,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250555507] [2024-10-10 23:57:01,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:57:01,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:57:01,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:57:01,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:57:01,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:57:01,480 INFO L87 Difference]: Start difference. First operand 14243 states and 18121 transitions. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 2 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:57:06,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:57:06,896 INFO L93 Difference]: Finished difference Result 28510 states and 37632 transitions. [2024-10-10 23:57:06,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:57:06,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 2 states have internal predecessors, (545), 0 states have call successors, (0), 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 617 [2024-10-10 23:57:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:57:06,927 INFO L225 Difference]: With dead ends: 28510 [2024-10-10 23:57:06,927 INFO L226 Difference]: Without dead ends: 16998 [2024-10-10 23:57:06,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:57:06,939 INFO L432 NwaCegarLoop]: 704 mSDtfsCounter, 1387 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 3928 mSolverCounterSat, 2123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 6051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2123 IncrementalHoareTripleChecker+Valid, 3928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:57:06,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1387 Valid, 755 Invalid, 6051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2123 Valid, 3928 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-10-10 23:57:06,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16998 states. [2024-10-10 23:57:07,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16998 to 16984. [2024-10-10 23:57:07,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16984 states, 16983 states have (on average 1.270859094388506) internal successors, (21583), 16983 states have internal predecessors, (21583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:57:07,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16984 states to 16984 states and 21583 transitions. [2024-10-10 23:57:07,162 INFO L78 Accepts]: Start accepts. Automaton has 16984 states and 21583 transitions. Word has length 617 [2024-10-10 23:57:07,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:57:07,164 INFO L471 AbstractCegarLoop]: Abstraction has 16984 states and 21583 transitions. [2024-10-10 23:57:07,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 2 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:57:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 16984 states and 21583 transitions. [2024-10-10 23:57:07,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2024-10-10 23:57:07,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:57:07,175 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:57:07,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:57:07,176 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:57:07,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:57:07,177 INFO L85 PathProgramCache]: Analyzing trace with hash 586504710, now seen corresponding path program 1 times [2024-10-10 23:57:07,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:57:07,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819384061] [2024-10-10 23:57:07,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:57:07,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:57:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:57:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-10 23:57:07,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:57:07,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819384061] [2024-10-10 23:57:07,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819384061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:57:07,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:57:07,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:57:07,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43328155] [2024-10-10 23:57:07,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:57:07,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:57:07,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:57:07,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:57:07,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:57:07,643 INFO L87 Difference]: Start difference. First operand 16984 states and 21583 transitions. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 2 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:57:13,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:57:13,345 INFO L93 Difference]: Finished difference Result 43709 states and 57269 transitions. [2024-10-10 23:57:13,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:57:13,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 2 states have internal predecessors, (545), 0 states have call successors, (0), 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 620 [2024-10-10 23:57:13,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:57:13,400 INFO L225 Difference]: With dead ends: 43709 [2024-10-10 23:57:13,400 INFO L226 Difference]: Without dead ends: 29456 [2024-10-10 23:57:13,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:57:13,422 INFO L432 NwaCegarLoop]: 713 mSDtfsCounter, 2112 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 5115 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2112 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 5549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:57:13,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2112 Valid, 983 Invalid, 5549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5115 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-10 23:57:13,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29456 states. [2024-10-10 23:57:13,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29456 to 29453. [2024-10-10 23:57:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29453 states, 29452 states have (on average 1.2557041966589706) internal successors, (36983), 29452 states have internal predecessors, (36983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:57:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29453 states to 29453 states and 36983 transitions. [2024-10-10 23:57:13,774 INFO L78 Accepts]: Start accepts. Automaton has 29453 states and 36983 transitions. Word has length 620 [2024-10-10 23:57:13,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:57:13,775 INFO L471 AbstractCegarLoop]: Abstraction has 29453 states and 36983 transitions. [2024-10-10 23:57:13,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 2 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:57:13,775 INFO L276 IsEmpty]: Start isEmpty. Operand 29453 states and 36983 transitions. [2024-10-10 23:57:13,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2024-10-10 23:57:13,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:57:13,788 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:57:13,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:57:13,788 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:57:13,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:57:13,789 INFO L85 PathProgramCache]: Analyzing trace with hash 434625020, now seen corresponding path program 1 times [2024-10-10 23:57:13,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:57:13,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796707065] [2024-10-10 23:57:13,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:57:13,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:57:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:57:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:57:15,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:57:15,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796707065] [2024-10-10 23:57:15,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796707065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:57:15,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:57:15,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:57:15,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119563880] [2024-10-10 23:57:15,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:57:15,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 23:57:15,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:57:15,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 23:57:15,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:57:15,044 INFO L87 Difference]: Start difference. First operand 29453 states and 36983 transitions. Second operand has 5 states, 5 states have (on average 129.4) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:57:21,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:57:21,755 INFO L93 Difference]: Finished difference Result 63036 states and 78528 transitions. [2024-10-10 23:57:21,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 23:57:21,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 129.4) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 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 647 [2024-10-10 23:57:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:57:21,813 INFO L225 Difference]: With dead ends: 63036 [2024-10-10 23:57:21,813 INFO L226 Difference]: Without dead ends: 36288 [2024-10-10 23:57:21,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:57:21,844 INFO L432 NwaCegarLoop]: 1652 mSDtfsCounter, 2272 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 8656 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2272 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 8845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 8656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:57:21,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2272 Valid, 1858 Invalid, 8845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 8656 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-10-10 23:57:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36288 states. [2024-10-10 23:57:22,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36288 to 34920. [2024-10-10 23:57:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34920 states, 34919 states have (on average 1.2224576877917466) internal successors, (42687), 34919 states have internal predecessors, (42687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:57:22,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34920 states to 34920 states and 42687 transitions. [2024-10-10 23:57:22,416 INFO L78 Accepts]: Start accepts. Automaton has 34920 states and 42687 transitions. Word has length 647 [2024-10-10 23:57:22,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:57:22,417 INFO L471 AbstractCegarLoop]: Abstraction has 34920 states and 42687 transitions. [2024-10-10 23:57:22,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.4) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:57:22,417 INFO L276 IsEmpty]: Start isEmpty. Operand 34920 states and 42687 transitions. [2024-10-10 23:57:22,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2024-10-10 23:57:22,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:57:22,425 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:57:22,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:57:22,425 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:57:22,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:57:22,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1999002058, now seen corresponding path program 1 times [2024-10-10 23:57:22,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:57:22,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659750430] [2024-10-10 23:57:22,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:57:22,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:57:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:57:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 113 proven. 51 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2024-10-10 23:57:23,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:57:23,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659750430] [2024-10-10 23:57:23,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659750430] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:57:23,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266317937] [2024-10-10 23:57:23,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:57:23,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:57:23,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:57:23,546 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:57:23,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:57:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:57:23,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:57:23,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:57:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2024-10-10 23:57:24,051 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:57:24,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266317937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:57:24,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:57:24,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:57:24,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93242533] [2024-10-10 23:57:24,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:57:24,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:57:24,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:57:24,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:57:24,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:57:24,054 INFO L87 Difference]: Start difference. First operand 34920 states and 42687 transitions. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)