./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label06.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 6ee2b5babe7331afe701eeca9f9b0daa94765a62f83084cc43a986ae2ceb2b03 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:35:42,180 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:35:42,257 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:35:42,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:35:42,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:35:42,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:35:42,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:35:42,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:35:42,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:35:42,286 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:35:42,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:35:42,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:35:42,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:35:42,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:35:42,288 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:35:42,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:35:42,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:35:42,289 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:35:42,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:35:42,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:35:42,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:35:42,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:35:42,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:35:42,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:35:42,295 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:35:42,296 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:35:42,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:35:42,296 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:35:42,297 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:35:42,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:35:42,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:35:42,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:35:42,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:35:42,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:35:42,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:35:42,303 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:35:42,303 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:35:42,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:35:42,303 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:35:42,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:35:42,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:35:42,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:35:42,306 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 -> 6ee2b5babe7331afe701eeca9f9b0daa94765a62f83084cc43a986ae2ceb2b03 [2024-10-10 22:35:42,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:35:42,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:35:42,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:35:42,576 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:35:42,577 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:35:42,578 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label06.c [2024-10-10 22:35:44,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:35:44,396 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:35:44,397 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label06.c [2024-10-10 22:35:44,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0fbcfa85f/cab2cb7f9b1a4cc6877424cc76dbd320/FLAG31910c01f [2024-10-10 22:35:44,624 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0fbcfa85f/cab2cb7f9b1a4cc6877424cc76dbd320 [2024-10-10 22:35:44,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:35:44,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:35:44,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:35:44,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:35:44,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:35:44,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:35:44" (1/1) ... [2024-10-10 22:35:44,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c21bb6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:44, skipping insertion in model container [2024-10-10 22:35:44,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:35:44" (1/1) ... [2024-10-10 22:35:44,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:35:45,233 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label06.c[57034,57047] [2024-10-10 22:35:45,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:35:45,287 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:35:45,452 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label06.c[57034,57047] [2024-10-10 22:35:45,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:35:45,492 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:35:45,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:45 WrapperNode [2024-10-10 22:35:45,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:35:45,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:35:45,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:35:45,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:35:45,502 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:35:45" (1/1) ... [2024-10-10 22:35:45,541 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:35:45" (1/1) ... [2024-10-10 22:35:45,635 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-10 22:35:45,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:35:45,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:35:45,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:35:45,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:35:45,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:45" (1/1) ... [2024-10-10 22:35:45,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:45" (1/1) ... [2024-10-10 22:35:45,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:45" (1/1) ... [2024-10-10 22:35:45,704 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:35:45,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:45" (1/1) ... [2024-10-10 22:35:45,709 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:45" (1/1) ... [2024-10-10 22:35:45,758 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:45" (1/1) ... [2024-10-10 22:35:45,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:45" (1/1) ... [2024-10-10 22:35:45,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:45" (1/1) ... [2024-10-10 22:35:45,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:45" (1/1) ... [2024-10-10 22:35:45,822 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:35:45,824 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:35:45,824 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:35:45,824 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:35:45,825 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:45" (1/1) ... [2024-10-10 22:35:45,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:35:45,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:35:45,866 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:35:45,870 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:35:45,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:35:45,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:35:45,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:35:45,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:35:45,991 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:35:45,993 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:35:47,835 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-10 22:35:47,836 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:35:47,928 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:35:47,930 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:35:47,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:35:47 BoogieIcfgContainer [2024-10-10 22:35:47,931 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:35:47,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:35:47,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:35:47,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:35:47,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:35:44" (1/3) ... [2024-10-10 22:35:47,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b399b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:35:47, skipping insertion in model container [2024-10-10 22:35:47,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:45" (2/3) ... [2024-10-10 22:35:47,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b399b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:35:47, skipping insertion in model container [2024-10-10 22:35:47,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:35:47" (3/3) ... [2024-10-10 22:35:47,940 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label06.c [2024-10-10 22:35:47,958 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:35:47,959 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:35:48,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:35:48,044 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;@654dbe03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:35:48,045 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:35:48,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 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:35:48,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-10 22:35:48,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:48,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:48,071 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:48,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:48,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1843495765, now seen corresponding path program 1 times [2024-10-10 22:35:48,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:48,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984447131] [2024-10-10 22:35:48,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:48,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:48,665 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:35:48,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:48,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984447131] [2024-10-10 22:35:48,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984447131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:48,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:48,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:48,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579041434] [2024-10-10 22:35:48,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:48,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:35:48,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:48,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:35:48,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:35:48,699 INFO L87 Difference]: Start difference. First operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 84.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 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:35:48,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:48,758 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-10 22:35:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:35:48,765 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 84.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-10-10 22:35:48,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:48,782 INFO L225 Difference]: With dead ends: 479 [2024-10-10 22:35:48,783 INFO L226 Difference]: Without dead ends: 238 [2024-10-10 22:35:48,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:35:48,789 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:48,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:35:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-10 22:35:48,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-10 22:35:48,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 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:35:48,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-10 22:35:48,838 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 168 [2024-10-10 22:35:48,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:48,839 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-10 22:35:48,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 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:35:48,840 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-10 22:35:48,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-10 22:35:48,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:48,843 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:48,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:35:48,844 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:48,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:48,845 INFO L85 PathProgramCache]: Analyzing trace with hash 472336061, now seen corresponding path program 1 times [2024-10-10 22:35:48,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:48,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752373303] [2024-10-10 22:35:48,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:48,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:49,561 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:35:49,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:49,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752373303] [2024-10-10 22:35:49,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752373303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:49,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:49,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:49,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970272539] [2024-10-10 22:35:49,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:49,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:49,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:49,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:49,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:49,569 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 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:35:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:50,530 INFO L93 Difference]: Finished difference Result 699 states and 1161 transitions. [2024-10-10 22:35:50,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:50,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-10-10 22:35:50,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:50,535 INFO L225 Difference]: With dead ends: 699 [2024-10-10 22:35:50,535 INFO L226 Difference]: Without dead ends: 462 [2024-10-10 22:35:50,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:50,538 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 72 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:50,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 83 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 22:35:50,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-10-10 22:35:50,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 448. [2024-10-10 22:35:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 1.6353467561521253) internal successors, (731), 447 states have internal predecessors, (731), 0 states have call successors, (0), 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:35:50,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 731 transitions. [2024-10-10 22:35:50,578 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 731 transitions. Word has length 168 [2024-10-10 22:35:50,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:50,578 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 731 transitions. [2024-10-10 22:35:50,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 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:35:50,579 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 731 transitions. [2024-10-10 22:35:50,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-10 22:35:50,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:50,584 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:50,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:35:50,584 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:50,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:50,591 INFO L85 PathProgramCache]: Analyzing trace with hash -783820495, now seen corresponding path program 1 times [2024-10-10 22:35:50,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:50,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706379095] [2024-10-10 22:35:50,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:50,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:50,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:50,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:50,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706379095] [2024-10-10 22:35:50,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706379095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:50,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:50,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:50,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904824978] [2024-10-10 22:35:50,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:50,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:50,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:50,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:50,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:50,948 INFO L87 Difference]: Start difference. First operand 448 states and 731 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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:35:51,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:51,683 INFO L93 Difference]: Finished difference Result 1332 states and 2179 transitions. [2024-10-10 22:35:51,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:51,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2024-10-10 22:35:51,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:51,687 INFO L225 Difference]: With dead ends: 1332 [2024-10-10 22:35:51,687 INFO L226 Difference]: Without dead ends: 885 [2024-10-10 22:35:51,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:51,691 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 285 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:51,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 112 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:35:51,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-10-10 22:35:51,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 881. [2024-10-10 22:35:51,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 1.6170454545454545) internal successors, (1423), 880 states have internal predecessors, (1423), 0 states have call successors, (0), 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:35:51,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1423 transitions. [2024-10-10 22:35:51,728 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1423 transitions. Word has length 174 [2024-10-10 22:35:51,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:51,729 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1423 transitions. [2024-10-10 22:35:51,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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:35:51,732 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1423 transitions. [2024-10-10 22:35:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-10 22:35:51,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:51,740 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:51,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:35:51,741 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:51,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:51,742 INFO L85 PathProgramCache]: Analyzing trace with hash 760558681, now seen corresponding path program 1 times [2024-10-10 22:35:51,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:51,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794579050] [2024-10-10 22:35:51,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:51,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:52,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:52,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:52,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794579050] [2024-10-10 22:35:52,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794579050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:52,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:52,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:52,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480262543] [2024-10-10 22:35:52,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:52,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:52,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:52,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:52,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:52,014 INFO L87 Difference]: Start difference. First operand 881 states and 1423 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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:35:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:52,831 INFO L93 Difference]: Finished difference Result 2574 states and 4171 transitions. [2024-10-10 22:35:52,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:52,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2024-10-10 22:35:52,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:52,838 INFO L225 Difference]: With dead ends: 2574 [2024-10-10 22:35:52,838 INFO L226 Difference]: Without dead ends: 1694 [2024-10-10 22:35:52,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:52,845 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 214 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:52,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 192 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:35:52,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2024-10-10 22:35:52,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1694. [2024-10-10 22:35:52,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1693 states have (on average 1.3975191966922622) internal successors, (2366), 1693 states have internal predecessors, (2366), 0 states have call successors, (0), 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:35:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2366 transitions. [2024-10-10 22:35:52,887 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2366 transitions. Word has length 174 [2024-10-10 22:35:52,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:52,888 INFO L471 AbstractCegarLoop]: Abstraction has 1694 states and 2366 transitions. [2024-10-10 22:35:52,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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:35:52,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2366 transitions. [2024-10-10 22:35:52,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-10 22:35:52,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:52,892 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:52,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:35:52,893 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:52,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:52,894 INFO L85 PathProgramCache]: Analyzing trace with hash -796480590, now seen corresponding path program 1 times [2024-10-10 22:35:52,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:52,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356619848] [2024-10-10 22:35:52,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:52,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:53,089 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:35:53,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:53,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356619848] [2024-10-10 22:35:53,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356619848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:53,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:53,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:53,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208810787] [2024-10-10 22:35:53,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:53,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:53,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:53,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:53,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:53,092 INFO L87 Difference]: Start difference. First operand 1694 states and 2366 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 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:35:53,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:53,939 INFO L93 Difference]: Finished difference Result 4839 states and 6820 transitions. [2024-10-10 22:35:53,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:53,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 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 182 [2024-10-10 22:35:53,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:53,952 INFO L225 Difference]: With dead ends: 4839 [2024-10-10 22:35:53,952 INFO L226 Difference]: Without dead ends: 3146 [2024-10-10 22:35:53,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:53,957 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:53,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 90 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:35:53,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3146 states. [2024-10-10 22:35:54,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3146 to 3122. [2024-10-10 22:35:54,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3122 states, 3121 states have (on average 1.3832105094520988) internal successors, (4317), 3121 states have internal predecessors, (4317), 0 states have call successors, (0), 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:35:54,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 4317 transitions. [2024-10-10 22:35:54,026 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 4317 transitions. Word has length 182 [2024-10-10 22:35:54,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:54,026 INFO L471 AbstractCegarLoop]: Abstraction has 3122 states and 4317 transitions. [2024-10-10 22:35:54,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 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:35:54,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 4317 transitions. [2024-10-10 22:35:54,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-10 22:35:54,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:54,033 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:54,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:35:54,034 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:54,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:54,034 INFO L85 PathProgramCache]: Analyzing trace with hash -296877877, now seen corresponding path program 1 times [2024-10-10 22:35:54,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:54,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564283283] [2024-10-10 22:35:54,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:54,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:54,411 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:35:54,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:54,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564283283] [2024-10-10 22:35:54,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564283283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:54,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:54,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:35:54,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288419591] [2024-10-10 22:35:54,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:54,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:54,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:54,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:54,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:54,415 INFO L87 Difference]: Start difference. First operand 3122 states and 4317 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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:35:55,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:55,263 INFO L93 Difference]: Finished difference Result 7678 states and 10609 transitions. [2024-10-10 22:35:55,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:55,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 196 [2024-10-10 22:35:55,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:55,283 INFO L225 Difference]: With dead ends: 7678 [2024-10-10 22:35:55,283 INFO L226 Difference]: Without dead ends: 4557 [2024-10-10 22:35:55,289 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:35:55,290 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 214 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:55,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 362 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:35:55,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4557 states. [2024-10-10 22:35:55,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4557 to 4545. [2024-10-10 22:35:55,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4545 states, 4544 states have (on average 1.3248239436619718) internal successors, (6020), 4544 states have internal predecessors, (6020), 0 states have call successors, (0), 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:35:55,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4545 states to 4545 states and 6020 transitions. [2024-10-10 22:35:55,378 INFO L78 Accepts]: Start accepts. Automaton has 4545 states and 6020 transitions. Word has length 196 [2024-10-10 22:35:55,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:55,378 INFO L471 AbstractCegarLoop]: Abstraction has 4545 states and 6020 transitions. [2024-10-10 22:35:55,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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:35:55,379 INFO L276 IsEmpty]: Start isEmpty. Operand 4545 states and 6020 transitions. [2024-10-10 22:35:55,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-10 22:35:55,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:55,387 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:55,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:35:55,387 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:55,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:55,388 INFO L85 PathProgramCache]: Analyzing trace with hash -361906641, now seen corresponding path program 1 times [2024-10-10 22:35:55,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:55,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258011377] [2024-10-10 22:35:55,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:55,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-10 22:35:55,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:55,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258011377] [2024-10-10 22:35:55,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258011377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:55,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:55,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:35:55,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870984703] [2024-10-10 22:35:55,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:55,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:55,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:55,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:55,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:55,652 INFO L87 Difference]: Start difference. First operand 4545 states and 6020 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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:35:56,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:56,499 INFO L93 Difference]: Finished difference Result 11529 states and 15698 transitions. [2024-10-10 22:35:56,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:56,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202 [2024-10-10 22:35:56,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:56,527 INFO L225 Difference]: With dead ends: 11529 [2024-10-10 22:35:56,527 INFO L226 Difference]: Without dead ends: 6985 [2024-10-10 22:35:56,534 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:35:56,536 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 234 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:56,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 405 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:35:56,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6985 states. [2024-10-10 22:35:56,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6985 to 6170. [2024-10-10 22:35:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6170 states, 6169 states have (on average 1.2822175393094504) internal successors, (7910), 6169 states have internal predecessors, (7910), 0 states have call successors, (0), 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:35:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6170 states to 6170 states and 7910 transitions. [2024-10-10 22:35:56,710 INFO L78 Accepts]: Start accepts. Automaton has 6170 states and 7910 transitions. Word has length 202 [2024-10-10 22:35:56,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:56,711 INFO L471 AbstractCegarLoop]: Abstraction has 6170 states and 7910 transitions. [2024-10-10 22:35:56,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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:35:56,711 INFO L276 IsEmpty]: Start isEmpty. Operand 6170 states and 7910 transitions. [2024-10-10 22:35:56,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-10 22:35:56,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:56,720 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:56,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:35:56,721 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:56,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:56,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1921663349, now seen corresponding path program 1 times [2024-10-10 22:35:56,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:56,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112395527] [2024-10-10 22:35:56,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:56,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:35:56,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:56,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112395527] [2024-10-10 22:35:56,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112395527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:56,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:56,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:35:56,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459960594] [2024-10-10 22:35:56,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:56,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:56,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:56,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:56,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:56,993 INFO L87 Difference]: Start difference. First operand 6170 states and 7910 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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:35:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:57,954 INFO L93 Difference]: Finished difference Result 16211 states and 20755 transitions. [2024-10-10 22:35:57,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:57,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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 203 [2024-10-10 22:35:57,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:57,998 INFO L225 Difference]: With dead ends: 16211 [2024-10-10 22:35:57,999 INFO L226 Difference]: Without dead ends: 10042 [2024-10-10 22:35:58,012 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:35:58,013 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 202 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:58,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 386 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 22:35:58,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10042 states. [2024-10-10 22:35:58,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10042 to 10036. [2024-10-10 22:35:58,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10036 states, 10035 states have (on average 1.2309915296462381) internal successors, (12353), 10035 states have internal predecessors, (12353), 0 states have call successors, (0), 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:35:58,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10036 states to 10036 states and 12353 transitions. [2024-10-10 22:35:58,241 INFO L78 Accepts]: Start accepts. Automaton has 10036 states and 12353 transitions. Word has length 203 [2024-10-10 22:35:58,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:58,242 INFO L471 AbstractCegarLoop]: Abstraction has 10036 states and 12353 transitions. [2024-10-10 22:35:58,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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:35:58,243 INFO L276 IsEmpty]: Start isEmpty. Operand 10036 states and 12353 transitions. [2024-10-10 22:35:58,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-10 22:35:58,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:58,260 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:58,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 22:35:58,260 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:58,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:58,262 INFO L85 PathProgramCache]: Analyzing trace with hash -137385840, now seen corresponding path program 1 times [2024-10-10 22:35:58,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:58,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093514094] [2024-10-10 22:35:58,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:58,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:58,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:58,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093514094] [2024-10-10 22:35:58,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093514094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:58,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:58,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:35:58,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786069780] [2024-10-10 22:35:58,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:58,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:35:58,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:58,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:35:58,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:35:58,592 INFO L87 Difference]: Start difference. First operand 10036 states and 12353 transitions. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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:35:59,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:59,933 INFO L93 Difference]: Finished difference Result 20101 states and 24765 transitions. [2024-10-10 22:35:59,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:35:59,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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 212 [2024-10-10 22:35:59,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:59,956 INFO L225 Difference]: With dead ends: 20101 [2024-10-10 22:35:59,956 INFO L226 Difference]: Without dead ends: 10066 [2024-10-10 22:35:59,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:35:59,973 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 438 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:59,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 182 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 22:35:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10066 states. [2024-10-10 22:36:00,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10066 to 9427. [2024-10-10 22:36:00,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9427 states, 9426 states have (on average 1.23445788245279) internal successors, (11636), 9426 states have internal predecessors, (11636), 0 states have call successors, (0), 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:36:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9427 states to 9427 states and 11636 transitions. [2024-10-10 22:36:00,141 INFO L78 Accepts]: Start accepts. Automaton has 9427 states and 11636 transitions. Word has length 212 [2024-10-10 22:36:00,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:00,141 INFO L471 AbstractCegarLoop]: Abstraction has 9427 states and 11636 transitions. [2024-10-10 22:36:00,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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:36:00,142 INFO L276 IsEmpty]: Start isEmpty. Operand 9427 states and 11636 transitions. [2024-10-10 22:36:00,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-10 22:36:00,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:00,157 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:36:00,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 22:36:00,157 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:00,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:00,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2063725965, now seen corresponding path program 1 times [2024-10-10 22:36:00,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:00,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924627379] [2024-10-10 22:36:00,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:00,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-10 22:36:00,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:00,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924627379] [2024-10-10 22:36:00,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924627379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:00,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:36:00,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:36:00,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268998202] [2024-10-10 22:36:00,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:00,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:36:00,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:00,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:36:00,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:00,555 INFO L87 Difference]: Start difference. First operand 9427 states and 11636 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 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:36:01,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:01,370 INFO L93 Difference]: Finished difference Result 24772 states and 30465 transitions. [2024-10-10 22:36:01,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:36:01,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 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 216 [2024-10-10 22:36:01,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:01,401 INFO L225 Difference]: With dead ends: 24772 [2024-10-10 22:36:01,401 INFO L226 Difference]: Without dead ends: 15346 [2024-10-10 22:36:01,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:01,416 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 216 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:01,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 193 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:36:01,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15346 states. [2024-10-10 22:36:01,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15346 to 15334. [2024-10-10 22:36:01,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15334 states, 15333 states have (on average 1.2098741276984282) internal successors, (18551), 15333 states have internal predecessors, (18551), 0 states have call successors, (0), 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:36:01,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15334 states to 15334 states and 18551 transitions. [2024-10-10 22:36:01,693 INFO L78 Accepts]: Start accepts. Automaton has 15334 states and 18551 transitions. Word has length 216 [2024-10-10 22:36:01,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:01,693 INFO L471 AbstractCegarLoop]: Abstraction has 15334 states and 18551 transitions. [2024-10-10 22:36:01,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 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:36:01,694 INFO L276 IsEmpty]: Start isEmpty. Operand 15334 states and 18551 transitions. [2024-10-10 22:36:01,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-10 22:36:01,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:01,714 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:36:01,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 22:36:01,714 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:01,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:01,714 INFO L85 PathProgramCache]: Analyzing trace with hash 361389377, now seen corresponding path program 1 times [2024-10-10 22:36:01,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:01,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366608820] [2024-10-10 22:36:01,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:01,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:36:02,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:02,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366608820] [2024-10-10 22:36:02,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366608820] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:36:02,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967247982] [2024-10-10 22:36:02,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:02,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:36:02,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:36:02,146 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:36:02,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:36:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:02,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:36:02,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:36:02,700 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-10 22:36:02,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:36:02,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967247982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:02,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:36:02,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:36:02,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653658401] [2024-10-10 22:36:02,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:02,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:36:02,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:02,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:36:02,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:36:02,702 INFO L87 Difference]: Start difference. First operand 15334 states and 18551 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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:36:03,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:03,447 INFO L93 Difference]: Finished difference Result 40437 states and 49079 transitions. [2024-10-10 22:36:03,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:36:03,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 219 [2024-10-10 22:36:03,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:03,502 INFO L225 Difference]: With dead ends: 40437 [2024-10-10 22:36:03,503 INFO L226 Difference]: Without dead ends: 25307 [2024-10-10 22:36:03,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:36:03,526 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 86 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:03,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 167 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:36:03,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25307 states. [2024-10-10 22:36:03,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25307 to 24490. [2024-10-10 22:36:03,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24490 states, 24489 states have (on average 1.1900445097799013) internal successors, (29143), 24489 states have internal predecessors, (29143), 0 states have call successors, (0), 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:36:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24490 states to 24490 states and 29143 transitions. [2024-10-10 22:36:03,881 INFO L78 Accepts]: Start accepts. Automaton has 24490 states and 29143 transitions. Word has length 219 [2024-10-10 22:36:03,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:03,882 INFO L471 AbstractCegarLoop]: Abstraction has 24490 states and 29143 transitions. [2024-10-10 22:36:03,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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:36:03,882 INFO L276 IsEmpty]: Start isEmpty. Operand 24490 states and 29143 transitions. [2024-10-10 22:36:03,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-10 22:36:03,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:03,916 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:36:03,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 22:36:04,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-10 22:36:04,118 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:04,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:04,119 INFO L85 PathProgramCache]: Analyzing trace with hash 235016594, now seen corresponding path program 1 times [2024-10-10 22:36:04,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:04,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115204411] [2024-10-10 22:36:04,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:04,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:04,636 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-10 22:36:04,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:04,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115204411] [2024-10-10 22:36:04,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115204411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:04,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:36:04,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:36:04,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945665346] [2024-10-10 22:36:04,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:04,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:36:04,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:04,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:36:04,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:04,638 INFO L87 Difference]: Start difference. First operand 24490 states and 29143 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 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:36:05,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:05,597 INFO L93 Difference]: Finished difference Result 55936 states and 67053 transitions. [2024-10-10 22:36:05,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:36:05,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 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 246 [2024-10-10 22:36:05,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:05,660 INFO L225 Difference]: With dead ends: 55936 [2024-10-10 22:36:05,660 INFO L226 Difference]: Without dead ends: 32056 [2024-10-10 22:36:05,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:05,688 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 211 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:05,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 241 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:36:05,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32056 states. [2024-10-10 22:36:06,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32056 to 31819. [2024-10-10 22:36:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31819 states, 31818 states have (on average 1.201049720284116) internal successors, (38215), 31818 states have internal predecessors, (38215), 0 states have call successors, (0), 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:36:06,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31819 states to 31819 states and 38215 transitions. [2024-10-10 22:36:06,271 INFO L78 Accepts]: Start accepts. Automaton has 31819 states and 38215 transitions. Word has length 246 [2024-10-10 22:36:06,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:06,271 INFO L471 AbstractCegarLoop]: Abstraction has 31819 states and 38215 transitions. [2024-10-10 22:36:06,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 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:36:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 31819 states and 38215 transitions. [2024-10-10 22:36:06,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-10 22:36:06,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:06,300 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:36:06,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 22:36:06,300 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:06,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:06,301 INFO L85 PathProgramCache]: Analyzing trace with hash 59211616, now seen corresponding path program 1 times [2024-10-10 22:36:06,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:06,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695846840] [2024-10-10 22:36:06,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:06,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:06,841 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 92 proven. 6 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-10 22:36:06,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:06,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695846840] [2024-10-10 22:36:06,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695846840] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:36:06,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719506700] [2024-10-10 22:36:06,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:06,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:36:06,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:36:06,844 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:36:06,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:36:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:07,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:36:07,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:36:07,235 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-10-10 22:36:07,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:36:07,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719506700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:07,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:36:07,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:36:07,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380097904] [2024-10-10 22:36:07,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:07,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:36:07,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:07,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:36:07,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:36:07,238 INFO L87 Difference]: Start difference. First operand 31819 states and 38215 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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:36:08,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:08,087 INFO L93 Difference]: Finished difference Result 81337 states and 98129 transitions. [2024-10-10 22:36:08,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:36:08,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 249 [2024-10-10 22:36:08,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:08,166 INFO L225 Difference]: With dead ends: 81337 [2024-10-10 22:36:08,166 INFO L226 Difference]: Without dead ends: 50535 [2024-10-10 22:36:08,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:36:08,205 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 94 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:08,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 205 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:36:08,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50535 states. [2024-10-10 22:36:09,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50535 to 47074. [2024-10-10 22:36:09,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47074 states, 47073 states have (on average 1.191277377689971) internal successors, (56077), 47073 states have internal predecessors, (56077), 0 states have call successors, (0), 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:36:09,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47074 states to 47074 states and 56077 transitions. [2024-10-10 22:36:09,159 INFO L78 Accepts]: Start accepts. Automaton has 47074 states and 56077 transitions. Word has length 249 [2024-10-10 22:36:09,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:09,160 INFO L471 AbstractCegarLoop]: Abstraction has 47074 states and 56077 transitions. [2024-10-10 22:36:09,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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:36:09,160 INFO L276 IsEmpty]: Start isEmpty. Operand 47074 states and 56077 transitions. [2024-10-10 22:36:09,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-10-10 22:36:09,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:09,205 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:36:09,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 22:36:09,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:36:09,406 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:09,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:09,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1567586057, now seen corresponding path program 1 times [2024-10-10 22:36:09,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:09,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203390436] [2024-10-10 22:36:09,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:09,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:10,108 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 114 proven. 6 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-10-10 22:36:10,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:10,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203390436] [2024-10-10 22:36:10,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203390436] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:36:10,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709297302] [2024-10-10 22:36:10,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:10,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:36:10,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:36:10,111 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:36:10,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:36:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:10,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:36:10,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:36:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-10 22:36:10,362 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:36:10,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709297302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:10,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:36:10,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:36:10,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138369883] [2024-10-10 22:36:10,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:10,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:36:10,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:10,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:36:10,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:36:10,367 INFO L87 Difference]: Start difference. First operand 47074 states and 56077 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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:36:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:11,002 INFO L93 Difference]: Finished difference Result 127538 states and 152214 transitions. [2024-10-10 22:36:11,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:36:11,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 267 [2024-10-10 22:36:11,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:11,095 INFO L225 Difference]: With dead ends: 127538 [2024-10-10 22:36:11,095 INFO L226 Difference]: Without dead ends: 82295 [2024-10-10 22:36:11,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:36:11,132 INFO L432 NwaCegarLoop]: 619 mSDtfsCounter, 303 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:11,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 888 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:36:11,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82295 states. [2024-10-10 22:36:12,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82295 to 78633. [2024-10-10 22:36:12,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78633 states, 78632 states have (on average 1.1799521823176315) internal successors, (92782), 78632 states have internal predecessors, (92782), 0 states have call successors, (0), 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:36:12,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78633 states to 78633 states and 92782 transitions. [2024-10-10 22:36:12,331 INFO L78 Accepts]: Start accepts. Automaton has 78633 states and 92782 transitions. Word has length 267 [2024-10-10 22:36:12,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:12,332 INFO L471 AbstractCegarLoop]: Abstraction has 78633 states and 92782 transitions. [2024-10-10 22:36:12,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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:36:12,332 INFO L276 IsEmpty]: Start isEmpty. Operand 78633 states and 92782 transitions. [2024-10-10 22:36:12,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-10-10 22:36:12,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:12,391 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:36:12,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 22:36:12,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:36:12,593 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:12,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:12,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1643042511, now seen corresponding path program 1 times [2024-10-10 22:36:12,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:12,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564248041] [2024-10-10 22:36:12,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:12,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:13,267 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-10 22:36:13,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:13,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564248041] [2024-10-10 22:36:13,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564248041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:13,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:36:13,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:36:13,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581281047] [2024-10-10 22:36:13,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:13,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:36:13,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:13,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:36:13,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:36:13,270 INFO L87 Difference]: Start difference. First operand 78633 states and 92782 transitions. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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:36:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:14,329 INFO L93 Difference]: Finished difference Result 151659 states and 179345 transitions. [2024-10-10 22:36:14,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:36:14,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 276 [2024-10-10 22:36:14,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:14,416 INFO L225 Difference]: With dead ends: 151659 [2024-10-10 22:36:14,416 INFO L226 Difference]: Without dead ends: 71812 [2024-10-10 22:36:14,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:36:14,454 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 542 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:14,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 56 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:36:14,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71812 states. [2024-10-10 22:36:15,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71812 to 64088. [2024-10-10 22:36:15,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64088 states, 64087 states have (on average 1.1087115951753086) internal successors, (71054), 64087 states have internal predecessors, (71054), 0 states have call successors, (0), 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:36:15,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64088 states to 64088 states and 71054 transitions. [2024-10-10 22:36:15,545 INFO L78 Accepts]: Start accepts. Automaton has 64088 states and 71054 transitions. Word has length 276 [2024-10-10 22:36:15,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:15,545 INFO L471 AbstractCegarLoop]: Abstraction has 64088 states and 71054 transitions. [2024-10-10 22:36:15,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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:36:15,545 INFO L276 IsEmpty]: Start isEmpty. Operand 64088 states and 71054 transitions. [2024-10-10 22:36:15,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-10-10 22:36:15,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:15,575 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:36:15,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 22:36:15,575 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:15,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:15,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1027673615, now seen corresponding path program 1 times [2024-10-10 22:36:15,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:15,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592159688] [2024-10-10 22:36:15,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:15,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:16,395 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-10-10 22:36:16,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:16,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592159688] [2024-10-10 22:36:16,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592159688] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:36:16,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599145466] [2024-10-10 22:36:16,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:16,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:36:16,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:36:16,400 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:36:16,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 22:36:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:16,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:36:16,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:36:16,711 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-10 22:36:16,711 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:36:16,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599145466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:16,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:36:16,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:36:16,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29869821] [2024-10-10 22:36:16,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:16,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:36:16,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:16,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:36:16,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:36:16,714 INFO L87 Difference]: Start difference. First operand 64088 states and 71054 transitions. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:17,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:17,485 INFO L93 Difference]: Finished difference Result 110474 states and 122207 transitions. [2024-10-10 22:36:17,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:36:17,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 334 [2024-10-10 22:36:17,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:17,487 INFO L225 Difference]: With dead ends: 110474 [2024-10-10 22:36:17,487 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 22:36:17,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:36:17,522 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 161 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:17,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 307 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:36:17,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 22:36:17,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 22:36:17,523 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:36:17,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 22:36:17,524 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 334 [2024-10-10 22:36:17,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:17,524 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 22:36:17,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:17,524 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 22:36:17,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 22:36:17,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:36:17,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-10 22:36:17,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-10 22:36:17,731 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:36:17,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 22:36:23,842 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:36:23,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:36:23 BoogieIcfgContainer [2024-10-10 22:36:23,859 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:36:23,860 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:36:23,860 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:36:23,860 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:36:23,861 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:35:47" (3/4) ... [2024-10-10 22:36:23,862 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 22:36:23,898 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 22:36:23,900 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 22:36:23,902 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 22:36:23,904 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 22:36:24,143 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 22:36:24,143 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 22:36:24,143 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:36:24,144 INFO L158 Benchmark]: Toolchain (without parser) took 39516.27ms. Allocated memory was 159.4MB in the beginning and 8.2GB in the end (delta: 8.1GB). Free memory was 95.6MB in the beginning and 6.9GB in the end (delta: -6.9GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-10-10 22:36:24,144 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:36:24,145 INFO L158 Benchmark]: CACSL2BoogieTranslator took 864.98ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 95.2MB in the beginning and 145.2MB in the end (delta: -50.0MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. [2024-10-10 22:36:24,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 141.25ms. Allocated memory is still 213.9MB. Free memory was 144.1MB in the beginning and 129.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-10 22:36:24,145 INFO L158 Benchmark]: Boogie Preprocessor took 186.18ms. Allocated memory is still 213.9MB. Free memory was 129.5MB in the beginning and 116.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 22:36:24,146 INFO L158 Benchmark]: RCFGBuilder took 2107.07ms. Allocated memory is still 213.9MB. Free memory was 116.9MB in the beginning and 156.0MB in the end (delta: -39.1MB). Peak memory consumption was 95.1MB. Max. memory is 16.1GB. [2024-10-10 22:36:24,147 INFO L158 Benchmark]: TraceAbstraction took 35925.49ms. Allocated memory was 213.9MB in the beginning and 8.2GB in the end (delta: 8.0GB). Free memory was 154.9MB in the beginning and 7.0GB in the end (delta: -6.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-10-10 22:36:24,147 INFO L158 Benchmark]: Witness Printer took 283.53ms. Allocated memory is still 8.2GB. Free memory was 7.0GB in the beginning and 6.9GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-10 22:36:24,148 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.17ms. Allocated memory is still 159.4MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 864.98ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 95.2MB in the beginning and 145.2MB in the end (delta: -50.0MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 141.25ms. Allocated memory is still 213.9MB. Free memory was 144.1MB in the beginning and 129.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 186.18ms. Allocated memory is still 213.9MB. Free memory was 129.5MB in the beginning and 116.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2107.07ms. Allocated memory is still 213.9MB. Free memory was 116.9MB in the beginning and 156.0MB in the end (delta: -39.1MB). Peak memory consumption was 95.1MB. Max. memory is 16.1GB. * TraceAbstraction took 35925.49ms. Allocated memory was 213.9MB in the beginning and 8.2GB in the end (delta: 8.0GB). Free memory was 154.9MB in the beginning and 7.0GB in the end (delta: -6.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 283.53ms. Allocated memory is still 8.2GB. Free memory was 7.0GB in the beginning and 6.9GB in the end (delta: 26.2MB). Peak memory consumption was 25.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: 1552]: 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, 240 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.7s, OverallIterations: 16, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3519 SdHoareTripleChecker+Valid, 10.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3519 mSDsluCounter, 4261 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 624 mSDsCounter, 1852 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9465 IncrementalHoareTripleChecker+Invalid, 11317 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1852 mSolverCounterUnsat, 3637 mSDtfsCounter, 9465 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1106 GetRequests, 1081 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78633occurred in iteration=14, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 17427 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 4555 NumberOfCodeBlocks, 4555 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 4535 ConstructedInterpolants, 0 QuantifiedInterpolants, 8015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2143 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 PerfectInterpolantSequences, 2078/2102 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: 1668]: Loop Invariant Derived loop invariant: ((((((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a27 == 1)) && (a3 == 0)) || (((a26 == 1) && (a5 == 1)) && (a11 == 1))) || ((((a5 == 1) && (a12 == 1)) && (a11 == 1)) && (a3 == 1))) || (((a5 == 1) && (a11 == 1)) && (a6 <= 0))) || (((a5 == 1) && (a11 == 1)) && (a27 == 1))) || ((a5 == 1) && (a11 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-10-10 22:36:24,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE