./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-31.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 150a4f89afb8d47829e7ddadced75f5718c6f777677ea3eeca89c33b976a5a9c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:54:11,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:54:11,172 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:54:11,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:54:11,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:54:11,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:54:11,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:54:11,198 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:54:11,198 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:54:11,200 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:54:11,200 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:54:11,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:54:11,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:54:11,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:54:11,201 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:54:11,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:54:11,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:54:11,202 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:54:11,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:54:11,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:54:11,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:54:11,203 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:54:11,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:54:11,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:54:11,203 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:54:11,204 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:54:11,204 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:54:11,204 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:54:11,204 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:54:11,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:54:11,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:54:11,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:54:11,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:54:11,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:54:11,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:54:11,205 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:54:11,205 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:54:11,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:54:11,205 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:54:11,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:54:11,205 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:54:11,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:54:11,206 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 150a4f89afb8d47829e7ddadced75f5718c6f777677ea3eeca89c33b976a5a9c [2024-10-24 08:54:11,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:54:11,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:54:11,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:54:11,397 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:54:11,397 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:54:11,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-31.i [2024-10-24 08:54:12,635 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:54:12,784 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:54:12,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-31.i [2024-10-24 08:54:12,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8218f115/42e6cec6758548b09298cfb2d8c45b51/FLAG0e962d2e9 [2024-10-24 08:54:13,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8218f115/42e6cec6758548b09298cfb2d8c45b51 [2024-10-24 08:54:13,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:54:13,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:54:13,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:54:13,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:54:13,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:54:13,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:54:13" (1/1) ... [2024-10-24 08:54:13,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b12373f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:13, skipping insertion in model container [2024-10-24 08:54:13,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:54:13" (1/1) ... [2024-10-24 08:54:13,224 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:54:13,395 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-31.i[916,929] [2024-10-24 08:54:13,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:54:13,448 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:54:13,458 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-31.i[916,929] [2024-10-24 08:54:13,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:54:13,494 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:54:13,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:13 WrapperNode [2024-10-24 08:54:13,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:54:13,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:54:13,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:54:13,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:54:13,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:13" (1/1) ... [2024-10-24 08:54:13,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:13" (1/1) ... [2024-10-24 08:54:13,525 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-10-24 08:54:13,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:54:13,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:54:13,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:54:13,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:54:13,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:13" (1/1) ... [2024-10-24 08:54:13,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:13" (1/1) ... [2024-10-24 08:54:13,536 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:13" (1/1) ... [2024-10-24 08:54:13,550 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-24 08:54:13,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:13" (1/1) ... [2024-10-24 08:54:13,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:13" (1/1) ... [2024-10-24 08:54:13,555 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:13" (1/1) ... [2024-10-24 08:54:13,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:13" (1/1) ... [2024-10-24 08:54:13,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:13" (1/1) ... [2024-10-24 08:54:13,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:13" (1/1) ... [2024-10-24 08:54:13,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:54:13,570 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:54:13,570 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:54:13,570 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:54:13,570 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:13" (1/1) ... [2024-10-24 08:54:13,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:54:13,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:54:13,601 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 08:54:13,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 08:54:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:54:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:54:13,638 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:54:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:54:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:54:13,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:54:13,698 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:54:13,699 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:54:13,851 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 08:54:13,852 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:54:13,876 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:54:13,876 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:54:13,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:54:13 BoogieIcfgContainer [2024-10-24 08:54:13,877 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:54:13,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:54:13,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:54:13,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:54:13,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:54:13" (1/3) ... [2024-10-24 08:54:13,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@734fdaa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:54:13, skipping insertion in model container [2024-10-24 08:54:13,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:13" (2/3) ... [2024-10-24 08:54:13,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@734fdaa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:54:13, skipping insertion in model container [2024-10-24 08:54:13,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:54:13" (3/3) ... [2024-10-24 08:54:13,882 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-31.i [2024-10-24 08:54:13,895 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:54:13,896 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:54:13,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:54:13,942 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;@28ac6b9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:54:13,942 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:54:13,944 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 08:54:13,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 08:54:13,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:54:13,952 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:54:13,952 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:54:13,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:54:13,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2056872258, now seen corresponding path program 1 times [2024-10-24 08:54:13,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:54:13,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577260037] [2024-10-24 08:54:13,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:13,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:54:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:14,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:54:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:14,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:54:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:14,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:54:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:14,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:54:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:14,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:54:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:14,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:54:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:14,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:54:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:14,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:54:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:14,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:54:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:14,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:54:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:14,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:54:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:14,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:54:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 08:54:14,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:54:14,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577260037] [2024-10-24 08:54:14,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577260037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:54:14,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:54:14,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:54:14,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011212864] [2024-10-24 08:54:14,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:54:14,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:54:14,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:54:14,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:54:14,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:54:14,231 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 08:54:14,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:54:14,263 INFO L93 Difference]: Finished difference Result 76 states and 134 transitions. [2024-10-24 08:54:14,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:54:14,265 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 75 [2024-10-24 08:54:14,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:54:14,271 INFO L225 Difference]: With dead ends: 76 [2024-10-24 08:54:14,272 INFO L226 Difference]: Without dead ends: 37 [2024-10-24 08:54:14,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-24 08:54:14,279 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:54:14,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:54:14,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-24 08:54:14,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-24 08:54:14,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 08:54:14,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2024-10-24 08:54:14,319 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 75 [2024-10-24 08:54:14,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:54:14,320 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2024-10-24 08:54:14,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 08:54:14,320 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2024-10-24 08:54:14,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 08:54:14,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:54:14,323 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:54:14,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:54:14,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:54:14,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:54:14,325 INFO L85 PathProgramCache]: Analyzing trace with hash 840071164, now seen corresponding path program 1 times [2024-10-24 08:54:14,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:54:14,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616730255] [2024-10-24 08:54:14,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:14,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:54:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:15,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:54:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:15,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:54:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:15,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:54:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:15,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:54:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:15,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:54:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:15,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:54:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:15,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:54:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:15,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:54:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:15,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:54:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:15,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:54:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:15,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:54:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:15,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:54:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 08:54:15,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:54:15,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616730255] [2024-10-24 08:54:15,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616730255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:54:15,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:54:15,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 08:54:15,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326264266] [2024-10-24 08:54:15,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:54:15,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 08:54:15,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:54:15,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 08:54:15,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:54:15,330 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 08:54:15,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:54:15,492 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2024-10-24 08:54:15,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 08:54:15,493 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 75 [2024-10-24 08:54:15,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:54:15,495 INFO L225 Difference]: With dead ends: 52 [2024-10-24 08:54:15,496 INFO L226 Difference]: Without dead ends: 50 [2024-10-24 08:54:15,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:54:15,497 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 65 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:54:15,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 122 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:54:15,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-24 08:54:15,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2024-10-24 08:54:15,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 08:54:15,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2024-10-24 08:54:15,510 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 75 [2024-10-24 08:54:15,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:54:15,512 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2024-10-24 08:54:15,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 08:54:15,513 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2024-10-24 08:54:15,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 08:54:15,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:54:15,516 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:54:15,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:54:15,517 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:54:15,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:54:15,517 INFO L85 PathProgramCache]: Analyzing trace with hash 272510934, now seen corresponding path program 1 times [2024-10-24 08:54:15,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:54:15,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586548234] [2024-10-24 08:54:15,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:15,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:54:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:16,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:54:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:16,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:54:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:16,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:54:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:16,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:54:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:16,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:54:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:16,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:54:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:16,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:54:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:16,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:54:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:16,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:54:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:16,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:54:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:16,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:54:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:16,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:54:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:16,264 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 08:54:16,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:54:16,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586548234] [2024-10-24 08:54:16,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586548234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:54:16,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:54:16,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 08:54:16,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316277436] [2024-10-24 08:54:16,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:54:16,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 08:54:16,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:54:16,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 08:54:16,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:54:16,267 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 08:54:16,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:54:16,444 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2024-10-24 08:54:16,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 08:54:16,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 76 [2024-10-24 08:54:16,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:54:16,446 INFO L225 Difference]: With dead ends: 56 [2024-10-24 08:54:16,446 INFO L226 Difference]: Without dead ends: 54 [2024-10-24 08:54:16,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-24 08:54:16,447 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 39 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:54:16,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 155 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:54:16,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-24 08:54:16,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2024-10-24 08:54:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 08:54:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2024-10-24 08:54:16,454 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 76 [2024-10-24 08:54:16,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:54:16,455 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2024-10-24 08:54:16,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 08:54:16,455 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2024-10-24 08:54:16,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 08:54:16,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:54:16,456 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:54:16,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 08:54:16,457 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:54:16,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:54:16,457 INFO L85 PathProgramCache]: Analyzing trace with hash 272570516, now seen corresponding path program 1 times [2024-10-24 08:54:16,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:54:16,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670015879] [2024-10-24 08:54:16,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:16,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:54:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:54:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:54:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:54:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:54:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:54:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:54:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:54:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:54:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:54:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:54:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:54:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:54:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,072 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 08:54:17,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:54:17,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670015879] [2024-10-24 08:54:17,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670015879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:54:17,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:54:17,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 08:54:17,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597235] [2024-10-24 08:54:17,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:54:17,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 08:54:17,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:54:17,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 08:54:17,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:54:17,075 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 08:54:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:54:17,289 INFO L93 Difference]: Finished difference Result 94 states and 127 transitions. [2024-10-24 08:54:17,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 08:54:17,290 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 76 [2024-10-24 08:54:17,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:54:17,291 INFO L225 Difference]: With dead ends: 94 [2024-10-24 08:54:17,291 INFO L226 Difference]: Without dead ends: 92 [2024-10-24 08:54:17,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-24 08:54:17,292 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 60 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:54:17,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 290 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:54:17,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-24 08:54:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2024-10-24 08:54:17,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.34) internal successors, (67), 51 states have internal predecessors, (67), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 08:54:17,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 107 transitions. [2024-10-24 08:54:17,306 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 107 transitions. Word has length 76 [2024-10-24 08:54:17,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:54:17,306 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 107 transitions. [2024-10-24 08:54:17,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 08:54:17,307 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 107 transitions. [2024-10-24 08:54:17,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 08:54:17,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:54:17,308 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:54:17,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 08:54:17,308 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:54:17,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:54:17,308 INFO L85 PathProgramCache]: Analyzing trace with hash -136757824, now seen corresponding path program 1 times [2024-10-24 08:54:17,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:54:17,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332091241] [2024-10-24 08:54:17,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:17,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:54:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:54:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:54:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:54:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:54:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:54:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:54:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:54:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:54:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:54:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:54:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:54:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:54:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 08:54:17,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:54:17,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332091241] [2024-10-24 08:54:17,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332091241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:54:17,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:54:17,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 08:54:17,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207838444] [2024-10-24 08:54:17,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:54:17,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 08:54:17,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:54:17,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 08:54:17,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:54:17,740 INFO L87 Difference]: Start difference. First operand 74 states and 107 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 08:54:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:54:17,987 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2024-10-24 08:54:17,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 08:54:17,987 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 76 [2024-10-24 08:54:17,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:54:17,989 INFO L225 Difference]: With dead ends: 118 [2024-10-24 08:54:17,991 INFO L226 Difference]: Without dead ends: 116 [2024-10-24 08:54:17,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-24 08:54:17,992 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 98 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:54:17,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 291 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:54:17,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-24 08:54:18,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 75. [2024-10-24 08:54:18,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 52 states have internal predecessors, (69), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 08:54:18,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2024-10-24 08:54:18,005 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 76 [2024-10-24 08:54:18,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:54:18,005 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2024-10-24 08:54:18,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 08:54:18,006 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2024-10-24 08:54:18,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 08:54:18,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:54:18,006 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:54:18,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 08:54:18,007 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:54:18,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:54:18,007 INFO L85 PathProgramCache]: Analyzing trace with hash -186528079, now seen corresponding path program 1 times [2024-10-24 08:54:18,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:54:18,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308188341] [2024-10-24 08:54:18,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:18,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:54:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:54:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:54:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:54:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:54:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:54:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:54:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:54:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:54:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:54:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:54:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:54:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:54:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-24 08:54:18,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:54:18,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308188341] [2024-10-24 08:54:18,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308188341] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:54:18,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185566567] [2024-10-24 08:54:18,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:18,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:54:18,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:54:18,091 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:54:18,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 08:54:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 08:54:18,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:54:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-24 08:54:18,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:54:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-24 08:54:18,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185566567] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:54:18,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 08:54:18,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-24 08:54:18,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279282427] [2024-10-24 08:54:18,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 08:54:18,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 08:54:18,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:54:18,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 08:54:18,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:54:18,364 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-24 08:54:18,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:54:18,447 INFO L93 Difference]: Finished difference Result 152 states and 208 transitions. [2024-10-24 08:54:18,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 08:54:18,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 77 [2024-10-24 08:54:18,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:54:18,449 INFO L225 Difference]: With dead ends: 152 [2024-10-24 08:54:18,449 INFO L226 Difference]: Without dead ends: 78 [2024-10-24 08:54:18,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-24 08:54:18,450 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:54:18,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 53 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:54:18,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-24 08:54:18,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2024-10-24 08:54:18,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 08:54:18,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2024-10-24 08:54:18,460 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 77 [2024-10-24 08:54:18,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:54:18,461 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2024-10-24 08:54:18,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-24 08:54:18,463 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2024-10-24 08:54:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 08:54:18,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:54:18,463 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:54:18,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 08:54:18,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 08:54:18,665 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:54:18,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:54:18,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1915617860, now seen corresponding path program 1 times [2024-10-24 08:54:18,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:54:18,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436109005] [2024-10-24 08:54:18,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:18,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:54:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:19,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:54:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:19,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:54:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:19,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:54:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:19,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:54:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:19,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:54:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:19,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:54:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:19,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:54:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:19,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:54:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:19,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:54:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:19,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:54:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:19,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:54:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:19,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:54:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 08:54:19,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:54:19,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436109005] [2024-10-24 08:54:19,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436109005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:54:19,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:54:19,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 08:54:19,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628625293] [2024-10-24 08:54:19,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:54:19,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 08:54:19,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:54:19,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 08:54:19,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:54:19,094 INFO L87 Difference]: Start difference. First operand 72 states and 90 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 08:54:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:54:19,187 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2024-10-24 08:54:19,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 08:54:19,188 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 77 [2024-10-24 08:54:19,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:54:19,188 INFO L225 Difference]: With dead ends: 73 [2024-10-24 08:54:19,188 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 08:54:19,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-24 08:54:19,189 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 3 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:54:19,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 144 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:54:19,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 08:54:19,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 08:54:19,190 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-24 08:54:19,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 08:54:19,190 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2024-10-24 08:54:19,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:54:19,190 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 08:54:19,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 08:54:19,190 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 08:54:19,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 08:54:19,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:54:19,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 08:54:19,196 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:54:19,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 08:54:19,464 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:54:19,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:54:19 BoogieIcfgContainer [2024-10-24 08:54:19,479 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:54:19,480 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:54:19,480 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:54:19,480 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:54:19,480 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:54:13" (3/4) ... [2024-10-24 08:54:19,481 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 08:54:19,484 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 08:54:19,488 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-24 08:54:19,489 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-24 08:54:19,489 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 08:54:19,489 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 08:54:19,564 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 08:54:19,567 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 08:54:19,567 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:54:19,568 INFO L158 Benchmark]: Toolchain (without parser) took 6370.68ms. Allocated memory was 174.1MB in the beginning and 310.4MB in the end (delta: 136.3MB). Free memory was 105.6MB in the beginning and 203.4MB in the end (delta: -97.8MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2024-10-24 08:54:19,568 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 104.9MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:54:19,568 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.88ms. Allocated memory is still 174.1MB. Free memory was 105.3MB in the beginning and 140.6MB in the end (delta: -35.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 08:54:19,568 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.75ms. Allocated memory is still 174.1MB. Free memory was 140.6MB in the beginning and 138.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:54:19,568 INFO L158 Benchmark]: Boogie Preprocessor took 43.48ms. Allocated memory is still 174.1MB. Free memory was 138.1MB in the beginning and 135.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:54:19,569 INFO L158 Benchmark]: RCFGBuilder took 307.26ms. Allocated memory is still 174.1MB. Free memory was 135.4MB in the beginning and 117.5MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 08:54:19,569 INFO L158 Benchmark]: TraceAbstraction took 5601.10ms. Allocated memory was 174.1MB in the beginning and 310.4MB in the end (delta: 136.3MB). Free memory was 116.6MB in the beginning and 208.6MB in the end (delta: -92.0MB). Peak memory consumption was 122.2MB. Max. memory is 16.1GB. [2024-10-24 08:54:19,570 INFO L158 Benchmark]: Witness Printer took 87.84ms. Allocated memory is still 310.4MB. Free memory was 208.6MB in the beginning and 203.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 08:54:19,571 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.12ms. Allocated memory is still 104.9MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.88ms. Allocated memory is still 174.1MB. Free memory was 105.3MB in the beginning and 140.6MB in the end (delta: -35.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.75ms. Allocated memory is still 174.1MB. Free memory was 140.6MB in the beginning and 138.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.48ms. Allocated memory is still 174.1MB. Free memory was 138.1MB in the beginning and 135.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 307.26ms. Allocated memory is still 174.1MB. Free memory was 135.4MB in the beginning and 117.5MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5601.10ms. Allocated memory was 174.1MB in the beginning and 310.4MB in the end (delta: 136.3MB). Free memory was 116.6MB in the beginning and 208.6MB in the end (delta: -92.0MB). Peak memory consumption was 122.2MB. Max. memory is 16.1GB. * Witness Printer took 87.84ms. Allocated memory is still 310.4MB. Free memory was 208.6MB in the beginning and 203.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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: 19]: 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 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 7, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 282 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 280 mSDsluCounter, 1106 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 755 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 671 IncrementalHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 351 mSDtfsCounter, 671 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=5, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 88 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 677 ConstructedInterpolants, 0 QuantifiedInterpolants, 1721 SizeOfPredicates, 0 NumberOfNonLiveVariables, 187 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 2295/2376 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: 103]: Loop Invariant Derived loop invariant: ((1073741822 <= var_1_3) && ((var_1_9 == var_1_12) || (((long long) var_1_8 * last_1_var_1_7) < ((long long) var_1_3 + 1)))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((cond != 0) && (((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (last_1_var_1_7 == \old(last_1_var_1_7))) && (last_1_var_1_13 == \old(last_1_var_1_13)))) RESULT: Ultimate proved your program to be correct! [2024-10-24 08:54:19,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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