./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound2.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 f2c97cfaf178ecbb63eaaf825cd5ea4b5be1bf37ecd5b20cf7e400328e1cd168 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:00:33,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:00:33,330 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:00:33,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:00:33,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:00:33,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:00:33,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:00:33,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:00:33,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:00:33,380 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:00:33,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:00:33,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:00:33,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:00:33,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:00:33,383 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:00:33,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:00:33,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:00:33,384 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:00:33,384 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:00:33,385 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:00:33,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:00:33,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:00:33,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:00:33,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:00:33,390 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:00:33,390 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:00:33,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:00:33,391 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:00:33,391 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:00:33,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:00:33,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:00:33,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:00:33,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:00:33,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:00:33,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:00:33,393 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:00:33,393 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:00:33,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:00:33,394 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:00:33,395 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:00:33,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:00:33,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:00:33,395 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 -> f2c97cfaf178ecbb63eaaf825cd5ea4b5be1bf37ecd5b20cf7e400328e1cd168 [2024-11-11 20:00:33,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:00:33,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:00:33,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:00:33,668 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:00:33,668 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:00:33,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound2.i [2024-11-11 20:00:35,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:00:35,229 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:00:35,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound2.i [2024-11-11 20:00:35,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/accb49ee0/82f70a4563ad4bd5be3f0b6b65a863a5/FLAG88804a7a1 [2024-11-11 20:00:35,608 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/accb49ee0/82f70a4563ad4bd5be3f0b6b65a863a5 [2024-11-11 20:00:35,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:00:35,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:00:35,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:00:35,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:00:35,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:00:35,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:00:35" (1/1) ... [2024-11-11 20:00:35,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3621e3d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:00:35, skipping insertion in model container [2024-11-11 20:00:35,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:00:35" (1/1) ... [2024-11-11 20:00:35,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:00:35,824 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound2.i[951,964] [2024-11-11 20:00:35,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:00:35,849 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:00:35,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound2.i[951,964] [2024-11-11 20:00:35,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:00:35,882 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:00:35,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:00:35 WrapperNode [2024-11-11 20:00:35,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:00:35,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:00:35,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:00:35,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:00:35,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:00:35" (1/1) ... [2024-11-11 20:00:35,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:00:35" (1/1) ... [2024-11-11 20:00:35,911 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2024-11-11 20:00:35,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:00:35,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:00:35,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:00:35,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:00:35,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:00:35" (1/1) ... [2024-11-11 20:00:35,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:00:35" (1/1) ... [2024-11-11 20:00:35,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:00:35" (1/1) ... [2024-11-11 20:00:35,931 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 20:00:35,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:00:35" (1/1) ... [2024-11-11 20:00:35,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:00:35" (1/1) ... [2024-11-11 20:00:35,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:00:35" (1/1) ... [2024-11-11 20:00:35,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:00:35" (1/1) ... [2024-11-11 20:00:35,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:00:35" (1/1) ... [2024-11-11 20:00:35,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:00:35" (1/1) ... [2024-11-11 20:00:35,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:00:35,940 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:00:35,940 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:00:35,940 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:00:35,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:00:35" (1/1) ... [2024-11-11 20:00:35,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:00:35,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:00:35,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 20:00:35,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 20:00:36,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:00:36,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:00:36,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:00:36,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:00:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-11 20:00:36,053 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-11 20:00:36,127 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:00:36,131 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:00:36,269 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-11 20:00:36,270 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:00:36,283 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:00:36,284 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 20:00:36,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:00:36 BoogieIcfgContainer [2024-11-11 20:00:36,285 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:00:36,287 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:00:36,287 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:00:36,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:00:36,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:00:35" (1/3) ... [2024-11-11 20:00:36,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191f8546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:00:36, skipping insertion in model container [2024-11-11 20:00:36,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:00:35" (2/3) ... [2024-11-11 20:00:36,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191f8546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:00:36, skipping insertion in model container [2024-11-11 20:00:36,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:00:36" (3/3) ... [2024-11-11 20:00:36,294 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound2.i [2024-11-11 20:00:36,307 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:00:36,307 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:00:36,359 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:00:36,366 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;@488da29f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:00:36,367 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:00:36,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:00:36,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-11 20:00:36,377 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:00:36,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:00:36,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:00:36,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:00:36,385 INFO L85 PathProgramCache]: Analyzing trace with hash 553144752, now seen corresponding path program 1 times [2024-11-11 20:00:36,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:00:36,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319326230] [2024-11-11 20:00:36,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:00:36,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:00:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:00:36,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:00:36,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:00:36,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319326230] [2024-11-11 20:00:36,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319326230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:00:36,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:00:36,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:00:36,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109581192] [2024-11-11 20:00:36,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:00:36,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:00:36,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:00:36,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:00:36,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:00:36,558 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:00:36,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:00:36,580 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2024-11-11 20:00:36,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:00:36,582 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-11 20:00:36,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:00:36,590 INFO L225 Difference]: With dead ends: 37 [2024-11-11 20:00:36,590 INFO L226 Difference]: Without dead ends: 17 [2024-11-11 20:00:36,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:00:36,600 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:00:36,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:00:36,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-11 20:00:36,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-11 20:00:36,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:00:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2024-11-11 20:00:36,640 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 8 [2024-11-11 20:00:36,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:00:36,641 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-11-11 20:00:36,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:00:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2024-11-11 20:00:36,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-11 20:00:36,643 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:00:36,643 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:00:36,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:00:36,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:00:36,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:00:36,645 INFO L85 PathProgramCache]: Analyzing trace with hash -803059042, now seen corresponding path program 1 times [2024-11-11 20:00:36,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:00:36,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411658581] [2024-11-11 20:00:36,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:00:36,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:00:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:00:36,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:00:36,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:00:36,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411658581] [2024-11-11 20:00:36,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411658581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:00:36,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:00:36,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:00:36,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951545723] [2024-11-11 20:00:36,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:00:36,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 20:00:36,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:00:36,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 20:00:36,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 20:00:36,755 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:00:36,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:00:36,776 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2024-11-11 20:00:36,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 20:00:36,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-11 20:00:36,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:00:36,780 INFO L225 Difference]: With dead ends: 31 [2024-11-11 20:00:36,780 INFO L226 Difference]: Without dead ends: 19 [2024-11-11 20:00:36,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 20:00:36,782 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:00:36,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:00:36,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-11 20:00:36,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-11 20:00:36,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:00:36,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2024-11-11 20:00:36,792 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 10 [2024-11-11 20:00:36,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:00:36,792 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2024-11-11 20:00:36,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:00:36,793 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2024-11-11 20:00:36,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-11 20:00:36,794 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:00:36,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:00:36,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:00:36,795 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:00:36,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:00:36,798 INFO L85 PathProgramCache]: Analyzing trace with hash 549278495, now seen corresponding path program 1 times [2024-11-11 20:00:36,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:00:36,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35389779] [2024-11-11 20:00:36,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:00:36,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:00:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:00:36,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:00:36,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:00:36,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35389779] [2024-11-11 20:00:36,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35389779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:00:36,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:00:36,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 20:00:36,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698379786] [2024-11-11 20:00:36,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:00:36,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:00:36,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:00:36,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:00:36,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:00:36,934 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:00:36,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:00:36,962 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-11-11 20:00:36,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:00:36,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-11 20:00:36,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:00:36,963 INFO L225 Difference]: With dead ends: 30 [2024-11-11 20:00:36,964 INFO L226 Difference]: Without dead ends: 23 [2024-11-11 20:00:36,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:00:36,965 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:00:36,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 56 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:00:36,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-11 20:00:36,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-11-11 20:00:36,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:00:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-11-11 20:00:36,971 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 11 [2024-11-11 20:00:36,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:00:36,971 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-11-11 20:00:36,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:00:36,972 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-11-11 20:00:36,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-11 20:00:36,972 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:00:36,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:00:36,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:00:36,973 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:00:36,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:00:36,974 INFO L85 PathProgramCache]: Analyzing trace with hash 551065955, now seen corresponding path program 1 times [2024-11-11 20:00:36,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:00:36,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348218893] [2024-11-11 20:00:36,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:00:36,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:00:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 20:00:36,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [250820434] [2024-11-11 20:00:36,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:00:36,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:00:36,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:00:36,994 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:00:36,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:00:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:00:37,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 20:00:37,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:00:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:00:37,245 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:00:37,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:00:37,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348218893] [2024-11-11 20:00:37,246 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 20:00:37,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250820434] [2024-11-11 20:00:37,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250820434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:00:37,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:00:37,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:00:37,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514067024] [2024-11-11 20:00:37,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:00:37,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:00:37,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:00:37,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:00:37,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:00:37,252 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:00:37,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:00:37,324 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2024-11-11 20:00:37,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:00:37,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-11 20:00:37,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:00:37,326 INFO L225 Difference]: With dead ends: 34 [2024-11-11 20:00:37,326 INFO L226 Difference]: Without dead ends: 31 [2024-11-11 20:00:37,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:00:37,328 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:00:37,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 51 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:00:37,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-11 20:00:37,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2024-11-11 20:00:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:00:37,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-11 20:00:37,342 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 11 [2024-11-11 20:00:37,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:00:37,343 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-11 20:00:37,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:00:37,343 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-11 20:00:37,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-11 20:00:37,344 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:00:37,344 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:00:37,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 20:00:37,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:00:37,549 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:00:37,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:00:37,550 INFO L85 PathProgramCache]: Analyzing trace with hash 2116548854, now seen corresponding path program 1 times [2024-11-11 20:00:37,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:00:37,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701858603] [2024-11-11 20:00:37,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:00:37,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:00:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:00:37,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:00:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:00:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:00:37,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:00:37,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701858603] [2024-11-11 20:00:37,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701858603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:00:37,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:00:37,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:00:37,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775048307] [2024-11-11 20:00:37,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:00:37,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:00:37,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:00:37,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:00:37,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:00:37,777 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:00:37,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:00:37,796 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2024-11-11 20:00:37,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:00:37,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-11 20:00:37,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:00:37,798 INFO L225 Difference]: With dead ends: 54 [2024-11-11 20:00:37,798 INFO L226 Difference]: Without dead ends: 29 [2024-11-11 20:00:37,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:00:37,799 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:00:37,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:00:37,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-11 20:00:37,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-11 20:00:37,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:00:37,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-11 20:00:37,805 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 20 [2024-11-11 20:00:37,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:00:37,806 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-11 20:00:37,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:00:37,806 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-11 20:00:37,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-11 20:00:37,807 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:00:37,807 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:00:37,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:00:37,808 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:00:37,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:00:37,809 INFO L85 PathProgramCache]: Analyzing trace with hash -443588687, now seen corresponding path program 1 times [2024-11-11 20:00:37,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:00:37,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726933615] [2024-11-11 20:00:37,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:00:37,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:00:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:00:37,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:00:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:00:37,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 20:00:37,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:00:37,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726933615] [2024-11-11 20:00:37,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726933615] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:00:37,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952357289] [2024-11-11 20:00:37,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:00:37,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:00:37,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:00:37,922 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:00:37,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 20:00:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:00:37,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 20:00:37,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:00:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 20:00:37,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:00:38,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 20:00:38,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952357289] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:00:38,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:00:38,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 5 [2024-11-11 20:00:38,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926185526] [2024-11-11 20:00:38,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:00:38,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:00:38,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:00:38,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:00:38,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:00:38,034 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:00:38,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:00:38,059 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2024-11-11 20:00:38,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:00:38,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-11 20:00:38,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:00:38,063 INFO L225 Difference]: With dead ends: 52 [2024-11-11 20:00:38,063 INFO L226 Difference]: Without dead ends: 31 [2024-11-11 20:00:38,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:00:38,064 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:00:38,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:00:38,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-11 20:00:38,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-11 20:00:38,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:00:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-11 20:00:38,074 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 22 [2024-11-11 20:00:38,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:00:38,074 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-11 20:00:38,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:00:38,075 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-11-11 20:00:38,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-11 20:00:38,075 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:00:38,075 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:00:38,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 20:00:38,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-11 20:00:38,277 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:00:38,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:00:38,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1151564580, now seen corresponding path program 1 times [2024-11-11 20:00:38,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:00:38,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761335418] [2024-11-11 20:00:38,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:00:38,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:00:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:00:38,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 20:00:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:00:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:00:38,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:00:38,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761335418] [2024-11-11 20:00:38,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761335418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:00:38,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:00:38,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:00:38,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222835129] [2024-11-11 20:00:38,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:00:38,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:00:38,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:00:38,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:00:38,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:00:38,397 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:00:38,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:00:38,419 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-11-11 20:00:38,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:00:38,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-11 20:00:38,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:00:38,420 INFO L225 Difference]: With dead ends: 33 [2024-11-11 20:00:38,421 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 20:00:38,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:00:38,422 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:00:38,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 18 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:00:38,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 20:00:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 20:00:38,425 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-11-11 20:00:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 20:00:38,425 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2024-11-11 20:00:38,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:00:38,425 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 20:00:38,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:00:38,426 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 20:00:38,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 20:00:38,428 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 20:00:38,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:00:38,431 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:00:38,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 20:00:38,535 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 20:00:38,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 08:00:38 BoogieIcfgContainer [2024-11-11 20:00:38,557 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 20:00:38,557 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 20:00:38,557 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 20:00:38,558 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 20:00:38,558 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:00:36" (3/4) ... [2024-11-11 20:00:38,560 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 20:00:38,565 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-11 20:00:38,568 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-11 20:00:38,569 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 20:00:38,569 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 20:00:38,569 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:00:38,650 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 20:00:38,651 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 20:00:38,651 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 20:00:38,651 INFO L158 Benchmark]: Toolchain (without parser) took 3040.18ms. Allocated memory was 134.2MB in the beginning and 180.4MB in the end (delta: 46.1MB). Free memory was 62.7MB in the beginning and 141.6MB in the end (delta: -78.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:00:38,652 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 134.2MB. Free memory is still 97.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:00:38,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.63ms. Allocated memory is still 134.2MB. Free memory was 62.4MB in the beginning and 49.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 20:00:38,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.32ms. Allocated memory is still 134.2MB. Free memory was 49.8MB in the beginning and 48.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:00:38,652 INFO L158 Benchmark]: Boogie Preprocessor took 27.65ms. Allocated memory is still 134.2MB. Free memory was 48.4MB in the beginning and 46.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:00:38,653 INFO L158 Benchmark]: RCFGBuilder took 344.85ms. Allocated memory was 134.2MB in the beginning and 180.4MB in the end (delta: 46.1MB). Free memory was 46.6MB in the beginning and 145.7MB in the end (delta: -99.1MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-11-11 20:00:38,653 INFO L158 Benchmark]: TraceAbstraction took 2269.99ms. Allocated memory is still 180.4MB. Free memory was 144.6MB in the beginning and 145.8MB in the end (delta: -1.1MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. [2024-11-11 20:00:38,653 INFO L158 Benchmark]: Witness Printer took 93.71ms. Allocated memory is still 180.4MB. Free memory was 145.8MB in the beginning and 141.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 20:00:38,655 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.22ms. Allocated memory is still 134.2MB. Free memory is still 97.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.63ms. Allocated memory is still 134.2MB. Free memory was 62.4MB in the beginning and 49.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.32ms. Allocated memory is still 134.2MB. Free memory was 49.8MB in the beginning and 48.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.65ms. Allocated memory is still 134.2MB. Free memory was 48.4MB in the beginning and 46.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 344.85ms. Allocated memory was 134.2MB in the beginning and 180.4MB in the end (delta: 46.1MB). Free memory was 46.6MB in the beginning and 145.7MB in the end (delta: -99.1MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2269.99ms. Allocated memory is still 180.4MB. Free memory was 144.6MB in the beginning and 145.8MB in the end (delta: -1.1MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. * Witness Printer took 93.71ms. Allocated memory is still 180.4MB. Free memory was 145.8MB in the beginning and 141.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: 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, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 313 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 186 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 82 IncrementalHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 127 mSDtfsCounter, 82 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=6, InterpolantAutomatonStates: 31, 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, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 266 SizeOfPredicates, 2 NumberOfNonLiveVariables, 125 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 23/29 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: 38]: Loop Invariant Derived loop invariant: ((((q == 0) && (B == b)) && (A == r)) || (((2 <= counter) && (q == 0)) && (A == r))) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((q == 0) && (B == b)) && (counter == 0)) && (A == r)) || (((q == 0) && (A == r)) && (counter == 1))) || (((2 <= counter) && (q == 0)) && (A == r))) - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= cond) Ensures: ((1 <= cond) && (counter == \old(counter))) RESULT: Ultimate proved your program to be correct! [2024-11-11 20:00:38,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE