./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/Problem10_label04.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/Problem10_label04.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 b7b6f186ede66b25b51c633a55bb25e291eb69596590009e014f685be0bc2be5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:15:40,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:15:40,526 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:15:40,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:15:40,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:15:40,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:15:40,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:15:40,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:15:40,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:15:40,564 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:15:40,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:15:40,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:15:40,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:15:40,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:15:40,569 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:15:40,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:15:40,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:15:40,570 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:15:40,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:15:40,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:15:40,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:15:40,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:15:40,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:15:40,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:15:40,575 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:15:40,575 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:15:40,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:15:40,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:15:40,576 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:15:40,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:15:40,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:15:40,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:15:40,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:15:40,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:15:40,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:15:40,580 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:15:40,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:15:40,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:15:40,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:15:40,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:15:40,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:15:40,582 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:15:40,582 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 -> b7b6f186ede66b25b51c633a55bb25e291eb69596590009e014f685be0bc2be5 [2024-10-10 23:15:40,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:15:40,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:15:40,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:15:40,855 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:15:40,856 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:15:40,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label04.c [2024-10-10 23:15:42,328 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:15:42,611 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:15:42,611 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label04.c [2024-10-10 23:15:42,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bae92bcac/8ffc0df6f81e4b209bff7d5a7ea45d16/FLAG6bde917a0 [2024-10-10 23:15:42,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bae92bcac/8ffc0df6f81e4b209bff7d5a7ea45d16 [2024-10-10 23:15:42,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:15:42,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:15:42,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:15:42,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:15:42,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:15:42,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:15:42" (1/1) ... [2024-10-10 23:15:42,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c2cb21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:42, skipping insertion in model container [2024-10-10 23:15:42,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:15:42" (1/1) ... [2024-10-10 23:15:42,700 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:15:43,012 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/Problem10_label04.c[7502,7515] [2024-10-10 23:15:43,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:15:43,162 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:15:43,194 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/Problem10_label04.c[7502,7515] [2024-10-10 23:15:43,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:15:43,283 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:15:43,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:43 WrapperNode [2024-10-10 23:15:43,284 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:15:43,285 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:15:43,285 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:15:43,285 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:15:43,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:43" (1/1) ... [2024-10-10 23:15:43,306 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:43" (1/1) ... [2024-10-10 23:15:43,363 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-10-10 23:15:43,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:15:43,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:15:43,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:15:43,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:15:43,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:43" (1/1) ... [2024-10-10 23:15:43,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:43" (1/1) ... [2024-10-10 23:15:43,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:43" (1/1) ... [2024-10-10 23:15:43,427 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:15:43,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:43" (1/1) ... [2024-10-10 23:15:43,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:43" (1/1) ... [2024-10-10 23:15:43,453 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:43" (1/1) ... [2024-10-10 23:15:43,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:43" (1/1) ... [2024-10-10 23:15:43,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:43" (1/1) ... [2024-10-10 23:15:43,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:43" (1/1) ... [2024-10-10 23:15:43,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:15:43,483 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:15:43,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:15:43,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:15:43,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:43" (1/1) ... [2024-10-10 23:15:43,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:15:43,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:15:43,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:15:43,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:15:43,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:15:43,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:15:43,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:15:43,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:15:43,647 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:15:43,649 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:15:44,834 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-10 23:15:44,834 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:15:44,877 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:15:44,877 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:15:44,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:15:44 BoogieIcfgContainer [2024-10-10 23:15:44,878 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:15:44,880 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:15:44,880 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:15:44,883 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:15:44,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:15:42" (1/3) ... [2024-10-10 23:15:44,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1487c290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:15:44, skipping insertion in model container [2024-10-10 23:15:44,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:43" (2/3) ... [2024-10-10 23:15:44,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1487c290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:15:44, skipping insertion in model container [2024-10-10 23:15:44,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:15:44" (3/3) ... [2024-10-10 23:15:44,886 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label04.c [2024-10-10 23:15:44,901 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:15:44,902 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:15:44,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:15:44,981 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;@1f3a9e1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:15:44,982 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:15:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:44,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-10 23:15:44,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:44,995 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] [2024-10-10 23:15:44,997 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:45,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:45,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1794914845, now seen corresponding path program 1 times [2024-10-10 23:15:45,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:45,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656323465] [2024-10-10 23:15:45,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:45,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:45,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:15:45,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:45,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656323465] [2024-10-10 23:15:45,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656323465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:45,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:45,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:15:45,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581600207] [2024-10-10 23:15:45,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:45,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:15:45,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:45,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:15:45,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:15:45,273 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 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 32.5) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:45,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:45,317 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2024-10-10 23:15:45,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:15:45,323 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-10-10 23:15:45,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:45,334 INFO L225 Difference]: With dead ends: 287 [2024-10-10 23:15:45,334 INFO L226 Difference]: Without dead ends: 142 [2024-10-10 23:15:45,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:15:45,342 INFO L432 NwaCegarLoop]: 217 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, 217 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:45,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:15:45,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-10 23:15:45,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-10 23:15:45,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:45,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-10 23:15:45,396 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 65 [2024-10-10 23:15:45,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:45,397 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-10 23:15:45,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:45,398 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-10 23:15:45,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-10 23:15:45,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:45,400 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] [2024-10-10 23:15:45,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:15:45,401 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:45,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:45,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1248314373, now seen corresponding path program 1 times [2024-10-10 23:15:45,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:45,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925342498] [2024-10-10 23:15:45,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:45,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:15:45,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:45,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925342498] [2024-10-10 23:15:45,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925342498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:45,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:45,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:15:45,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953295266] [2024-10-10 23:15:45,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:45,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:15:45,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:45,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:15:45,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:15:45,771 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:46,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:46,765 INFO L93 Difference]: Finished difference Result 561 states and 863 transitions. [2024-10-10 23:15:46,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:15:46,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-10-10 23:15:46,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:46,773 INFO L225 Difference]: With dead ends: 561 [2024-10-10 23:15:46,773 INFO L226 Difference]: Without dead ends: 420 [2024-10-10 23:15:46,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:15:46,775 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 384 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:46,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 14 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:15:46,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-10 23:15:46,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-10-10 23:15:46,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.3842482100238664) internal successors, (580), 419 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 580 transitions. [2024-10-10 23:15:46,819 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 580 transitions. Word has length 65 [2024-10-10 23:15:46,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:46,820 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 580 transitions. [2024-10-10 23:15:46,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:46,820 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 580 transitions. [2024-10-10 23:15:46,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-10 23:15:46,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:46,830 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:15:46,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:15:46,831 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:46,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:46,836 INFO L85 PathProgramCache]: Analyzing trace with hash 102913593, now seen corresponding path program 1 times [2024-10-10 23:15:46,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:46,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372600292] [2024-10-10 23:15:46,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:46,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:47,277 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-10 23:15:47,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:47,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372600292] [2024-10-10 23:15:47,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372600292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:47,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:47,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:15:47,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570178520] [2024-10-10 23:15:47,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:47,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:47,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:47,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:47,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:47,286 INFO L87 Difference]: Start difference. First operand 420 states and 580 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:47,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:47,759 INFO L93 Difference]: Finished difference Result 978 states and 1439 transitions. [2024-10-10 23:15:47,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:47,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 23:15:47,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:47,765 INFO L225 Difference]: With dead ends: 978 [2024-10-10 23:15:47,765 INFO L226 Difference]: Without dead ends: 698 [2024-10-10 23:15:47,766 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 23:15:47,767 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 76 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:47,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 223 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:15:47,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-10 23:15:47,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 559. [2024-10-10 23:15:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3154121863799284) internal successors, (734), 558 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:47,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 734 transitions. [2024-10-10 23:15:47,799 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 734 transitions. Word has length 246 [2024-10-10 23:15:47,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:47,801 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 734 transitions. [2024-10-10 23:15:47,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 734 transitions. [2024-10-10 23:15:47,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-10-10 23:15:47,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:47,807 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:15:47,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:15:47,808 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:47,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:47,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1724298922, now seen corresponding path program 1 times [2024-10-10 23:15:47,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:47,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826517541] [2024-10-10 23:15:47,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:47,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:48,079 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-10 23:15:48,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:48,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826517541] [2024-10-10 23:15:48,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826517541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:48,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:48,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:15:48,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886730383] [2024-10-10 23:15:48,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:48,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:48,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:48,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:48,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:48,086 INFO L87 Difference]: Start difference. First operand 559 states and 734 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:48,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:48,562 INFO L93 Difference]: Finished difference Result 1117 states and 1532 transitions. [2024-10-10 23:15:48,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:48,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 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 252 [2024-10-10 23:15:48,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:48,566 INFO L225 Difference]: With dead ends: 1117 [2024-10-10 23:15:48,566 INFO L226 Difference]: Without dead ends: 698 [2024-10-10 23:15:48,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:48,568 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 55 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:48,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 32 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:15:48,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-10 23:15:48,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-10-10 23:15:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.2812051649928264) internal successors, (893), 697 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 893 transitions. [2024-10-10 23:15:48,594 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 893 transitions. Word has length 252 [2024-10-10 23:15:48,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:48,594 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 893 transitions. [2024-10-10 23:15:48,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:48,595 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 893 transitions. [2024-10-10 23:15:48,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-10-10 23:15:48,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:48,600 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-10 23:15:48,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:15:48,601 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:48,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:48,602 INFO L85 PathProgramCache]: Analyzing trace with hash -967105469, now seen corresponding path program 1 times [2024-10-10 23:15:48,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:48,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370770253] [2024-10-10 23:15:48,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:48,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:48,930 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-10 23:15:48,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:48,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370770253] [2024-10-10 23:15:48,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370770253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:48,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:48,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:15:48,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208997574] [2024-10-10 23:15:48,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:48,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:48,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:48,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:48,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:48,934 INFO L87 Difference]: Start difference. First operand 698 states and 893 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:49,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:49,380 INFO L93 Difference]: Finished difference Result 1395 states and 1830 transitions. [2024-10-10 23:15:49,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:49,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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 320 [2024-10-10 23:15:49,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:49,384 INFO L225 Difference]: With dead ends: 1395 [2024-10-10 23:15:49,384 INFO L226 Difference]: Without dead ends: 837 [2024-10-10 23:15:49,385 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 23:15:49,386 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 76 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:49,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 212 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:15:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-10 23:15:49,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2024-10-10 23:15:49,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.2464114832535884) internal successors, (1042), 836 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:49,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1042 transitions. [2024-10-10 23:15:49,405 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1042 transitions. Word has length 320 [2024-10-10 23:15:49,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:49,406 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1042 transitions. [2024-10-10 23:15:49,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:49,407 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1042 transitions. [2024-10-10 23:15:49,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-10-10 23:15:49,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:49,411 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2024-10-10 23:15:49,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:15:49,412 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:49,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:49,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1830663381, now seen corresponding path program 1 times [2024-10-10 23:15:49,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:49,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902962513] [2024-10-10 23:15:49,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:49,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:49,981 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-10-10 23:15:49,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:49,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902962513] [2024-10-10 23:15:49,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902962513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:49,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:49,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:15:49,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294620039] [2024-10-10 23:15:49,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:49,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:15:49,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:49,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:15:49,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:15:49,986 INFO L87 Difference]: Start difference. First operand 837 states and 1042 transitions. Second operand has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 6 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 23:15:50,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:50,452 INFO L93 Difference]: Finished difference Result 1589 states and 1994 transitions. [2024-10-10 23:15:50,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:15:50,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 6 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 329 [2024-10-10 23:15:50,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:50,459 INFO L225 Difference]: With dead ends: 1589 [2024-10-10 23:15:50,459 INFO L226 Difference]: Without dead ends: 837 [2024-10-10 23:15:50,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:15:50,462 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:50,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 20 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:15:50,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-10 23:15:50,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2024-10-10 23:15:50,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.2416267942583732) internal successors, (1038), 836 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1038 transitions. [2024-10-10 23:15:50,489 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1038 transitions. Word has length 329 [2024-10-10 23:15:50,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:50,489 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1038 transitions. [2024-10-10 23:15:50,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 6 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 23:15:50,491 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1038 transitions. [2024-10-10 23:15:50,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-10-10 23:15:50,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:50,496 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:15:50,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:15:50,497 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:50,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:50,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2042782789, now seen corresponding path program 1 times [2024-10-10 23:15:50,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:50,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367421679] [2024-10-10 23:15:50,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:50,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:51,026 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 391 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:15:51,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:51,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367421679] [2024-10-10 23:15:51,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367421679] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:15:51,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321865838] [2024-10-10 23:15:51,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:51,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:15:51,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:15:51,030 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:15:51,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:15:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:51,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:15:51,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:15:51,462 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-10 23:15:51,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:15:51,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321865838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:51,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:15:51,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:15:51,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487930394] [2024-10-10 23:15:51,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:51,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:51,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:51,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:51,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:15:51,465 INFO L87 Difference]: Start difference. First operand 837 states and 1038 transitions. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:51,991 INFO L93 Difference]: Finished difference Result 2090 states and 2636 transitions. [2024-10-10 23:15:51,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:51,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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 365 [2024-10-10 23:15:51,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:51,997 INFO L225 Difference]: With dead ends: 2090 [2024-10-10 23:15:51,998 INFO L226 Difference]: Without dead ends: 1393 [2024-10-10 23:15:51,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:15:52,000 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 26 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:52,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 192 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:15:52,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-10-10 23:15:52,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1393. [2024-10-10 23:15:52,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1392 states have (on average 1.1989942528735633) internal successors, (1669), 1392 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:52,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1669 transitions. [2024-10-10 23:15:52,024 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1669 transitions. Word has length 365 [2024-10-10 23:15:52,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:52,025 INFO L471 AbstractCegarLoop]: Abstraction has 1393 states and 1669 transitions. [2024-10-10 23:15:52,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:52,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1669 transitions. [2024-10-10 23:15:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2024-10-10 23:15:52,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:52,032 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:15:52,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:15:52,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:15:52,233 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:52,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:52,234 INFO L85 PathProgramCache]: Analyzing trace with hash 809711531, now seen corresponding path program 1 times [2024-10-10 23:15:52,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:52,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599921178] [2024-10-10 23:15:52,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:52,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-10-10 23:15:52,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:52,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599921178] [2024-10-10 23:15:52,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599921178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:52,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:52,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:15:52,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406945458] [2024-10-10 23:15:52,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:52,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:52,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:52,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:52,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:52,553 INFO L87 Difference]: Start difference. First operand 1393 states and 1669 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:53,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:53,072 INFO L93 Difference]: Finished difference Result 3063 states and 3735 transitions. [2024-10-10 23:15:53,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:53,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 378 [2024-10-10 23:15:53,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:53,079 INFO L225 Difference]: With dead ends: 3063 [2024-10-10 23:15:53,080 INFO L226 Difference]: Without dead ends: 1810 [2024-10-10 23:15:53,083 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 23:15:53,084 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 76 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:53,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 222 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:15:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-10-10 23:15:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1671. [2024-10-10 23:15:53,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1670 states have (on average 1.1808383233532933) internal successors, (1972), 1670 states have internal predecessors, (1972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:53,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 1972 transitions. [2024-10-10 23:15:53,118 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 1972 transitions. Word has length 378 [2024-10-10 23:15:53,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:53,118 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 1972 transitions. [2024-10-10 23:15:53,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 1972 transitions. [2024-10-10 23:15:53,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2024-10-10 23:15:53,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:53,126 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:15:53,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:15:53,127 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:53,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:53,128 INFO L85 PathProgramCache]: Analyzing trace with hash -50319504, now seen corresponding path program 1 times [2024-10-10 23:15:53,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:53,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610075651] [2024-10-10 23:15:53,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:53,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:53,795 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-10-10 23:15:53,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:53,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610075651] [2024-10-10 23:15:53,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610075651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:53,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:53,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:15:53,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501117450] [2024-10-10 23:15:53,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:53,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:15:53,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:53,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:15:53,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:15:53,800 INFO L87 Difference]: Start difference. First operand 1671 states and 1972 transitions. Second operand has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 6 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:54,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:54,457 INFO L93 Difference]: Finished difference Result 3118 states and 3667 transitions. [2024-10-10 23:15:54,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:15:54,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 6 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 379 [2024-10-10 23:15:54,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:54,459 INFO L225 Difference]: With dead ends: 3118 [2024-10-10 23:15:54,459 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:15:54,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:15:54,464 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 89 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:54,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 21 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:15:54,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:15:54,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:15:54,465 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 23:15:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:15:54,465 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 379 [2024-10-10 23:15:54,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:54,466 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:15:54,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 6 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:54,466 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:15:54,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:15:54,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:15:54,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:15:54,473 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:15:54,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:15:54,574 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:15:54,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:15:54 BoogieIcfgContainer [2024-10-10 23:15:54,593 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:15:54,593 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:15:54,593 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:15:54,593 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:15:54,594 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:15:44" (3/4) ... [2024-10-10 23:15:54,598 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:15:54,611 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:15:54,615 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:15:54,615 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:15:54,616 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:15:54,770 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:15:54,770 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:15:54,770 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:15:54,771 INFO L158 Benchmark]: Toolchain (without parser) took 12120.88ms. Allocated memory was 176.2MB in the beginning and 388.0MB in the end (delta: 211.8MB). Free memory was 110.6MB in the beginning and 123.4MB in the end (delta: -12.8MB). Peak memory consumption was 198.6MB. Max. memory is 16.1GB. [2024-10-10 23:15:54,771 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 50.9MB in the beginning and 50.9MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:15:54,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 630.75ms. Allocated memory is still 176.2MB. Free memory was 110.1MB in the beginning and 128.0MB in the end (delta: -17.9MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-10-10 23:15:54,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.95ms. Allocated memory is still 176.2MB. Free memory was 128.0MB in the beginning and 119.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-10 23:15:54,772 INFO L158 Benchmark]: Boogie Preprocessor took 117.70ms. Allocated memory is still 176.2MB. Free memory was 119.7MB in the beginning and 109.8MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-10 23:15:54,775 INFO L158 Benchmark]: RCFGBuilder took 1395.18ms. Allocated memory was 176.2MB in the beginning and 216.0MB in the end (delta: 39.8MB). Free memory was 109.8MB in the beginning and 169.8MB in the end (delta: -60.0MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. [2024-10-10 23:15:54,776 INFO L158 Benchmark]: TraceAbstraction took 9712.51ms. Allocated memory was 216.0MB in the beginning and 388.0MB in the end (delta: 172.0MB). Free memory was 168.7MB in the beginning and 134.9MB in the end (delta: 33.8MB). Peak memory consumption was 205.8MB. Max. memory is 16.1GB. [2024-10-10 23:15:54,776 INFO L158 Benchmark]: Witness Printer took 177.33ms. Allocated memory is still 388.0MB. Free memory was 134.9MB in the beginning and 123.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 23:15:54,777 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 96.5MB. Free memory was 50.9MB in the beginning and 50.9MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 630.75ms. Allocated memory is still 176.2MB. Free memory was 110.1MB in the beginning and 128.0MB in the end (delta: -17.9MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.95ms. Allocated memory is still 176.2MB. Free memory was 128.0MB in the beginning and 119.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.70ms. Allocated memory is still 176.2MB. Free memory was 119.7MB in the beginning and 109.8MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1395.18ms. Allocated memory was 176.2MB in the beginning and 216.0MB in the end (delta: 39.8MB). Free memory was 109.8MB in the beginning and 169.8MB in the end (delta: -60.0MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9712.51ms. Allocated memory was 216.0MB in the beginning and 388.0MB in the end (delta: 172.0MB). Free memory was 168.7MB in the beginning and 134.9MB in the end (delta: 33.8MB). Peak memory consumption was 205.8MB. Max. memory is 16.1GB. * Witness Printer took 177.33ms. Allocated memory is still 388.0MB. Free memory was 134.9MB in the beginning and 123.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. 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: 212]: 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, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 924 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 924 mSDsluCounter, 1153 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 508 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3868 IncrementalHoareTripleChecker+Invalid, 4376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 508 mSolverCounterUnsat, 1098 mSDtfsCounter, 3868 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 398 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1671occurred in iteration=8, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 278 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2764 NumberOfCodeBlocks, 2764 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2754 ConstructedInterpolants, 0 QuantifiedInterpolants, 10899 SizeOfPredicates, 0 NumberOfNonLiveVariables, 492 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 2924/2969 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: 592]: Loop Invariant Derived loop invariant: ((((((a19 != 6) && (14 == a4)) && (a12 == 0)) || (((a10 == 0) && (14 == a4)) && (a12 == 0))) || (((a10 == 3) && (14 == a4)) && (a12 == 0))) || (((a10 == 4) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:15:54,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE