./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label19.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dbab4b57592d1cd844f46032ce61618d4e076adc5adb242b34e740348fe0a295 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:29:44,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:29:44,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:29:44,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:29:44,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:29:44,402 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:29:44,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:29:44,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:29:44,404 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:29:44,405 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:29:44,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:29:44,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:29:44,407 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:29:44,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:29:44,407 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:29:44,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:29:44,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:29:44,410 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:29:44,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:29:44,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:29:44,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:29:44,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:29:44,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:29:44,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:29:44,414 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:29:44,414 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:29:44,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:29:44,415 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:29:44,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:29:44,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:29:44,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:29:44,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:29:44,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:29:44,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:29:44,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:29:44,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:29:44,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:29:44,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:29:44,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:29:44,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:29:44,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:29:44,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:29:44,417 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dbab4b57592d1cd844f46032ce61618d4e076adc5adb242b34e740348fe0a295 [2024-11-08 10:29:44,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:29:44,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:29:44,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:29:44,666 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:29:44,669 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:29:44,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label19.c [2024-11-08 10:29:46,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:29:46,415 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:29:46,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label19.c [2024-11-08 10:29:46,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83336051e/27c9f57e822c402e9753a88fe8844dee/FLAG48b5df9e5 [2024-11-08 10:29:46,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83336051e/27c9f57e822c402e9753a88fe8844dee [2024-11-08 10:29:46,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:29:46,498 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:29:46,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:29:46,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:29:46,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:29:46,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:29:46" (1/1) ... [2024-11-08 10:29:46,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5413cb6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:46, skipping insertion in model container [2024-11-08 10:29:46,515 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:29:46" (1/1) ... [2024-11-08 10:29:46,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:29:47,042 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label19.c[59475,59488] [2024-11-08 10:29:47,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:29:47,079 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:29:47,350 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label19.c[59475,59488] [2024-11-08 10:29:47,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:29:47,405 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:29:47,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:47 WrapperNode [2024-11-08 10:29:47,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:29:47,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:29:47,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:29:47,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:29:47,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:47" (1/1) ... [2024-11-08 10:29:47,473 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:47" (1/1) ... [2024-11-08 10:29:47,626 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-11-08 10:29:47,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:29:47,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:29:47,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:29:47,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:29:47,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:47" (1/1) ... [2024-11-08 10:29:47,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:47" (1/1) ... [2024-11-08 10:29:47,665 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:47" (1/1) ... [2024-11-08 10:29:47,731 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:29:47,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:47" (1/1) ... [2024-11-08 10:29:47,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:47" (1/1) ... [2024-11-08 10:29:47,799 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:47" (1/1) ... [2024-11-08 10:29:47,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:47" (1/1) ... [2024-11-08 10:29:47,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:47" (1/1) ... [2024-11-08 10:29:47,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:47" (1/1) ... [2024-11-08 10:29:47,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:29:47,870 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:29:47,870 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:29:47,870 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:29:47,871 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:47" (1/1) ... [2024-11-08 10:29:47,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:29:47,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:29:47,901 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:29:47,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:29:47,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:29:47,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:29:47,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:29:47,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:29:48,016 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:29:48,018 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:29:49,450 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-08 10:29:49,450 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:29:49,470 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:29:49,471 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:29:49,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:29:49 BoogieIcfgContainer [2024-11-08 10:29:49,472 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:29:49,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:29:49,474 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:29:49,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:29:49,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:29:46" (1/3) ... [2024-11-08 10:29:49,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17363b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:29:49, skipping insertion in model container [2024-11-08 10:29:49,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:47" (2/3) ... [2024-11-08 10:29:49,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17363b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:29:49, skipping insertion in model container [2024-11-08 10:29:49,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:29:49" (3/3) ... [2024-11-08 10:29:49,479 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label19.c [2024-11-08 10:29:49,492 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:29:49,493 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:29:49,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:29:49,558 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;@1f0a2190, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:29:49,558 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:29:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:49,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 10:29:49,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:49,585 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:49,585 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:49,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:49,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1077687485, now seen corresponding path program 1 times [2024-11-08 10:29:49,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:49,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489864177] [2024-11-08 10:29:49,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:49,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:50,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:29:50,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:50,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489864177] [2024-11-08 10:29:50,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489864177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:50,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:50,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:29:50,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724282286] [2024-11-08 10:29:50,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:50,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:50,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:50,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:50,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:50,265 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:51,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:51,230 INFO L93 Difference]: Finished difference Result 857 states and 1498 transitions. [2024-11-08 10:29:51,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:51,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 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 187 [2024-11-08 10:29:51,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:51,258 INFO L225 Difference]: With dead ends: 857 [2024-11-08 10:29:51,258 INFO L226 Difference]: Without dead ends: 462 [2024-11-08 10:29:51,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:51,267 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 101 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:51,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 187 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 10:29:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-08 10:29:51,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2024-11-08 10:29:51,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 1.5381263616557734) internal successors, (706), 459 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:51,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 706 transitions. [2024-11-08 10:29:51,318 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 706 transitions. Word has length 187 [2024-11-08 10:29:51,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:51,319 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 706 transitions. [2024-11-08 10:29:51,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:51,319 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 706 transitions. [2024-11-08 10:29:51,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-08 10:29:51,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:51,322 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 10:29:51,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:29:51,323 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:51,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash 365635140, now seen corresponding path program 1 times [2024-11-08 10:29:51,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:51,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693483814] [2024-11-08 10:29:51,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:51,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:51,522 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:29:51,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:51,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693483814] [2024-11-08 10:29:51,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693483814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:51,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:51,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:29:51,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087140557] [2024-11-08 10:29:51,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:51,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:51,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:51,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:51,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:51,525 INFO L87 Difference]: Start difference. First operand 460 states and 706 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:52,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:52,227 INFO L93 Difference]: Finished difference Result 1344 states and 2079 transitions. [2024-11-08 10:29:52,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:52,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 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 195 [2024-11-08 10:29:52,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:52,232 INFO L225 Difference]: With dead ends: 1344 [2024-11-08 10:29:52,232 INFO L226 Difference]: Without dead ends: 886 [2024-11-08 10:29:52,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:52,237 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:52,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 90 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:29:52,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-11-08 10:29:52,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 870. [2024-11-08 10:29:52,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 1.5132336018411967) internal successors, (1315), 869 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:52,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1315 transitions. [2024-11-08 10:29:52,285 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1315 transitions. Word has length 195 [2024-11-08 10:29:52,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:52,287 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1315 transitions. [2024-11-08 10:29:52,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:52,288 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1315 transitions. [2024-11-08 10:29:52,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-08 10:29:52,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:52,297 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-11-08 10:29:52,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:29:52,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:52,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:52,298 INFO L85 PathProgramCache]: Analyzing trace with hash 750887865, now seen corresponding path program 1 times [2024-11-08 10:29:52,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:52,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742545860] [2024-11-08 10:29:52,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:52,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:29:53,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:53,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742545860] [2024-11-08 10:29:53,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742545860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:53,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:53,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:29:53,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170266276] [2024-11-08 10:29:53,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:53,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:29:53,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:53,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:29:53,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:29:53,373 INFO L87 Difference]: Start difference. First operand 870 states and 1315 transitions. Second operand has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:54,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:54,088 INFO L93 Difference]: Finished difference Result 1884 states and 2886 transitions. [2024-11-08 10:29:54,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:29:54,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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 202 [2024-11-08 10:29:54,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:54,092 INFO L225 Difference]: With dead ends: 1884 [2024-11-08 10:29:54,092 INFO L226 Difference]: Without dead ends: 842 [2024-11-08 10:29:54,093 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-11-08 10:29:54,094 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 299 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:54,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 47 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:29:54,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2024-11-08 10:29:54,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2024-11-08 10:29:54,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 1.3650416171224733) internal successors, (1148), 841 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:54,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1148 transitions. [2024-11-08 10:29:54,108 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1148 transitions. Word has length 202 [2024-11-08 10:29:54,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:54,108 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1148 transitions. [2024-11-08 10:29:54,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:54,109 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1148 transitions. [2024-11-08 10:29:54,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 10:29:54,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:54,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:54,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:29:54,111 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:54,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:54,112 INFO L85 PathProgramCache]: Analyzing trace with hash 2085657216, now seen corresponding path program 1 times [2024-11-08 10:29:54,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:54,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242250959] [2024-11-08 10:29:54,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:54,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:29:54,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:54,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242250959] [2024-11-08 10:29:54,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242250959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:54,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:54,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:29:54,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388282214] [2024-11-08 10:29:54,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:54,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:54,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:54,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:54,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:54,288 INFO L87 Difference]: Start difference. First operand 842 states and 1148 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:54,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:54,808 INFO L93 Difference]: Finished difference Result 2506 states and 3421 transitions. [2024-11-08 10:29:54,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:54,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 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 210 [2024-11-08 10:29:54,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:54,813 INFO L225 Difference]: With dead ends: 2506 [2024-11-08 10:29:54,813 INFO L226 Difference]: Without dead ends: 1666 [2024-11-08 10:29:54,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:54,815 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 229 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:54,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 71 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:29:54,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2024-11-08 10:29:54,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1663. [2024-11-08 10:29:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1662 states have (on average 1.325511432009627) internal successors, (2203), 1662 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2203 transitions. [2024-11-08 10:29:54,838 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2203 transitions. Word has length 210 [2024-11-08 10:29:54,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:54,839 INFO L471 AbstractCegarLoop]: Abstraction has 1663 states and 2203 transitions. [2024-11-08 10:29:54,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2203 transitions. [2024-11-08 10:29:54,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 10:29:54,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:54,842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:54,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:29:54,843 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:54,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:54,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2117214179, now seen corresponding path program 1 times [2024-11-08 10:29:54,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:54,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343912881] [2024-11-08 10:29:54,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:54,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:29:55,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:55,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343912881] [2024-11-08 10:29:55,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343912881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:55,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:55,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:29:55,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313588790] [2024-11-08 10:29:55,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:55,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:55,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:55,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:55,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:55,064 INFO L87 Difference]: Start difference. First operand 1663 states and 2203 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:55,618 INFO L93 Difference]: Finished difference Result 4156 states and 5494 transitions. [2024-11-08 10:29:55,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:55,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 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 215 [2024-11-08 10:29:55,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:55,625 INFO L225 Difference]: With dead ends: 4156 [2024-11-08 10:29:55,625 INFO L226 Difference]: Without dead ends: 2495 [2024-11-08 10:29:55,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:55,628 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 203 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:55,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 57 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:29:55,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2024-11-08 10:29:55,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2492. [2024-11-08 10:29:55,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2492 states, 2491 states have (on average 1.3167402649538338) internal successors, (3280), 2491 states have internal predecessors, (3280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:55,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 3280 transitions. [2024-11-08 10:29:55,659 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 3280 transitions. Word has length 215 [2024-11-08 10:29:55,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:55,660 INFO L471 AbstractCegarLoop]: Abstraction has 2492 states and 3280 transitions. [2024-11-08 10:29:55,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 3280 transitions. [2024-11-08 10:29:55,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-08 10:29:55,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:55,664 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:55,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:29:55,664 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:55,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:55,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1414138644, now seen corresponding path program 1 times [2024-11-08 10:29:55,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:55,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739995986] [2024-11-08 10:29:55,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:55,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:56,083 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:29:56,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:56,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739995986] [2024-11-08 10:29:56,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739995986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:56,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:56,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:29:56,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217693542] [2024-11-08 10:29:56,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:56,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:29:56,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:56,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:29:56,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:29:56,086 INFO L87 Difference]: Start difference. First operand 2492 states and 3280 transitions. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:56,986 INFO L93 Difference]: Finished difference Result 6979 states and 9220 transitions. [2024-11-08 10:29:56,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:29:56,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 218 [2024-11-08 10:29:56,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:56,997 INFO L225 Difference]: With dead ends: 6979 [2024-11-08 10:29:56,997 INFO L226 Difference]: Without dead ends: 4141 [2024-11-08 10:29:57,001 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-11-08 10:29:57,002 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 194 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:57,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 121 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:29:57,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2024-11-08 10:29:57,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 4140. [2024-11-08 10:29:57,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4140 states, 4139 states have (on average 1.2974148345010872) internal successors, (5370), 4139 states have internal predecessors, (5370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:57,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 5370 transitions. [2024-11-08 10:29:57,063 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 5370 transitions. Word has length 218 [2024-11-08 10:29:57,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:57,063 INFO L471 AbstractCegarLoop]: Abstraction has 4140 states and 5370 transitions. [2024-11-08 10:29:57,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:57,063 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 5370 transitions. [2024-11-08 10:29:57,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-08 10:29:57,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:57,071 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:57,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:29:57,071 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:57,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:57,072 INFO L85 PathProgramCache]: Analyzing trace with hash -208924398, now seen corresponding path program 1 times [2024-11-08 10:29:57,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:57,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547651638] [2024-11-08 10:29:57,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:57,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:57,339 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:29:57,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:57,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547651638] [2024-11-08 10:29:57,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547651638] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:29:57,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305271917] [2024-11-08 10:29:57,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:57,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:29:57,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:29:57,342 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:29:57,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 10:29:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:57,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 10:29:57,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:29:57,616 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:29:57,617 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:29:57,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305271917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:57,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:29:57,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:29:57,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629602212] [2024-11-08 10:29:57,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:57,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:29:57,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:57,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:29:57,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:29:57,620 INFO L87 Difference]: Start difference. First operand 4140 states and 5370 transitions. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:58,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:58,402 INFO L93 Difference]: Finished difference Result 14606 states and 18960 transitions. [2024-11-08 10:29:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:29:58,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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 222 [2024-11-08 10:29:58,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:58,429 INFO L225 Difference]: With dead ends: 14606 [2024-11-08 10:29:58,430 INFO L226 Difference]: Without dead ends: 10468 [2024-11-08 10:29:58,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:29:58,437 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 491 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:58,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 294 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:29:58,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10468 states. [2024-11-08 10:29:58,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10468 to 10460. [2024-11-08 10:29:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10460 states, 10459 states have (on average 1.2783248876565638) internal successors, (13370), 10459 states have internal predecessors, (13370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:58,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10460 states to 10460 states and 13370 transitions. [2024-11-08 10:29:58,635 INFO L78 Accepts]: Start accepts. Automaton has 10460 states and 13370 transitions. Word has length 222 [2024-11-08 10:29:58,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:58,635 INFO L471 AbstractCegarLoop]: Abstraction has 10460 states and 13370 transitions. [2024-11-08 10:29:58,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:58,636 INFO L276 IsEmpty]: Start isEmpty. Operand 10460 states and 13370 transitions. [2024-11-08 10:29:58,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-08 10:29:58,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:58,649 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:58,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 10:29:58,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:29:58,855 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:58,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:58,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1207092737, now seen corresponding path program 1 times [2024-11-08 10:29:58,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:58,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720745107] [2024-11-08 10:29:58,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:58,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:29:59,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:59,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720745107] [2024-11-08 10:29:59,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720745107] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:29:59,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509242596] [2024-11-08 10:29:59,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:59,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:29:59,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:29:59,209 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:29:59,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 10:29:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:59,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:29:59,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:29:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-08 10:29:59,636 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:29:59,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509242596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:59,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:29:59,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:29:59,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583684990] [2024-11-08 10:29:59,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:59,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:59,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:59,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:59,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:29:59,638 INFO L87 Difference]: Start difference. First operand 10460 states and 13370 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:00,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:00,333 INFO L93 Difference]: Finished difference Result 20932 states and 26763 transitions. [2024-11-08 10:30:00,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:00,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 225 [2024-11-08 10:30:00,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:00,378 INFO L225 Difference]: With dead ends: 20932 [2024-11-08 10:30:00,378 INFO L226 Difference]: Without dead ends: 10474 [2024-11-08 10:30:00,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:00,402 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 37 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:00,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 299 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:30:00,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10474 states. [2024-11-08 10:30:00,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10474 to 10460. [2024-11-08 10:30:00,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10460 states, 10459 states have (on average 1.268381298403289) internal successors, (13266), 10459 states have internal predecessors, (13266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:00,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10460 states to 10460 states and 13266 transitions. [2024-11-08 10:30:00,680 INFO L78 Accepts]: Start accepts. Automaton has 10460 states and 13266 transitions. Word has length 225 [2024-11-08 10:30:00,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:00,680 INFO L471 AbstractCegarLoop]: Abstraction has 10460 states and 13266 transitions. [2024-11-08 10:30:00,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:00,680 INFO L276 IsEmpty]: Start isEmpty. Operand 10460 states and 13266 transitions. [2024-11-08 10:30:00,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-08 10:30:00,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:00,690 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:00,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 10:30:00,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-08 10:30:00,892 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:00,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:00,892 INFO L85 PathProgramCache]: Analyzing trace with hash 14269427, now seen corresponding path program 1 times [2024-11-08 10:30:00,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:00,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704045136] [2024-11-08 10:30:00,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:00,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:01,297 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 44 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 10:30:01,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:01,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704045136] [2024-11-08 10:30:01,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704045136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:01,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608160079] [2024-11-08 10:30:01,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:01,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:01,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:01,303 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:30:01,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 10:30:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:01,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:30:01,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:30:01,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:30:01,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608160079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:01,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:30:01,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:30:01,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470203477] [2024-11-08 10:30:01,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:01,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:01,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:01,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:01,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:01,438 INFO L87 Difference]: Start difference. First operand 10460 states and 13266 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:02,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:02,063 INFO L93 Difference]: Finished difference Result 31075 states and 39419 transitions. [2024-11-08 10:30:02,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:02,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 231 [2024-11-08 10:30:02,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:02,093 INFO L225 Difference]: With dead ends: 31075 [2024-11-08 10:30:02,093 INFO L226 Difference]: Without dead ends: 20617 [2024-11-08 10:30:02,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:02,106 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 215 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:02,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 340 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:30:02,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20617 states. [2024-11-08 10:30:02,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20617 to 20610. [2024-11-08 10:30:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20610 states, 20609 states have (on average 1.167596681061672) internal successors, (24063), 20609 states have internal predecessors, (24063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20610 states to 20610 states and 24063 transitions. [2024-11-08 10:30:02,355 INFO L78 Accepts]: Start accepts. Automaton has 20610 states and 24063 transitions. Word has length 231 [2024-11-08 10:30:02,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:02,355 INFO L471 AbstractCegarLoop]: Abstraction has 20610 states and 24063 transitions. [2024-11-08 10:30:02,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:02,355 INFO L276 IsEmpty]: Start isEmpty. Operand 20610 states and 24063 transitions. [2024-11-08 10:30:02,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-08 10:30:02,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:02,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:02,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 10:30:02,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:02,576 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:02,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:02,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1528947380, now seen corresponding path program 1 times [2024-11-08 10:30:02,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:02,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658761738] [2024-11-08 10:30:02,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:02,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:30:03,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:03,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658761738] [2024-11-08 10:30:03,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658761738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:03,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:03,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:30:03,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725582851] [2024-11-08 10:30:03,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:03,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:03,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:03,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:03,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:03,054 INFO L87 Difference]: Start difference. First operand 20610 states and 24063 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:03,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:03,773 INFO L93 Difference]: Finished difference Result 59173 states and 69126 transitions. [2024-11-08 10:30:03,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:03,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 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 238 [2024-11-08 10:30:03,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:03,834 INFO L225 Difference]: With dead ends: 59173 [2024-11-08 10:30:03,835 INFO L226 Difference]: Without dead ends: 38565 [2024-11-08 10:30:03,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:03,859 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 210 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:03,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 98 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:30:03,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38565 states. [2024-11-08 10:30:04,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38565 to 38556. [2024-11-08 10:30:04,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38556 states, 38555 states have (on average 1.1630916872001038) internal successors, (44843), 38555 states have internal predecessors, (44843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38556 states to 38556 states and 44843 transitions. [2024-11-08 10:30:04,425 INFO L78 Accepts]: Start accepts. Automaton has 38556 states and 44843 transitions. Word has length 238 [2024-11-08 10:30:04,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:04,425 INFO L471 AbstractCegarLoop]: Abstraction has 38556 states and 44843 transitions. [2024-11-08 10:30:04,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:04,425 INFO L276 IsEmpty]: Start isEmpty. Operand 38556 states and 44843 transitions. [2024-11-08 10:30:04,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-08 10:30:04,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:04,455 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:04,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 10:30:04,456 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:04,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:04,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1288754061, now seen corresponding path program 1 times [2024-11-08 10:30:04,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:04,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161537657] [2024-11-08 10:30:04,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:04,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:04,590 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:30:04,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:04,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161537657] [2024-11-08 10:30:04,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161537657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:04,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:04,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:30:04,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016434248] [2024-11-08 10:30:04,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:04,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:04,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:04,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:04,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:04,591 INFO L87 Difference]: Start difference. First operand 38556 states and 44843 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:04,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:04,991 INFO L93 Difference]: Finished difference Result 113986 states and 132719 transitions. [2024-11-08 10:30:04,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:04,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 241 [2024-11-08 10:30:04,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:05,443 INFO L225 Difference]: With dead ends: 113986 [2024-11-08 10:30:05,444 INFO L226 Difference]: Without dead ends: 75432 [2024-11-08 10:30:05,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:05,465 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 278 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:05,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 793 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:30:05,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75432 states. [2024-11-08 10:30:06,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75432 to 75428. [2024-11-08 10:30:06,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75428 states, 75427 states have (on average 1.1536850199530673) internal successors, (87019), 75427 states have internal predecessors, (87019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75428 states to 75428 states and 87019 transitions. [2024-11-08 10:30:06,818 INFO L78 Accepts]: Start accepts. Automaton has 75428 states and 87019 transitions. Word has length 241 [2024-11-08 10:30:06,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:06,818 INFO L471 AbstractCegarLoop]: Abstraction has 75428 states and 87019 transitions. [2024-11-08 10:30:06,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand 75428 states and 87019 transitions. [2024-11-08 10:30:06,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-08 10:30:06,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:06,855 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:06,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 10:30:06,855 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:06,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:06,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1185215077, now seen corresponding path program 1 times [2024-11-08 10:30:06,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:06,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483007057] [2024-11-08 10:30:06,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:06,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:07,223 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:30:07,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:07,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483007057] [2024-11-08 10:30:07,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483007057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:07,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:07,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:30:07,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586249357] [2024-11-08 10:30:07,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:07,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:07,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:07,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:07,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:07,226 INFO L87 Difference]: Start difference. First operand 75428 states and 87019 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:08,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:08,498 INFO L93 Difference]: Finished difference Result 182319 states and 213128 transitions. [2024-11-08 10:30:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:08,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 241 [2024-11-08 10:30:08,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:08,643 INFO L225 Difference]: With dead ends: 182319 [2024-11-08 10:30:08,643 INFO L226 Difference]: Without dead ends: 106893 [2024-11-08 10:30:08,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:08,688 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 210 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:08,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 129 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:30:08,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106893 states. [2024-11-08 10:30:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106893 to 99585. [2024-11-08 10:30:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99585 states, 99584 states have (on average 1.1284443284061696) internal successors, (112375), 99584 states have internal predecessors, (112375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99585 states to 99585 states and 112375 transitions. [2024-11-08 10:30:10,167 INFO L78 Accepts]: Start accepts. Automaton has 99585 states and 112375 transitions. Word has length 241 [2024-11-08 10:30:10,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:10,167 INFO L471 AbstractCegarLoop]: Abstraction has 99585 states and 112375 transitions. [2024-11-08 10:30:10,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:10,168 INFO L276 IsEmpty]: Start isEmpty. Operand 99585 states and 112375 transitions. [2024-11-08 10:30:10,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-08 10:30:10,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:10,204 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2024-11-08 10:30:10,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 10:30:10,205 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:10,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:10,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1299324121, now seen corresponding path program 1 times [2024-11-08 10:30:10,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:10,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205308247] [2024-11-08 10:30:10,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:10,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 10:30:10,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:10,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205308247] [2024-11-08 10:30:10,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205308247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:10,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569013305] [2024-11-08 10:30:10,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:10,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:10,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:10,934 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:30:10,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 10:30:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:11,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:30:11,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:30:11,209 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:30:11,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569013305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:11,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:30:11,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:30:11,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487728631] [2024-11-08 10:30:11,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:11,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:11,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:11,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:11,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:11,211 INFO L87 Difference]: Start difference. First operand 99585 states and 112375 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:12,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:12,323 INFO L93 Difference]: Finished difference Result 195672 states and 220245 transitions. [2024-11-08 10:30:12,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:12,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 253 [2024-11-08 10:30:12,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:12,499 INFO L225 Difference]: With dead ends: 195672 [2024-11-08 10:30:12,499 INFO L226 Difference]: Without dead ends: 96089 [2024-11-08 10:30:12,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:12,519 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 213 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:12,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 289 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:30:12,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96089 states. [2024-11-08 10:30:13,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96089 to 96080. [2024-11-08 10:30:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96080 states, 96079 states have (on average 1.096743304988603) internal successors, (105374), 96079 states have internal predecessors, (105374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:13,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96080 states to 96080 states and 105374 transitions. [2024-11-08 10:30:13,841 INFO L78 Accepts]: Start accepts. Automaton has 96080 states and 105374 transitions. Word has length 253 [2024-11-08 10:30:13,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:13,842 INFO L471 AbstractCegarLoop]: Abstraction has 96080 states and 105374 transitions. [2024-11-08 10:30:13,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:13,842 INFO L276 IsEmpty]: Start isEmpty. Operand 96080 states and 105374 transitions. [2024-11-08 10:30:13,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-08 10:30:13,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:13,875 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:13,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 10:30:14,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:14,077 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:14,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:14,077 INFO L85 PathProgramCache]: Analyzing trace with hash 75735862, now seen corresponding path program 1 times [2024-11-08 10:30:14,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:14,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59218127] [2024-11-08 10:30:14,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:14,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-08 10:30:14,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:14,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59218127] [2024-11-08 10:30:14,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59218127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:14,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:14,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:30:14,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713530279] [2024-11-08 10:30:14,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:14,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:30:14,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:14,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:30:14,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:30:14,563 INFO L87 Difference]: Start difference. First operand 96080 states and 105374 transitions. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:16,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:16,200 INFO L93 Difference]: Finished difference Result 302911 states and 330560 transitions. [2024-11-08 10:30:16,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:30:16,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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 259 [2024-11-08 10:30:16,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:16,504 INFO L225 Difference]: With dead ends: 302911 [2024-11-08 10:30:16,504 INFO L226 Difference]: Without dead ends: 206833 [2024-11-08 10:30:16,567 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-11-08 10:30:16,569 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 698 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:16,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 308 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:30:16,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206833 states. [2024-11-08 10:30:18,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206833 to 145002. [2024-11-08 10:30:19,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145002 states, 145001 states have (on average 1.0924269487796636) internal successors, (158403), 145001 states have internal predecessors, (158403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:19,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145002 states to 145002 states and 158403 transitions. [2024-11-08 10:30:19,284 INFO L78 Accepts]: Start accepts. Automaton has 145002 states and 158403 transitions. Word has length 259 [2024-11-08 10:30:19,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:19,284 INFO L471 AbstractCegarLoop]: Abstraction has 145002 states and 158403 transitions. [2024-11-08 10:30:19,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:19,285 INFO L276 IsEmpty]: Start isEmpty. Operand 145002 states and 158403 transitions. [2024-11-08 10:30:19,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-08 10:30:19,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:19,311 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 10:30:19,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 10:30:19,311 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:19,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:19,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1355740130, now seen corresponding path program 1 times [2024-11-08 10:30:19,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:19,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065863957] [2024-11-08 10:30:19,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:19,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:30:19,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:19,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065863957] [2024-11-08 10:30:19,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065863957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:19,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:19,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:30:19,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953299077] [2024-11-08 10:30:19,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:19,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:19,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:19,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:19,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:19,946 INFO L87 Difference]: Start difference. First operand 145002 states and 158403 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 2 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:21,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:21,726 INFO L93 Difference]: Finished difference Result 359927 states and 393333 transitions. [2024-11-08 10:30:21,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:21,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 2 states have internal predecessors, (262), 0 states have call successors, (0), 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 262 [2024-11-08 10:30:21,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:22,043 INFO L225 Difference]: With dead ends: 359927 [2024-11-08 10:30:22,044 INFO L226 Difference]: Without dead ends: 214927 [2024-11-08 10:30:22,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:22,092 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 154 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:22,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 126 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:30:22,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214927 states. [2024-11-08 10:30:24,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214927 to 201858. [2024-11-08 10:30:24,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201858 states, 201857 states have (on average 1.0941161317170076) internal successors, (220855), 201857 states have internal predecessors, (220855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201858 states to 201858 states and 220855 transitions. [2024-11-08 10:30:25,663 INFO L78 Accepts]: Start accepts. Automaton has 201858 states and 220855 transitions. Word has length 262 [2024-11-08 10:30:25,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:25,665 INFO L471 AbstractCegarLoop]: Abstraction has 201858 states and 220855 transitions. [2024-11-08 10:30:25,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 2 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:25,666 INFO L276 IsEmpty]: Start isEmpty. Operand 201858 states and 220855 transitions. [2024-11-08 10:30:25,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-11-08 10:30:25,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:25,695 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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] [2024-11-08 10:30:25,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 10:30:25,695 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:25,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:25,695 INFO L85 PathProgramCache]: Analyzing trace with hash -2062410286, now seen corresponding path program 1 times [2024-11-08 10:30:25,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:25,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336131476] [2024-11-08 10:30:25,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:25,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-08 10:30:26,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:26,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336131476] [2024-11-08 10:30:26,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336131476] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:26,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670684107] [2024-11-08 10:30:26,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:26,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:26,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:26,090 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:30:26,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 10:30:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:26,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:30:26,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 10:30:26,277 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:30:26,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670684107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:26,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:30:26,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:30:26,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743721914] [2024-11-08 10:30:26,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:26,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:26,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:26,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:26,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:26,279 INFO L87 Difference]: Start difference. First operand 201858 states and 220855 transitions. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:27,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:27,999 INFO L93 Difference]: Finished difference Result 564891 states and 617520 transitions. [2024-11-08 10:30:27,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:28,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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 286 [2024-11-08 10:30:28,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:28,934 INFO L225 Difference]: With dead ends: 564891 [2024-11-08 10:30:28,938 INFO L226 Difference]: Without dead ends: 363238 [2024-11-08 10:30:29,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:29,038 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 231 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:29,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 798 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:30:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363238 states. [2024-11-08 10:30:34,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363238 to 361800. [2024-11-08 10:30:34,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361800 states, 361799 states have (on average 1.0839222883424222) internal successors, (392162), 361799 states have internal predecessors, (392162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361800 states to 361800 states and 392162 transitions. [2024-11-08 10:30:34,917 INFO L78 Accepts]: Start accepts. Automaton has 361800 states and 392162 transitions. Word has length 286 [2024-11-08 10:30:34,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:34,918 INFO L471 AbstractCegarLoop]: Abstraction has 361800 states and 392162 transitions. [2024-11-08 10:30:34,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:34,918 INFO L276 IsEmpty]: Start isEmpty. Operand 361800 states and 392162 transitions. [2024-11-08 10:30:34,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-08 10:30:34,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:34,969 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2024-11-08 10:30:34,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 10:30:35,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 10:30:35,171 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:35,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:35,172 INFO L85 PathProgramCache]: Analyzing trace with hash -867277502, now seen corresponding path program 1 times [2024-11-08 10:30:35,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:35,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36785571] [2024-11-08 10:30:35,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:35,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:36,205 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 108 proven. 6 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-08 10:30:36,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:36,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36785571] [2024-11-08 10:30:36,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36785571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:36,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694082400] [2024-11-08 10:30:36,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:36,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:36,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:36,208 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:30:36,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 10:30:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:36,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:30:36,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:36,417 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 10:30:36,418 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:30:36,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694082400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:36,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:30:36,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:30:36,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563062287] [2024-11-08 10:30:36,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:36,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:36,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:36,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:36,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:36,420 INFO L87 Difference]: Start difference. First operand 361800 states and 392162 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:39,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:39,038 INFO L93 Difference]: Finished difference Result 733566 states and 795316 transitions. [2024-11-08 10:30:39,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:39,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 287 [2024-11-08 10:30:39,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:39,605 INFO L225 Difference]: With dead ends: 733566 [2024-11-08 10:30:39,606 INFO L226 Difference]: Without dead ends: 371971 [2024-11-08 10:30:40,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:40,534 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 201 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:40,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 299 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:30:40,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371971 states.