./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound2.c --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/nla-digbench-scaling/hard2_unwindbound2.c -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 1ab6b58208d0c243ef581620bcab9aae54e201e00d3505f3320b182de5e7ff75 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 00:22:05,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 00:22:05,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 00:22:05,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 00:22:05,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 00:22:05,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 00:22:05,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 00:22:05,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 00:22:05,824 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 00:22:05,825 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 00:22:05,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 00:22:05,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 00:22:05,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 00:22:05,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 00:22:05,826 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 00:22:05,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 00:22:05,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 00:22:05,827 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 00:22:05,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 00:22:05,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 00:22:05,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 00:22:05,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 00:22:05,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 00:22:05,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 00:22:05,833 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 00:22:05,833 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 00:22:05,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 00:22:05,834 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 00:22:05,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 00:22:05,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 00:22:05,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 00:22:05,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 00:22:05,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:22:05,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 00:22:05,835 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 00:22:05,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 00:22:05,836 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 00:22:05,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 00:22:05,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 00:22:05,836 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 00:22:05,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 00:22:05,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 00:22:05,838 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 -> 1ab6b58208d0c243ef581620bcab9aae54e201e00d3505f3320b182de5e7ff75 [2024-10-24 00:22:06,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 00:22:06,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 00:22:06,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 00:22:06,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 00:22:06,183 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 00:22:06,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound2.c [2024-10-24 00:22:07,585 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 00:22:07,791 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 00:22:07,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound2.c [2024-10-24 00:22:07,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62a4ac849/a5b6c1753c764640b4a29837003bc60f/FLAG5f0709bfc [2024-10-24 00:22:08,170 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62a4ac849/a5b6c1753c764640b4a29837003bc60f [2024-10-24 00:22:08,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 00:22:08,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 00:22:08,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 00:22:08,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 00:22:08,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 00:22:08,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:22:08" (1/1) ... [2024-10-24 00:22:08,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2697a6c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:22:08, skipping insertion in model container [2024-10-24 00:22:08,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:22:08" (1/1) ... [2024-10-24 00:22:08,211 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 00:22:08,394 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/nla-digbench-scaling/hard2_unwindbound2.c[526,539] [2024-10-24 00:22:08,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:22:08,430 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 00:22:08,445 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/nla-digbench-scaling/hard2_unwindbound2.c[526,539] [2024-10-24 00:22:08,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:22:08,468 INFO L204 MainTranslator]: Completed translation [2024-10-24 00:22:08,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:22:08 WrapperNode [2024-10-24 00:22:08,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 00:22:08,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 00:22:08,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 00:22:08,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 00:22:08,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:22:08" (1/1) ... [2024-10-24 00:22:08,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:22:08" (1/1) ... [2024-10-24 00:22:08,506 INFO L138 Inliner]: procedures = 14, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 69 [2024-10-24 00:22:08,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 00:22:08,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 00:22:08,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 00:22:08,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 00:22:08,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:22:08" (1/1) ... [2024-10-24 00:22:08,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:22:08" (1/1) ... [2024-10-24 00:22:08,519 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:22:08" (1/1) ... [2024-10-24 00:22:08,537 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-24 00:22:08,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:22:08" (1/1) ... [2024-10-24 00:22:08,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:22:08" (1/1) ... [2024-10-24 00:22:08,541 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:22:08" (1/1) ... [2024-10-24 00:22:08,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:22:08" (1/1) ... [2024-10-24 00:22:08,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:22:08" (1/1) ... [2024-10-24 00:22:08,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:22:08" (1/1) ... [2024-10-24 00:22:08,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 00:22:08,552 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 00:22:08,552 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 00:22:08,552 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 00:22:08,553 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:22:08" (1/1) ... [2024-10-24 00:22:08,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:22:08,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:22:08,586 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 00:22:08,593 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 00:22:08,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 00:22:08,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 00:22:08,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 00:22:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 00:22:08,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 00:22:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 00:22:08,648 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 00:22:08,742 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 00:22:08,745 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 00:22:08,977 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-24 00:22:08,979 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 00:22:09,018 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 00:22:09,019 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 00:22:09,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:22:09 BoogieIcfgContainer [2024-10-24 00:22:09,020 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 00:22:09,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 00:22:09,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 00:22:09,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 00:22:09,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:22:08" (1/3) ... [2024-10-24 00:22:09,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b52bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:22:09, skipping insertion in model container [2024-10-24 00:22:09,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:22:08" (2/3) ... [2024-10-24 00:22:09,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b52bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:22:09, skipping insertion in model container [2024-10-24 00:22:09,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:22:09" (3/3) ... [2024-10-24 00:22:09,030 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound2.c [2024-10-24 00:22:09,043 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 00:22:09,043 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 00:22:09,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 00:22:09,101 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;@669cb6aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 00:22:09,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 00:22:09,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 00:22:09,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 00:22:09,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:22:09,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:22:09,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:22:09,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:22:09,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1291730102, now seen corresponding path program 1 times [2024-10-24 00:22:09,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:22:09,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699044584] [2024-10-24 00:22:09,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:22:09,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:22:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:22:09,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 00:22:09,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:22:09,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699044584] [2024-10-24 00:22:09,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699044584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:22:09,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:22:09,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 00:22:09,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079985044] [2024-10-24 00:22:09,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:22:09,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 00:22:09,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:22:09,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 00:22:09,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 00:22:09,293 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-10-24 00:22:09,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:22:09,323 INFO L93 Difference]: Finished difference Result 45 states and 78 transitions. [2024-10-24 00:22:09,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 00:22:09,325 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2024-10-24 00:22:09,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:22:09,331 INFO L225 Difference]: With dead ends: 45 [2024-10-24 00:22:09,331 INFO L226 Difference]: Without dead ends: 21 [2024-10-24 00:22:09,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 00:22:09,338 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:22:09,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:22:09,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-24 00:22:09,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-24 00:22:09,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 00:22:09,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2024-10-24 00:22:09,370 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 7 [2024-10-24 00:22:09,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:22:09,370 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2024-10-24 00:22:09,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-10-24 00:22:09,370 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2024-10-24 00:22:09,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 00:22:09,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:22:09,371 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:22:09,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 00:22:09,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:22:09,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:22:09,373 INFO L85 PathProgramCache]: Analyzing trace with hash 829671692, now seen corresponding path program 1 times [2024-10-24 00:22:09,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:22:09,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890626482] [2024-10-24 00:22:09,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:22:09,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:22:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:22:09,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 00:22:09,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:22:09,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890626482] [2024-10-24 00:22:09,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890626482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:22:09,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:22:09,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 00:22:09,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060957668] [2024-10-24 00:22:09,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:22:09,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:22:09,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:22:09,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:22:09,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 00:22:09,528 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 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-10-24 00:22:09,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:22:09,619 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2024-10-24 00:22:09,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:22:09,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2024-10-24 00:22:09,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:22:09,621 INFO L225 Difference]: With dead ends: 35 [2024-10-24 00:22:09,621 INFO L226 Difference]: Without dead ends: 33 [2024-10-24 00:22:09,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-10-24 00:22:09,622 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:22:09,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 90 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:22:09,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-24 00:22:09,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2024-10-24 00:22:09,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 00:22:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2024-10-24 00:22:09,639 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 7 [2024-10-24 00:22:09,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:22:09,639 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2024-10-24 00:22:09,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 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-10-24 00:22:09,640 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2024-10-24 00:22:09,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 00:22:09,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:22:09,641 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:22:09,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 00:22:09,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:22:09,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:22:09,644 INFO L85 PathProgramCache]: Analyzing trace with hash -166824855, now seen corresponding path program 1 times [2024-10-24 00:22:09,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:22:09,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088687836] [2024-10-24 00:22:09,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:22:09,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:22:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:22:09,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 00:22:09,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:22:09,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088687836] [2024-10-24 00:22:09,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088687836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:22:09,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:22:09,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 00:22:09,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224940294] [2024-10-24 00:22:09,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:22:09,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 00:22:09,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:22:09,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 00:22:09,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 00:22:09,771 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-10-24 00:22:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:22:09,803 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2024-10-24 00:22:09,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 00:22:09,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2024-10-24 00:22:09,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:22:09,805 INFO L225 Difference]: With dead ends: 41 [2024-10-24 00:22:09,806 INFO L226 Difference]: Without dead ends: 27 [2024-10-24 00:22:09,807 INFO L431 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-10-24 00:22:09,809 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:22:09,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:22:09,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-24 00:22:09,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-24 00:22:09,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 00:22:09,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-10-24 00:22:09,822 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 9 [2024-10-24 00:22:09,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:22:09,823 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-24 00:22:09,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-10-24 00:22:09,823 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2024-10-24 00:22:09,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 00:22:09,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:22:09,825 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:22:09,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 00:22:09,826 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:22:09,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:22:09,827 INFO L85 PathProgramCache]: Analyzing trace with hash -439138420, now seen corresponding path program 1 times [2024-10-24 00:22:09,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:22:09,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498828158] [2024-10-24 00:22:09,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:22:09,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:22:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:22:09,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 00:22:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:22:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 00:22:09,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:22:09,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498828158] [2024-10-24 00:22:09,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498828158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:22:09,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:22:09,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 00:22:09,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976024158] [2024-10-24 00:22:09,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:22:09,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:22:09,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:22:09,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:22:09,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 00:22:09,947 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-10-24 00:22:10,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:22:10,026 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2024-10-24 00:22:10,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:22:10,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 12 [2024-10-24 00:22:10,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:22:10,031 INFO L225 Difference]: With dead ends: 41 [2024-10-24 00:22:10,046 INFO L226 Difference]: Without dead ends: 39 [2024-10-24 00:22:10,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-10-24 00:22:10,050 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:22:10,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 87 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:22:10,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-24 00:22:10,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2024-10-24 00:22:10,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 00:22:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-10-24 00:22:10,064 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 12 [2024-10-24 00:22:10,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:22:10,064 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-10-24 00:22:10,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-10-24 00:22:10,065 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-10-24 00:22:10,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 00:22:10,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:22:10,067 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:22:10,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 00:22:10,067 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:22:10,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:22:10,068 INFO L85 PathProgramCache]: Analyzing trace with hash -235147060, now seen corresponding path program 1 times [2024-10-24 00:22:10,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:22:10,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000590854] [2024-10-24 00:22:10,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:22:10,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:22:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 00:22:10,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1233914687] [2024-10-24 00:22:10,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:22:10,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:22:10,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:22:10,115 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 00:22:10,116 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 00:22:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:22:10,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 00:22:10,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:22:10,331 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 00:22:10,332 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:22:10,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:22:10,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000590854] [2024-10-24 00:22:10,332 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 00:22:10,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233914687] [2024-10-24 00:22:10,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233914687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:22:10,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:22:10,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 00:22:10,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952149470] [2024-10-24 00:22:10,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:22:10,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:22:10,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:22:10,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:22:10,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 00:22:10,337 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 00:22:10,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:22:10,437 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2024-10-24 00:22:10,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:22:10,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-10-24 00:22:10,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:22:10,439 INFO L225 Difference]: With dead ends: 60 [2024-10-24 00:22:10,439 INFO L226 Difference]: Without dead ends: 45 [2024-10-24 00:22:10,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-10-24 00:22:10,440 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:22:10,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 91 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:22:10,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-24 00:22:10,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-24 00:22:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 00:22:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2024-10-24 00:22:10,466 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 17 [2024-10-24 00:22:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:22:10,466 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2024-10-24 00:22:10,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 00:22:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2024-10-24 00:22:10,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 00:22:10,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:22:10,469 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:22:10,484 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 00:22:10,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:22:10,670 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:22:10,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:22:10,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2012527405, now seen corresponding path program 1 times [2024-10-24 00:22:10,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:22:10,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664149099] [2024-10-24 00:22:10,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:22:10,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:22:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 00:22:10,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [189022849] [2024-10-24 00:22:10,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:22:10,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:22:10,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:22:10,698 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-10-24 00:22:10,700 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-10-24 00:22:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:22:10,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 00:22:10,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:22:10,874 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 00:22:10,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:22:11,055 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 00:22:11,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:22:11,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664149099] [2024-10-24 00:22:11,056 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 00:22:11,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189022849] [2024-10-24 00:22:11,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189022849] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:22:11,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 00:22:11,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-10-24 00:22:11,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105696504] [2024-10-24 00:22:11,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 00:22:11,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 00:22:11,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:22:11,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 00:22:11,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:22:11,059 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 00:22:11,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:22:11,211 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2024-10-24 00:22:11,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 00:22:11,213 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2024-10-24 00:22:11,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:22:11,215 INFO L225 Difference]: With dead ends: 63 [2024-10-24 00:22:11,218 INFO L226 Difference]: Without dead ends: 60 [2024-10-24 00:22:11,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:22:11,219 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:22:11,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 92 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:22:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-24 00:22:11,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2024-10-24 00:22:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 36 states have internal predecessors, (44), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 00:22:11,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2024-10-24 00:22:11,244 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 25 [2024-10-24 00:22:11,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:22:11,245 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2024-10-24 00:22:11,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 00:22:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2024-10-24 00:22:11,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 00:22:11,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:22:11,248 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:22:11,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 00:22:11,448 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-10-24 00:22:11,449 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:22:11,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:22:11,449 INFO L85 PathProgramCache]: Analyzing trace with hash 292094342, now seen corresponding path program 1 times [2024-10-24 00:22:11,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:22:11,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118355590] [2024-10-24 00:22:11,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:22:11,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:22:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:22:11,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 00:22:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:22:11,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:22:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:22:11,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 00:22:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:22:11,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 00:22:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:22:11,688 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:22:11,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:22:11,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118355590] [2024-10-24 00:22:11,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118355590] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:22:11,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414079516] [2024-10-24 00:22:11,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:22:11,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:22:11,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:22:11,696 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:22:11,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 00:22:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:22:11,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 00:22:11,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:22:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 00:22:11,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:22:11,868 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:22:11,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414079516] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:22:11,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:22:11,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 7 [2024-10-24 00:22:11,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472362212] [2024-10-24 00:22:11,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:22:11,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:22:11,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:22:11,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:22:11,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:22:11,873 INFO L87 Difference]: Start difference. First operand 55 states and 73 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 00:22:11,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:22:11,927 INFO L93 Difference]: Finished difference Result 94 states and 120 transitions. [2024-10-24 00:22:11,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 00:22:11,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 32 [2024-10-24 00:22:11,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:22:11,929 INFO L225 Difference]: With dead ends: 94 [2024-10-24 00:22:11,929 INFO L226 Difference]: Without dead ends: 69 [2024-10-24 00:22:11,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:22:11,930 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:22:11,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 95 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:22:11,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-24 00:22:11,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-24 00:22:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 states have internal predecessors, (55), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 00:22:11,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2024-10-24 00:22:11,955 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 32 [2024-10-24 00:22:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:22:11,956 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2024-10-24 00:22:11,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 00:22:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2024-10-24 00:22:11,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 00:22:11,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:22:11,959 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-24 00:22:11,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 00:22:12,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:22:12,163 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:22:12,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:22:12,163 INFO L85 PathProgramCache]: Analyzing trace with hash 747162997, now seen corresponding path program 1 times [2024-10-24 00:22:12,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:22:12,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129513681] [2024-10-24 00:22:12,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:22:12,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:22:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 00:22:12,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [56907238] [2024-10-24 00:22:12,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:22:12,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:22:12,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:22:12,194 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:22:12,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 00:22:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:22:12,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 00:22:12,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:22:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 00:22:12,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:22:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-24 00:22:12,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:22:12,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129513681] [2024-10-24 00:22:12,464 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 00:22:12,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56907238] [2024-10-24 00:22:12,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56907238] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 00:22:12,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:22:12,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-10-24 00:22:12,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693432890] [2024-10-24 00:22:12,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:22:12,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:22:12,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:22:12,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:22:12,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:22:12,465 INFO L87 Difference]: Start difference. First operand 69 states and 84 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 00:22:13,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 00:22:13,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:22:13,843 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2024-10-24 00:22:13,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:22:13,843 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-10-24 00:22:13,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:22:13,844 INFO L225 Difference]: With dead ends: 82 [2024-10-24 00:22:13,844 INFO L226 Difference]: Without dead ends: 80 [2024-10-24 00:22:13,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 00:22:13,845 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:22:13,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 85 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 00:22:13,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-24 00:22:13,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2024-10-24 00:22:13,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.22) internal successors, (61), 53 states have internal predecessors, (61), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 00:22:13,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2024-10-24 00:22:13,866 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 35 [2024-10-24 00:22:13,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:22:13,866 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2024-10-24 00:22:13,866 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 00:22:13,866 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2024-10-24 00:22:13,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-24 00:22:13,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:22:13,868 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 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 00:22:13,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 00:22:14,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:22:14,073 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:22:14,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:22:14,074 INFO L85 PathProgramCache]: Analyzing trace with hash -244406458, now seen corresponding path program 1 times [2024-10-24 00:22:14,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:22:14,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289920873] [2024-10-24 00:22:14,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:22:14,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:22:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:22:14,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 00:22:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:22:14,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:22:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:22:14,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 00:22:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:22:14,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:22:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:22:14,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:22:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:22:14,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:22:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:22:14,200 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-24 00:22:14,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:22:14,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289920873] [2024-10-24 00:22:14,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289920873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:22:14,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:22:14,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 00:22:14,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22915691] [2024-10-24 00:22:14,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:22:14,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:22:14,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:22:14,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:22:14,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 00:22:14,203 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 00:22:14,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:22:14,265 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2024-10-24 00:22:14,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:22:14,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 41 [2024-10-24 00:22:14,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:22:14,268 INFO L225 Difference]: With dead ends: 85 [2024-10-24 00:22:14,269 INFO L226 Difference]: Without dead ends: 68 [2024-10-24 00:22:14,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-10-24 00:22:14,271 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:22:14,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 101 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:22:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-24 00:22:14,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-24 00:22:14,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 47 states have internal predecessors, (54), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 00:22:14,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2024-10-24 00:22:14,292 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 41 [2024-10-24 00:22:14,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:22:14,293 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2024-10-24 00:22:14,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 00:22:14,293 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2024-10-24 00:22:14,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 00:22:14,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:22:14,294 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:22:14,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 00:22:14,294 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:22:14,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:22:14,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1125945480, now seen corresponding path program 1 times [2024-10-24 00:22:14,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:22:14,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055946180] [2024-10-24 00:22:14,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:22:14,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:22:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 00:22:14,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [508311853] [2024-10-24 00:22:14,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:22:14,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:22:14,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:22:14,321 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:22:14,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 00:22:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 00:22:14,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 00:22:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 00:22:14,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 00:22:14,405 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 00:22:14,406 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 00:22:14,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 00:22:14,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-24 00:22:14,611 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:22:14,649 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 00:22:14,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:22:14 BoogieIcfgContainer [2024-10-24 00:22:14,655 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 00:22:14,659 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 00:22:14,660 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 00:22:14,660 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 00:22:14,661 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:22:09" (3/4) ... [2024-10-24 00:22:14,661 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 00:22:14,718 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 00:22:14,718 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 00:22:14,719 INFO L158 Benchmark]: Toolchain (without parser) took 6544.16ms. Allocated memory was 155.2MB in the beginning and 192.9MB in the end (delta: 37.7MB). Free memory was 101.4MB in the beginning and 53.2MB in the end (delta: 48.2MB). Peak memory consumption was 82.3MB. Max. memory is 16.1GB. [2024-10-24 00:22:14,719 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 94.4MB. Free memory is still 59.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 00:22:14,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.48ms. Allocated memory is still 155.2MB. Free memory was 100.8MB in the beginning and 88.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 00:22:14,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.89ms. Allocated memory is still 155.2MB. Free memory was 88.3MB in the beginning and 86.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 00:22:14,720 INFO L158 Benchmark]: Boogie Preprocessor took 41.92ms. Allocated memory is still 155.2MB. Free memory was 86.7MB in the beginning and 85.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 00:22:14,720 INFO L158 Benchmark]: RCFGBuilder took 468.00ms. Allocated memory is still 155.2MB. Free memory was 85.1MB in the beginning and 119.3MB in the end (delta: -34.2MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2024-10-24 00:22:14,721 INFO L158 Benchmark]: TraceAbstraction took 5636.00ms. Allocated memory was 155.2MB in the beginning and 192.9MB in the end (delta: 37.7MB). Free memory was 118.5MB in the beginning and 56.3MB in the end (delta: 62.2MB). Peak memory consumption was 100.4MB. Max. memory is 16.1GB. [2024-10-24 00:22:14,721 INFO L158 Benchmark]: Witness Printer took 58.87ms. Allocated memory is still 192.9MB. Free memory was 56.3MB in the beginning and 53.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 00:22:14,722 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 94.4MB. Free memory is still 59.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.48ms. Allocated memory is still 155.2MB. Free memory was 100.8MB in the beginning and 88.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.89ms. Allocated memory is still 155.2MB. Free memory was 88.3MB in the beginning and 86.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.92ms. Allocated memory is still 155.2MB. Free memory was 86.7MB in the beginning and 85.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 468.00ms. Allocated memory is still 155.2MB. Free memory was 85.1MB in the beginning and 119.3MB in the end (delta: -34.2MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5636.00ms. Allocated memory was 155.2MB in the beginning and 192.9MB in the end (delta: 37.7MB). Free memory was 118.5MB in the beginning and 56.3MB in the end (delta: 62.2MB). Peak memory consumption was 100.4MB. Max. memory is 16.1GB. * Witness Printer took 58.87ms. Allocated memory is still 192.9MB. Free memory was 56.3MB in the beginning and 53.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] int A, B; [L25] int r, d, p, q; [L26] A = __VERIFIER_nondet_int() [L27] B = 1 [L29] r = A [L30] d = B [L31] p = 1 [L32] q = 0 VAL [A=1, B=1, counter=0, d=1, p=1, q=0, r=1] [L34] EXPR counter++ VAL [A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L34] COND TRUE counter++<2 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(q == 0) VAL [A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(r == A) VAL [A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(d == B * p) VAL [A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [A=1, B=1, counter=1, d=2, p=2, q=0, r=1] [L34] EXPR counter++ VAL [A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L34] COND TRUE counter++<2 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(q == 0) VAL [A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(r == A) VAL [A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(d == B * p) VAL [A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L38] COND TRUE !(r >= d) VAL [A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L44] EXPR counter++ VAL [A=1, B=1, counter=3, d=2, p=2, q=0, r=1] [L44] COND FALSE !(counter++<2) [L58] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L58] RET __VERIFIER_assert(A == d*q + r) VAL [A=1, B=1, counter=3, d=2, p=2, q=0, r=1] [L59] CALL __VERIFIER_assert(B == d) VAL [\old(cond)=0, counter=3] [L15] COND TRUE !(cond) VAL [\old(cond)=0, counter=3] [L17] reach_error() VAL [\old(cond)=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 10, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 754 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 518 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 320 IncrementalHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 236 mSDtfsCounter, 320 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 200 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=8, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 24 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 390 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 296 ConstructedInterpolants, 0 QuantifiedInterpolants, 776 SizeOfPredicates, 5 NumberOfNonLiveVariables, 417 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 305/330 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-24 00:22:14,744 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE