./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound1.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 3ba6c159d5a75336b71b2a638ad3dc3de6683b2c20813e420caa2034bf261c2c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 07:04:16,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 07:04:16,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 07:04:17,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 07:04:17,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 07:04:17,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 07:04:17,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 07:04:17,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 07:04:17,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 07:04:17,046 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 07:04:17,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 07:04:17,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 07:04:17,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 07:04:17,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 07:04:17,052 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 07:04:17,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 07:04:17,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 07:04:17,053 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 07:04:17,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 07:04:17,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 07:04:17,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 07:04:17,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 07:04:17,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 07:04:17,060 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 07:04:17,060 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 07:04:17,060 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 07:04:17,061 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 07:04:17,061 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 07:04:17,061 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 07:04:17,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 07:04:17,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 07:04:17,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 07:04:17,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:04:17,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 07:04:17,062 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 07:04:17,062 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 07:04:17,062 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 07:04:17,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 07:04:17,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 07:04:17,063 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 07:04:17,067 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 07:04:17,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 07:04:17,067 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 -> 3ba6c159d5a75336b71b2a638ad3dc3de6683b2c20813e420caa2034bf261c2c [2024-11-16 07:04:17,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 07:04:17,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 07:04:17,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 07:04:17,424 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 07:04:17,425 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 07:04:17,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound1.c [2024-11-16 07:04:18,883 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 07:04:19,020 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 07:04:19,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound1.c [2024-11-16 07:04:19,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a1620684/25598afd1fce4b0cba6d9159a4e352f6/FLAG3966d4991 [2024-11-16 07:04:19,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a1620684/25598afd1fce4b0cba6d9159a4e352f6 [2024-11-16 07:04:19,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 07:04:19,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 07:04:19,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 07:04:19,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 07:04:19,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 07:04:19,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:04:19" (1/1) ... [2024-11-16 07:04:19,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5777a993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:04:19, skipping insertion in model container [2024-11-16 07:04:19,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:04:19" (1/1) ... [2024-11-16 07:04:19,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 07:04:19,256 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound1.c[490,503] [2024-11-16 07:04:19,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:04:19,285 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 07:04:19,294 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound1.c[490,503] [2024-11-16 07:04:19,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:04:19,315 INFO L204 MainTranslator]: Completed translation [2024-11-16 07:04:19,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:04:19 WrapperNode [2024-11-16 07:04:19,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 07:04:19,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 07:04:19,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 07:04:19,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 07:04:19,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:04:19" (1/1) ... [2024-11-16 07:04:19,329 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:04:19" (1/1) ... [2024-11-16 07:04:19,341 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 91 [2024-11-16 07:04:19,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 07:04:19,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 07:04:19,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 07:04:19,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 07:04:19,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:04:19" (1/1) ... [2024-11-16 07:04:19,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:04:19" (1/1) ... [2024-11-16 07:04:19,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:04:19" (1/1) ... [2024-11-16 07:04:19,362 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 07:04:19,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:04:19" (1/1) ... [2024-11-16 07:04:19,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:04:19" (1/1) ... [2024-11-16 07:04:19,364 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:04:19" (1/1) ... [2024-11-16 07:04:19,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:04:19" (1/1) ... [2024-11-16 07:04:19,365 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:04:19" (1/1) ... [2024-11-16 07:04:19,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:04:19" (1/1) ... [2024-11-16 07:04:19,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 07:04:19,369 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 07:04:19,369 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 07:04:19,369 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 07:04:19,370 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:04:19" (1/1) ... [2024-11-16 07:04:19,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:04:19,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:04:19,396 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 07:04:19,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 07:04:19,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 07:04:19,438 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 07:04:19,438 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 07:04:19,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 07:04:19,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 07:04:19,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 07:04:19,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-16 07:04:19,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-16 07:04:19,495 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 07:04:19,497 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 07:04:19,620 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-16 07:04:19,621 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 07:04:19,629 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 07:04:19,629 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 07:04:19,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:04:19 BoogieIcfgContainer [2024-11-16 07:04:19,630 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 07:04:19,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 07:04:19,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 07:04:19,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 07:04:19,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:04:19" (1/3) ... [2024-11-16 07:04:19,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f6cad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:04:19, skipping insertion in model container [2024-11-16 07:04:19,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:04:19" (2/3) ... [2024-11-16 07:04:19,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f6cad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:04:19, skipping insertion in model container [2024-11-16 07:04:19,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:04:19" (3/3) ... [2024-11-16 07:04:19,640 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound1.c [2024-11-16 07:04:19,652 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 07:04:19,652 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 07:04:19,691 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 07:04:19,696 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;@449e6321, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 07:04:19,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 07:04:19,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-16 07:04:19,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-16 07:04:19,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:04:19,706 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:04:19,707 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:04:19,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:04:19,711 INFO L85 PathProgramCache]: Analyzing trace with hash 254642677, now seen corresponding path program 1 times [2024-11-16 07:04:19,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:04:19,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132400656] [2024-11-16 07:04:19,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:04:19,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:04:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:04:19,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:04:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:04:19,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 07:04:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:04:19,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 07:04:19,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:04:19,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132400656] [2024-11-16 07:04:19,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132400656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:04:19,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:04:19,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 07:04:19,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032028322] [2024-11-16 07:04:19,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:04:19,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 07:04:19,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:04:19,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 07:04:19,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 07:04:19,856 INFO L87 Difference]: Start difference. First operand has 36 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:04:19,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:04:19,870 INFO L93 Difference]: Finished difference Result 69 states and 105 transitions. [2024-11-16 07:04:19,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 07:04:19,873 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-11-16 07:04:19,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:04:19,878 INFO L225 Difference]: With dead ends: 69 [2024-11-16 07:04:19,878 INFO L226 Difference]: Without dead ends: 32 [2024-11-16 07:04:19,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 07:04:19,884 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:04:19,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:04:19,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-16 07:04:19,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-16 07:04:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 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-11-16 07:04:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-11-16 07:04:19,933 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 19 [2024-11-16 07:04:19,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:04:19,934 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-11-16 07:04:19,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:04:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-11-16 07:04:19,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-16 07:04:19,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:04:19,935 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:04:19,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 07:04:19,935 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:04:19,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:04:19,936 INFO L85 PathProgramCache]: Analyzing trace with hash -195338036, now seen corresponding path program 1 times [2024-11-16 07:04:19,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:04:19,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072474812] [2024-11-16 07:04:19,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:04:19,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:04:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:04:20,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:04:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:04:20,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 07:04:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:04:20,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 07:04:20,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:04:20,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072474812] [2024-11-16 07:04:20,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072474812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:04:20,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:04:20,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 07:04:20,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469074041] [2024-11-16 07:04:20,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:04:20,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 07:04:20,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:04:20,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 07:04:20,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 07:04:20,138 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 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-11-16 07:04:20,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:04:20,157 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-11-16 07:04:20,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 07:04:20,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 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 20 [2024-11-16 07:04:20,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:04:20,158 INFO L225 Difference]: With dead ends: 42 [2024-11-16 07:04:20,158 INFO L226 Difference]: Without dead ends: 34 [2024-11-16 07:04:20,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 07:04:20,160 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 106 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-11-16 07:04:20,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 106 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:04:20,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-16 07:04:20,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-16 07:04:20,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 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-11-16 07:04:20,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2024-11-16 07:04:20,169 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 20 [2024-11-16 07:04:20,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:04:20,170 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-11-16 07:04:20,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 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-11-16 07:04:20,170 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-11-16 07:04:20,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-16 07:04:20,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:04:20,171 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:04:20,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 07:04:20,171 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:04:20,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:04:20,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1558200102, now seen corresponding path program 1 times [2024-11-16 07:04:20,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:04:20,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417834893] [2024-11-16 07:04:20,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:04:20,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:04:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:04:20,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:04:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:04:20,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 07:04:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:04:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 07:04:20,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:04:20,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417834893] [2024-11-16 07:04:20,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417834893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:04:20,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:04:20,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:04:20,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97777574] [2024-11-16 07:04:20,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:04:20,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:04:20,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:04:20,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:04:20,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:04:20,329 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 07:04:20,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:04:20,389 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2024-11-16 07:04:20,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 07:04:20,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-16 07:04:20,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:04:20,394 INFO L225 Difference]: With dead ends: 55 [2024-11-16 07:04:20,394 INFO L226 Difference]: Without dead ends: 47 [2024-11-16 07:04:20,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:04:20,396 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 42 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:04:20,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 123 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:04:20,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-16 07:04:20,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2024-11-16 07:04:20,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 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-11-16 07:04:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2024-11-16 07:04:20,410 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 21 [2024-11-16 07:04:20,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:04:20,410 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2024-11-16 07:04:20,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 07:04:20,411 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2024-11-16 07:04:20,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-16 07:04:20,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:04:20,412 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:04:20,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 07:04:20,412 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:04:20,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:04:20,413 INFO L85 PathProgramCache]: Analyzing trace with hash -479286204, now seen corresponding path program 1 times [2024-11-16 07:04:20,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:04:20,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16331431] [2024-11-16 07:04:20,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:04:20,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:04:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 07:04:20,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072127417] [2024-11-16 07:04:20,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:04:20,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:04:20,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:04:20,448 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 07:04:20,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 07:04:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 07:04:20,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 07:04:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 07:04:20,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 07:04:20,549 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 07:04:20,550 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 07:04:20,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 07:04:20,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:04:20,759 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-16 07:04:20,789 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 07:04:20,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:04:20 BoogieIcfgContainer [2024-11-16 07:04:20,794 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 07:04:20,794 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 07:04:20,794 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 07:04:20,794 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 07:04:20,795 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:04:19" (3/4) ... [2024-11-16 07:04:20,795 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 07:04:20,833 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 07:04:20,833 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 07:04:20,833 INFO L158 Benchmark]: Toolchain (without parser) took 1792.32ms. Allocated memory is still 157.3MB. Free memory was 87.3MB in the beginning and 122.3MB in the end (delta: -34.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 07:04:20,833 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 157.3MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 07:04:20,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.16ms. Allocated memory is still 157.3MB. Free memory was 87.2MB in the beginning and 124.1MB in the end (delta: -36.9MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-11-16 07:04:20,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.35ms. Allocated memory is still 157.3MB. Free memory was 124.1MB in the beginning and 122.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 07:04:20,834 INFO L158 Benchmark]: Boogie Preprocessor took 26.27ms. Allocated memory is still 157.3MB. Free memory was 122.9MB in the beginning and 120.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:04:20,834 INFO L158 Benchmark]: IcfgBuilder took 260.96ms. Allocated memory is still 157.3MB. Free memory was 120.8MB in the beginning and 108.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 07:04:20,834 INFO L158 Benchmark]: TraceAbstraction took 1158.78ms. Allocated memory is still 157.3MB. Free memory was 107.3MB in the beginning and 125.2MB in the end (delta: -17.9MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2024-11-16 07:04:20,834 INFO L158 Benchmark]: Witness Printer took 38.82ms. Allocated memory is still 157.3MB. Free memory was 125.2MB in the beginning and 122.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:04:20,836 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.15ms. Allocated memory is still 157.3MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.16ms. Allocated memory is still 157.3MB. Free memory was 87.2MB in the beginning and 124.1MB in the end (delta: -36.9MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.35ms. Allocated memory is still 157.3MB. Free memory was 124.1MB in the beginning and 122.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.27ms. Allocated memory is still 157.3MB. Free memory was 122.9MB in the beginning and 120.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 260.96ms. Allocated memory is still 157.3MB. Free memory was 120.8MB in the beginning and 108.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1158.78ms. Allocated memory is still 157.3MB. Free memory was 107.3MB in the beginning and 125.2MB in the end (delta: -17.9MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. * Witness Printer took 38.82ms. Allocated memory is still 157.3MB. Free memory was 125.2MB in the beginning and 122.3MB in the end (delta: 3.0MB). 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: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [counter=0, x=1, y=1] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [counter=0, x=1, y=1] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=1, b=1, counter=0, p=1, q=0, r=0, s=1, x=1, y=1] [L34] EXPR counter++ VAL [a=1, b=1, counter=1, p=1, q=0, r=0, s=1, x=1, y=1] [L34] COND TRUE counter++<1 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [a=1, b=1, c=1, counter=1, k=0, p=1, q=0, r=0, s=1, x=1, y=1] [L41] EXPR counter++ VAL [a=1, b=1, c=1, counter=2, k=0, p=1, q=0, r=0, s=1, x=1, y=1] [L41] COND FALSE !(counter++<1) [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k [L34] EXPR counter++ VAL [a=1, b=1, counter=3, p=0, q=1, r=1, s=0, x=1, y=1] [L34] COND FALSE !(counter++<1) [L73] CALL __VERIFIER_assert(p*x - q*x + r*y - s*y == a) VAL [\old(cond)=0, counter=3] [L11] COND TRUE !(cond) VAL [\old(cond)=0, counter=3] [L13] reach_error() VAL [\old(cond)=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 275 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 155 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 120 mSDtfsCounter, 51 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 97 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 12/12 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-11-16 07:04:20,860 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