./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:30:55,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:30:56,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:30:56,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:30:56,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:30:56,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:30:56,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:30:56,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:30:56,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:30:56,066 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:30:56,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:30:56,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:30:56,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:30:56,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:30:56,068 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:30:56,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:30:56,069 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:30:56,070 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:30:56,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:30:56,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:30:56,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:30:56,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:30:56,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:30:56,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:30:56,075 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:30:56,076 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:30:56,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:30:56,076 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:30:56,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:30:56,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:30:56,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:30:56,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:30:56,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:30:56,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:30:56,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:30:56,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:30:56,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:30:56,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:30:56,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:30:56,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:30:56,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:30:56,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:30:56,081 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 [2024-10-10 22:30:56,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:30:56,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:30:56,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:30:56,397 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:30:56,397 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:30:56,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2024-10-10 22:30:57,803 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:30:57,970 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:30:57,970 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2024-10-10 22:30:57,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0617c7c79/b1fc60d2e99a402e998694d66d585632/FLAG2f07763d9 [2024-10-10 22:30:58,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0617c7c79/b1fc60d2e99a402e998694d66d585632 [2024-10-10 22:30:58,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:30:58,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:30:58,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:30:58,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:30:58,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:30:58,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:30:58" (1/1) ... [2024-10-10 22:30:58,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd03766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:58, skipping insertion in model container [2024-10-10 22:30:58,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:30:58" (1/1) ... [2024-10-10 22:30:58,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:30:58,579 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c[2544,2557] [2024-10-10 22:30:58,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:30:58,598 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:30:58,626 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c[2544,2557] [2024-10-10 22:30:58,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:30:58,646 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:30:58,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:58 WrapperNode [2024-10-10 22:30:58,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:30:58,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:30:58,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:30:58,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:30:58,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:58" (1/1) ... [2024-10-10 22:30:58,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:58" (1/1) ... [2024-10-10 22:30:58,680 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 100 [2024-10-10 22:30:58,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:30:58,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:30:58,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:30:58,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:30:58,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:58" (1/1) ... [2024-10-10 22:30:58,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:58" (1/1) ... [2024-10-10 22:30:58,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:58" (1/1) ... [2024-10-10 22:30:58,710 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 22:30:58,712 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:58" (1/1) ... [2024-10-10 22:30:58,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:58" (1/1) ... [2024-10-10 22:30:58,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:58" (1/1) ... [2024-10-10 22:30:58,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:58" (1/1) ... [2024-10-10 22:30:58,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:58" (1/1) ... [2024-10-10 22:30:58,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:58" (1/1) ... [2024-10-10 22:30:58,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:30:58,730 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:30:58,730 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:30:58,730 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:30:58,732 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:58" (1/1) ... [2024-10-10 22:30:58,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:30:58,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:58,766 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:30:58,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:30:58,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:30:58,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:30:58,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:30:58,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:30:58,870 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:30:58,872 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:30:59,029 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-10 22:30:59,029 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:30:59,061 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:30:59,061 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:30:59,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:30:59 BoogieIcfgContainer [2024-10-10 22:30:59,062 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:30:59,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:30:59,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:30:59,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:30:59,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:30:58" (1/3) ... [2024-10-10 22:30:59,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@138b5447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:30:59, skipping insertion in model container [2024-10-10 22:30:59,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:58" (2/3) ... [2024-10-10 22:30:59,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@138b5447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:30:59, skipping insertion in model container [2024-10-10 22:30:59,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:30:59" (3/3) ... [2024-10-10 22:30:59,082 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2024-10-10 22:30:59,097 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:30:59,098 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:30:59,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:30:59,177 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;@64d39336, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:30:59,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:30:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:59,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-10 22:30:59,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:59,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:59,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:59,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:59,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1166319357, now seen corresponding path program 1 times [2024-10-10 22:30:59,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:59,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068162877] [2024-10-10 22:30:59,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:59,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:59,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:59,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:59,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068162877] [2024-10-10 22:30:59,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068162877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:59,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:59,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:59,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297441937] [2024-10-10 22:30:59,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:59,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:59,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:59,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:59,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:59,501 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 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 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:59,571 INFO L93 Difference]: Finished difference Result 54 states and 93 transitions. [2024-10-10 22:30:59,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:59,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-10-10 22:30:59,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:59,584 INFO L225 Difference]: With dead ends: 54 [2024-10-10 22:30:59,585 INFO L226 Difference]: Without dead ends: 44 [2024-10-10 22:30:59,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:59,593 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 30 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:59,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 82 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:59,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-10 22:30:59,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2024-10-10 22:30:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 53 transitions. [2024-10-10 22:30:59,632 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 53 transitions. Word has length 12 [2024-10-10 22:30:59,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:59,632 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 53 transitions. [2024-10-10 22:30:59,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:59,633 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 53 transitions. [2024-10-10 22:30:59,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-10 22:30:59,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:59,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:59,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:30:59,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:59,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:59,636 INFO L85 PathProgramCache]: Analyzing trace with hash -486260987, now seen corresponding path program 1 times [2024-10-10 22:30:59,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:59,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333080877] [2024-10-10 22:30:59,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:59,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:59,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:59,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:59,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333080877] [2024-10-10 22:30:59,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333080877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:59,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:59,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:59,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69134838] [2024-10-10 22:30:59,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:59,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:59,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:59,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:59,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:59,726 INFO L87 Difference]: Start difference. First operand 30 states and 53 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:59,754 INFO L93 Difference]: Finished difference Result 73 states and 128 transitions. [2024-10-10 22:30:59,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:59,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-10-10 22:30:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:59,756 INFO L225 Difference]: With dead ends: 73 [2024-10-10 22:30:59,756 INFO L226 Difference]: Without dead ends: 44 [2024-10-10 22:30:59,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:59,758 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 28 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:59,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 84 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:59,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-10 22:30:59,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2024-10-10 22:30:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 41 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2024-10-10 22:30:59,767 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 12 [2024-10-10 22:30:59,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:59,767 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2024-10-10 22:30:59,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:59,767 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2024-10-10 22:30:59,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-10 22:30:59,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:59,768 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:59,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:30:59,768 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:59,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:59,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1795947055, now seen corresponding path program 1 times [2024-10-10 22:30:59,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:59,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405011079] [2024-10-10 22:30:59,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:59,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:59,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:59,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:59,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405011079] [2024-10-10 22:30:59,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405011079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:59,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:59,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:59,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167751460] [2024-10-10 22:30:59,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:59,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:59,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:59,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:59,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:59,828 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:59,844 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2024-10-10 22:30:59,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:59,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-10-10 22:30:59,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:59,845 INFO L225 Difference]: With dead ends: 68 [2024-10-10 22:30:59,846 INFO L226 Difference]: Without dead ends: 47 [2024-10-10 22:30:59,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:59,847 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 30 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:59,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 93 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:59,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-10 22:30:59,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2024-10-10 22:30:59,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 44 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 75 transitions. [2024-10-10 22:30:59,861 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 75 transitions. Word has length 13 [2024-10-10 22:30:59,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:59,862 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 75 transitions. [2024-10-10 22:30:59,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 75 transitions. [2024-10-10 22:30:59,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-10 22:30:59,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:59,863 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:59,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:30:59,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:59,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:59,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2105993231, now seen corresponding path program 1 times [2024-10-10 22:30:59,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:59,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29621929] [2024-10-10 22:30:59,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:59,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:59,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:59,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29621929] [2024-10-10 22:30:59,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29621929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:59,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:59,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:59,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559260177] [2024-10-10 22:30:59,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:59,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:59,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:59,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:59,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:59,928 INFO L87 Difference]: Start difference. First operand 45 states and 75 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:59,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:59,952 INFO L93 Difference]: Finished difference Result 84 states and 140 transitions. [2024-10-10 22:30:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:59,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-10-10 22:30:59,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:59,954 INFO L225 Difference]: With dead ends: 84 [2024-10-10 22:30:59,954 INFO L226 Difference]: Without dead ends: 82 [2024-10-10 22:30:59,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:59,956 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 25 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:59,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 74 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-10 22:30:59,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2024-10-10 22:30:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.694915254237288) internal successors, (100), 59 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 100 transitions. [2024-10-10 22:30:59,964 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 100 transitions. Word has length 13 [2024-10-10 22:30:59,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:59,965 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 100 transitions. [2024-10-10 22:30:59,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:59,965 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 100 transitions. [2024-10-10 22:30:59,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-10 22:30:59,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:59,966 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:59,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:30:59,967 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:59,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:59,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1508915695, now seen corresponding path program 1 times [2024-10-10 22:30:59,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:59,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887551952] [2024-10-10 22:30:59,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:59,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:00,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:00,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:00,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887551952] [2024-10-10 22:31:00,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887551952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:00,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:00,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:00,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675797941] [2024-10-10 22:31:00,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:00,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:00,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:00,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:00,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,017 INFO L87 Difference]: Start difference. First operand 60 states and 100 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:00,043 INFO L93 Difference]: Finished difference Result 140 states and 234 transitions. [2024-10-10 22:31:00,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:00,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-10-10 22:31:00,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:00,046 INFO L225 Difference]: With dead ends: 140 [2024-10-10 22:31:00,046 INFO L226 Difference]: Without dead ends: 84 [2024-10-10 22:31:00,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,052 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 27 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:00,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 85 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:00,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-10 22:31:00,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-10-10 22:31:00,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.654320987654321) internal successors, (134), 81 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 134 transitions. [2024-10-10 22:31:00,070 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 134 transitions. Word has length 13 [2024-10-10 22:31:00,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:00,071 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 134 transitions. [2024-10-10 22:31:00,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,071 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 134 transitions. [2024-10-10 22:31:00,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-10 22:31:00,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:00,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:00,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:31:00,072 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:00,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:00,074 INFO L85 PathProgramCache]: Analyzing trace with hash 861495706, now seen corresponding path program 1 times [2024-10-10 22:31:00,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:00,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824960435] [2024-10-10 22:31:00,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:00,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:00,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:00,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824960435] [2024-10-10 22:31:00,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824960435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:00,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:00,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:00,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226126157] [2024-10-10 22:31:00,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:00,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:00,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:00,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:00,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,132 INFO L87 Difference]: Start difference. First operand 82 states and 134 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:00,154 INFO L93 Difference]: Finished difference Result 125 states and 201 transitions. [2024-10-10 22:31:00,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:00,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-10-10 22:31:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:00,159 INFO L225 Difference]: With dead ends: 125 [2024-10-10 22:31:00,159 INFO L226 Difference]: Without dead ends: 86 [2024-10-10 22:31:00,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,173 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 29 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:00,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 89 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:00,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-10 22:31:00,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2024-10-10 22:31:00,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.6144578313253013) internal successors, (134), 83 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 134 transitions. [2024-10-10 22:31:00,191 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 134 transitions. Word has length 14 [2024-10-10 22:31:00,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:00,197 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 134 transitions. [2024-10-10 22:31:00,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,197 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 134 transitions. [2024-10-10 22:31:00,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-10 22:31:00,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:00,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:00,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:31:00,198 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:00,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:00,199 INFO L85 PathProgramCache]: Analyzing trace with hash 468468696, now seen corresponding path program 1 times [2024-10-10 22:31:00,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:00,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511037505] [2024-10-10 22:31:00,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:00,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:00,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:00,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511037505] [2024-10-10 22:31:00,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511037505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:00,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:00,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:00,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975969091] [2024-10-10 22:31:00,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:00,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:00,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:00,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:00,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,255 INFO L87 Difference]: Start difference. First operand 84 states and 134 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:00,279 INFO L93 Difference]: Finished difference Result 236 states and 376 transitions. [2024-10-10 22:31:00,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:00,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-10-10 22:31:00,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:00,281 INFO L225 Difference]: With dead ends: 236 [2024-10-10 22:31:00,281 INFO L226 Difference]: Without dead ends: 158 [2024-10-10 22:31:00,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,283 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 27 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:00,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 76 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:00,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-10 22:31:00,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2024-10-10 22:31:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.5612903225806452) internal successors, (242), 155 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 242 transitions. [2024-10-10 22:31:00,295 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 242 transitions. Word has length 14 [2024-10-10 22:31:00,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:00,296 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 242 transitions. [2024-10-10 22:31:00,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,296 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 242 transitions. [2024-10-10 22:31:00,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-10 22:31:00,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:00,297 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:00,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:31:00,298 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:00,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:00,298 INFO L85 PathProgramCache]: Analyzing trace with hash -211589674, now seen corresponding path program 1 times [2024-10-10 22:31:00,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:00,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990969547] [2024-10-10 22:31:00,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:00,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:00,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:00,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:00,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990969547] [2024-10-10 22:31:00,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990969547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:00,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:00,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:00,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755581239] [2024-10-10 22:31:00,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:00,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:00,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:00,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:00,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,338 INFO L87 Difference]: Start difference. First operand 156 states and 242 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:00,360 INFO L93 Difference]: Finished difference Result 192 states and 300 transitions. [2024-10-10 22:31:00,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:00,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-10-10 22:31:00,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:00,362 INFO L225 Difference]: With dead ends: 192 [2024-10-10 22:31:00,362 INFO L226 Difference]: Without dead ends: 190 [2024-10-10 22:31:00,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,363 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 22 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:00,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 95 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:00,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-10 22:31:00,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 156. [2024-10-10 22:31:00,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.5354838709677419) internal successors, (238), 155 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-10-10 22:31:00,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 238 transitions. [2024-10-10 22:31:00,390 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 238 transitions. Word has length 14 [2024-10-10 22:31:00,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:00,390 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 238 transitions. [2024-10-10 22:31:00,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,390 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 238 transitions. [2024-10-10 22:31:00,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-10 22:31:00,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:00,391 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:00,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 22:31:00,392 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:00,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:00,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1637843014, now seen corresponding path program 1 times [2024-10-10 22:31:00,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:00,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893742793] [2024-10-10 22:31:00,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:00,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:00,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:00,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:00,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893742793] [2024-10-10 22:31:00,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893742793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:00,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:00,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:00,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5456575] [2024-10-10 22:31:00,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:00,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:00,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:00,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:00,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,426 INFO L87 Difference]: Start difference. First operand 156 states and 238 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:00,443 INFO L93 Difference]: Finished difference Result 276 states and 424 transitions. [2024-10-10 22:31:00,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:00,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-10-10 22:31:00,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:00,445 INFO L225 Difference]: With dead ends: 276 [2024-10-10 22:31:00,445 INFO L226 Difference]: Without dead ends: 274 [2024-10-10 22:31:00,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,446 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 19 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:00,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 70 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:00,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-10 22:31:00,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 224. [2024-10-10 22:31:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.4977578475336324) internal successors, (334), 223 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 334 transitions. [2024-10-10 22:31:00,461 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 334 transitions. Word has length 15 [2024-10-10 22:31:00,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:00,461 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 334 transitions. [2024-10-10 22:31:00,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,462 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 334 transitions. [2024-10-10 22:31:00,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-10 22:31:00,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:00,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:00,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 22:31:00,463 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:00,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:00,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1977065912, now seen corresponding path program 1 times [2024-10-10 22:31:00,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:00,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234519703] [2024-10-10 22:31:00,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:00,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:00,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:00,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234519703] [2024-10-10 22:31:00,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234519703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:00,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:00,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:00,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860347792] [2024-10-10 22:31:00,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:00,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:00,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:00,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:00,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,500 INFO L87 Difference]: Start difference. First operand 224 states and 334 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:00,520 INFO L93 Difference]: Finished difference Result 516 states and 768 transitions. [2024-10-10 22:31:00,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:00,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-10-10 22:31:00,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:00,522 INFO L225 Difference]: With dead ends: 516 [2024-10-10 22:31:00,522 INFO L226 Difference]: Without dead ends: 298 [2024-10-10 22:31:00,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,524 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 25 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:00,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:00,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-10 22:31:00,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2024-10-10 22:31:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 1.4440677966101696) internal successors, (426), 295 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 426 transitions. [2024-10-10 22:31:00,539 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 426 transitions. Word has length 15 [2024-10-10 22:31:00,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:00,540 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 426 transitions. [2024-10-10 22:31:00,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,540 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 426 transitions. [2024-10-10 22:31:00,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-10 22:31:00,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:00,541 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:00,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 22:31:00,541 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:00,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:00,542 INFO L85 PathProgramCache]: Analyzing trace with hash -766258451, now seen corresponding path program 1 times [2024-10-10 22:31:00,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:00,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846646563] [2024-10-10 22:31:00,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:00,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:00,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:00,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:00,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846646563] [2024-10-10 22:31:00,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846646563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:00,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:00,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:00,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283872338] [2024-10-10 22:31:00,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:00,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:00,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:00,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:00,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,570 INFO L87 Difference]: Start difference. First operand 296 states and 426 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:00,593 INFO L93 Difference]: Finished difference Result 452 states and 648 transitions. [2024-10-10 22:31:00,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:00,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-10-10 22:31:00,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:00,596 INFO L225 Difference]: With dead ends: 452 [2024-10-10 22:31:00,596 INFO L226 Difference]: Without dead ends: 310 [2024-10-10 22:31:00,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,597 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 27 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:00,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 81 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:00,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-10-10 22:31:00,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2024-10-10 22:31:00,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.4136807817589576) internal successors, (434), 307 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 434 transitions. [2024-10-10 22:31:00,614 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 434 transitions. Word has length 16 [2024-10-10 22:31:00,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:00,615 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 434 transitions. [2024-10-10 22:31:00,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 434 transitions. [2024-10-10 22:31:00,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-10 22:31:00,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:00,618 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:00,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 22:31:00,618 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:00,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:00,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1159285461, now seen corresponding path program 1 times [2024-10-10 22:31:00,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:00,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630848433] [2024-10-10 22:31:00,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:00,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:00,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:00,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630848433] [2024-10-10 22:31:00,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630848433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:00,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:00,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:00,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539523740] [2024-10-10 22:31:00,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:00,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:00,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:00,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:00,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,657 INFO L87 Difference]: Start difference. First operand 308 states and 434 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:00,700 INFO L93 Difference]: Finished difference Result 520 states and 732 transitions. [2024-10-10 22:31:00,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:00,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-10-10 22:31:00,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:00,704 INFO L225 Difference]: With dead ends: 520 [2024-10-10 22:31:00,704 INFO L226 Difference]: Without dead ends: 518 [2024-10-10 22:31:00,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,709 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 16 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:00,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 68 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:00,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-10-10 22:31:00,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 452. [2024-10-10 22:31:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 1.370288248337029) internal successors, (618), 451 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 618 transitions. [2024-10-10 22:31:00,730 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 618 transitions. Word has length 16 [2024-10-10 22:31:00,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:00,730 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 618 transitions. [2024-10-10 22:31:00,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,730 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 618 transitions. [2024-10-10 22:31:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-10 22:31:00,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:00,732 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:00,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 22:31:00,732 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:00,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:00,733 INFO L85 PathProgramCache]: Analyzing trace with hash -479227091, now seen corresponding path program 1 times [2024-10-10 22:31:00,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:00,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172007927] [2024-10-10 22:31:00,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:00,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:00,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:00,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:00,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172007927] [2024-10-10 22:31:00,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172007927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:00,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:00,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:00,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503505437] [2024-10-10 22:31:00,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:00,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:00,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:00,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:00,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,767 INFO L87 Difference]: Start difference. First operand 452 states and 618 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:00,800 INFO L93 Difference]: Finished difference Result 1016 states and 1372 transitions. [2024-10-10 22:31:00,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:00,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-10-10 22:31:00,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:00,803 INFO L225 Difference]: With dead ends: 1016 [2024-10-10 22:31:00,803 INFO L226 Difference]: Without dead ends: 582 [2024-10-10 22:31:00,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,805 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 24 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:00,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 88 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:00,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-10-10 22:31:00,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2024-10-10 22:31:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 1.302245250431779) internal successors, (754), 579 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 754 transitions. [2024-10-10 22:31:00,836 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 754 transitions. Word has length 16 [2024-10-10 22:31:00,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:00,836 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 754 transitions. [2024-10-10 22:31:00,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,837 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 754 transitions. [2024-10-10 22:31:00,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-10 22:31:00,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:00,838 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:00,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 22:31:00,839 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:00,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:00,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1577894915, now seen corresponding path program 1 times [2024-10-10 22:31:00,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:00,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531819026] [2024-10-10 22:31:00,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:00,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:00,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:00,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531819026] [2024-10-10 22:31:00,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531819026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:00,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:00,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:00,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700395501] [2024-10-10 22:31:00,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:00,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:00,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:00,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:00,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,864 INFO L87 Difference]: Start difference. First operand 580 states and 754 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:00,891 INFO L93 Difference]: Finished difference Result 872 states and 1124 transitions. [2024-10-10 22:31:00,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:00,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-10-10 22:31:00,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:00,895 INFO L225 Difference]: With dead ends: 872 [2024-10-10 22:31:00,895 INFO L226 Difference]: Without dead ends: 598 [2024-10-10 22:31:00,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,896 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 26 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:00,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 77 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:00,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-10-10 22:31:00,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2024-10-10 22:31:00,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 1.2672268907563025) internal successors, (754), 595 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 754 transitions. [2024-10-10 22:31:00,918 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 754 transitions. Word has length 17 [2024-10-10 22:31:00,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:00,918 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 754 transitions. [2024-10-10 22:31:00,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,918 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 754 transitions. [2024-10-10 22:31:00,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-10 22:31:00,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:00,919 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:00,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 22:31:00,920 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:00,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:00,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1970921925, now seen corresponding path program 1 times [2024-10-10 22:31:00,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:00,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294081709] [2024-10-10 22:31:00,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:00,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:00,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:00,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:00,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294081709] [2024-10-10 22:31:00,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294081709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:00,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:00,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:00,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346347526] [2024-10-10 22:31:00,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:00,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:00,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:00,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:00,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,949 INFO L87 Difference]: Start difference. First operand 596 states and 754 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:00,983 INFO L93 Difference]: Finished difference Result 966 states and 1203 transitions. [2024-10-10 22:31:00,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:00,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-10-10 22:31:00,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:00,989 INFO L225 Difference]: With dead ends: 966 [2024-10-10 22:31:00,989 INFO L226 Difference]: Without dead ends: 964 [2024-10-10 22:31:00,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,990 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:00,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 65 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:00,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2024-10-10 22:31:01,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 900. [2024-10-10 22:31:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 899 states have (on average 1.2302558398220245) internal successors, (1106), 899 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:01,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1106 transitions. [2024-10-10 22:31:01,022 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1106 transitions. Word has length 17 [2024-10-10 22:31:01,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:01,022 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1106 transitions. [2024-10-10 22:31:01,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1106 transitions. [2024-10-10 22:31:01,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-10 22:31:01,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:01,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:01,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 22:31:01,024 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:01,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:01,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1290863555, now seen corresponding path program 1 times [2024-10-10 22:31:01,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:01,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245303055] [2024-10-10 22:31:01,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:01,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:01,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:01,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:01,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245303055] [2024-10-10 22:31:01,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245303055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:01,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:01,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:01,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076068417] [2024-10-10 22:31:01,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:01,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:01,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:01,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:01,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:01,057 INFO L87 Difference]: Start difference. First operand 900 states and 1106 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:01,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:01,104 INFO L93 Difference]: Finished difference Result 1988 states and 2386 transitions. [2024-10-10 22:31:01,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:01,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-10-10 22:31:01,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:01,105 INFO L225 Difference]: With dead ends: 1988 [2024-10-10 22:31:01,106 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 22:31:01,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:01,108 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 22 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:01,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:01,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 22:31:01,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 22:31:01,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 22:31:01,109 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2024-10-10 22:31:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:01,109 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 22:31:01,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:01,109 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 22:31:01,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 22:31:01,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:31:01,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 22:31:01,118 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:01,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 22:31:01,130 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:31:01,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:31:01 BoogieIcfgContainer [2024-10-10 22:31:01,140 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:31:01,141 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:31:01,141 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:31:01,141 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:31:01,141 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:30:59" (3/4) ... [2024-10-10 22:31:01,143 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 22:31:01,153 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-10 22:31:01,153 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 22:31:01,153 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 22:31:01,154 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 22:31:01,242 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 22:31:01,245 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 22:31:01,245 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:31:01,246 INFO L158 Benchmark]: Toolchain (without parser) took 2868.85ms. Allocated memory was 157.3MB in the beginning and 192.9MB in the end (delta: 35.7MB). Free memory was 83.0MB in the beginning and 138.9MB in the end (delta: -55.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:31:01,246 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 157.3MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:31:01,246 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.01ms. Allocated memory is still 157.3MB. Free memory was 82.7MB in the beginning and 70.4MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 22:31:01,246 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.93ms. Allocated memory is still 157.3MB. Free memory was 70.4MB in the beginning and 68.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:31:01,246 INFO L158 Benchmark]: Boogie Preprocessor took 48.26ms. Allocated memory is still 157.3MB. Free memory was 68.7MB in the beginning and 66.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:31:01,247 INFO L158 Benchmark]: RCFGBuilder took 331.64ms. Allocated memory is still 157.3MB. Free memory was 66.9MB in the beginning and 122.4MB in the end (delta: -55.6MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2024-10-10 22:31:01,247 INFO L158 Benchmark]: TraceAbstraction took 2076.69ms. Allocated memory was 157.3MB in the beginning and 192.9MB in the end (delta: 35.7MB). Free memory was 121.6MB in the beginning and 143.1MB in the end (delta: -21.5MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-10-10 22:31:01,247 INFO L158 Benchmark]: Witness Printer took 104.48ms. Allocated memory is still 192.9MB. Free memory was 143.1MB in the beginning and 138.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-10 22:31:01,248 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 157.3MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.01ms. Allocated memory is still 157.3MB. Free memory was 82.7MB in the beginning and 70.4MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.93ms. Allocated memory is still 157.3MB. Free memory was 70.4MB in the beginning and 68.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.26ms. Allocated memory is still 157.3MB. Free memory was 68.7MB in the beginning and 66.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 331.64ms. Allocated memory is still 157.3MB. Free memory was 66.9MB in the beginning and 122.4MB in the end (delta: -55.6MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2076.69ms. Allocated memory was 157.3MB in the beginning and 192.9MB in the end (delta: 35.7MB). Free memory was 121.6MB in the beginning and 143.1MB in the end (delta: -21.5MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Witness Printer took 104.48ms. Allocated memory is still 192.9MB. Free memory was 143.1MB in the beginning and 138.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 107]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 389 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 389 mSDsluCounter, 1301 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 509 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105 IncrementalHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 792 mSDtfsCounter, 105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=900occurred in iteration=15, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 268 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-10 22:31:01,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE