./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/egcd3-ll_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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/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.dk.eval-mul-div-a046e57-m [2024-10-12 18:50:54,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:50:54,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:50:54,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:50:54,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:50:54,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:50:54,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:50:54,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:50:54,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:50:54,995 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:50:54,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:50:54,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:50:54,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:50:54,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:50:54,998 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:50:54,999 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:50:54,999 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:50:54,999 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:50:55,000 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:50:55,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:50:55,000 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:50:55,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:50:55,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:50:55,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:50:55,004 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:50:55,004 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:50:55,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:50:55,005 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:50:55,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:50:55,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:50:55,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:50:55,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:50:55,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:50:55,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:50:55,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:50:55,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:50:55,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:50:55,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:50:55,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:50:55,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:50:55,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:50:55,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:50:55,010 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-10-12 18:50:55,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:50:55,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:50:55,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:50:55,278 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:50:55,278 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:50:55,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound1.c [2024-10-12 18:50:56,716 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:50:56,893 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:50:56,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound1.c [2024-10-12 18:50:56,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37878b8c1/4ab9893e4986407f859a4248a2f05903/FLAGe869eb573 [2024-10-12 18:50:57,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37878b8c1/4ab9893e4986407f859a4248a2f05903 [2024-10-12 18:50:57,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:50:57,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:50:57,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:50:57,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:50:57,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:50:57,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:50:57" (1/1) ... [2024-10-12 18:50:57,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d10de25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:50:57, skipping insertion in model container [2024-10-12 18:50:57,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:50:57" (1/1) ... [2024-10-12 18:50:57,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:50:57,524 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/egcd3-ll_unwindbound1.c[490,503] [2024-10-12 18:50:57,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:50:57,568 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:50:57,581 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/egcd3-ll_unwindbound1.c[490,503] [2024-10-12 18:50:57,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:50:57,607 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:50:57,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:50:57 WrapperNode [2024-10-12 18:50:57,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:50:57,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:50:57,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:50:57,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:50:57,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:50:57" (1/1) ... [2024-10-12 18:50:57,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:50:57" (1/1) ... [2024-10-12 18:50:57,638 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 94 [2024-10-12 18:50:57,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:50:57,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:50:57,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:50:57,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:50:57,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:50:57" (1/1) ... [2024-10-12 18:50:57,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:50:57" (1/1) ... [2024-10-12 18:50:57,649 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:50:57" (1/1) ... [2024-10-12 18:50:57,660 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 18:50:57,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:50:57" (1/1) ... [2024-10-12 18:50:57,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:50:57" (1/1) ... [2024-10-12 18:50:57,668 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:50:57" (1/1) ... [2024-10-12 18:50:57,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:50:57" (1/1) ... [2024-10-12 18:50:57,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:50:57" (1/1) ... [2024-10-12 18:50:57,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:50:57" (1/1) ... [2024-10-12 18:50:57,674 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:50:57,675 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:50:57,675 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:50:57,675 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:50:57,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:50:57" (1/1) ... [2024-10-12 18:50:57,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:50:57,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:50:57,714 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-12 18:50:57,717 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-12 18:50:57,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:50:57,764 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 18:50:57,765 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 18:50:57,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:50:57,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:50:57,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:50:57,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-12 18:50:57,766 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-12 18:50:57,838 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:50:57,840 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:50:58,009 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-10-12 18:50:58,009 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:50:58,033 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:50:58,034 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-12 18:50:58,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:50:58 BoogieIcfgContainer [2024-10-12 18:50:58,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:50:58,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:50:58,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:50:58,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:50:58,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:50:57" (1/3) ... [2024-10-12 18:50:58,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd6ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:50:58, skipping insertion in model container [2024-10-12 18:50:58,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:50:57" (2/3) ... [2024-10-12 18:50:58,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd6ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:50:58, skipping insertion in model container [2024-10-12 18:50:58,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:50:58" (3/3) ... [2024-10-12 18:50:58,045 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound1.c [2024-10-12 18:50:58,056 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:50:58,057 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:50:58,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:50:58,109 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;@1f188609, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:50:58,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:50:58,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 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-10-12 18:50:58,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 18:50:58,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:50:58,119 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:50:58,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:50:58,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:50:58,125 INFO L85 PathProgramCache]: Analyzing trace with hash -832436526, now seen corresponding path program 1 times [2024-10-12 18:50:58,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:50:58,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344120698] [2024-10-12 18:50:58,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:50:58,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:50:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:50:58,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:50:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:50:58,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:50:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:50:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:50:58,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:50:58,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344120698] [2024-10-12 18:50:58,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344120698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:50:58,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:50:58,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 18:50:58,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850895465] [2024-10-12 18:50:58,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:50:58,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 18:50:58,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:50:58,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 18:50:58,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:50:58,310 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-10-12 18:50:58,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:50:58,349 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2024-10-12 18:50:58,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 18:50:58,355 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 17 [2024-10-12 18:50:58,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:50:58,367 INFO L225 Difference]: With dead ends: 62 [2024-10-12 18:50:58,367 INFO L226 Difference]: Without dead ends: 30 [2024-10-12 18:50:58,370 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-10-12 18:50:58,373 INFO L432 NwaCegarLoop]: 40 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, 40 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-12 18:50:58,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:50:58,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-12 18:50:58,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-12 18:50:58,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 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-12 18:50:58,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2024-10-12 18:50:58,408 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 17 [2024-10-12 18:50:58,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:50:58,409 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2024-10-12 18:50:58,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-10-12 18:50:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2024-10-12 18:50:58,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 18:50:58,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:50:58,411 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:50:58,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:50:58,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:50:58,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:50:58,413 INFO L85 PathProgramCache]: Analyzing trace with hash 958862887, now seen corresponding path program 1 times [2024-10-12 18:50:58,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:50:58,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861057495] [2024-10-12 18:50:58,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:50:58,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:50:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:50:58,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:50:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:50:58,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:50:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:50:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:50:58,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:50:58,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861057495] [2024-10-12 18:50:58,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861057495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:50:58,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:50:58,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:50:58,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131708529] [2024-10-12 18:50:58,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:50:58,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:50:58,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:50:58,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:50:58,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:50:58,609 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-10-12 18:50:58,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:50:58,646 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2024-10-12 18:50:58,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:50:58,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 18 [2024-10-12 18:50:58,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:50:58,654 INFO L225 Difference]: With dead ends: 39 [2024-10-12 18:50:58,654 INFO L226 Difference]: Without dead ends: 32 [2024-10-12 18:50:58,654 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-10-12 18:50:58,655 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:50:58,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 100 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:50:58,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-12 18:50:58,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-12 18:50:58,670 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-10-12 18:50:58,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-10-12 18:50:58,672 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2024-10-12 18:50:58,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:50:58,674 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-10-12 18:50:58,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-10-12 18:50:58,674 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-10-12 18:50:58,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 18:50:58,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:50:58,675 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:50:58,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:50:58,676 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:50:58,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:50:58,677 INFO L85 PathProgramCache]: Analyzing trace with hash -359656705, now seen corresponding path program 1 times [2024-10-12 18:50:58,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:50:58,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107820852] [2024-10-12 18:50:58,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:50:58,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:50:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:50:58,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:50:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:50:58,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:50:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:50:58,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:50:58,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:50:58,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107820852] [2024-10-12 18:50:58,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107820852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:50:58,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:50:58,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:50:58,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080034269] [2024-10-12 18:50:58,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:50:58,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:50:58,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:50:58,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:50:58,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:50:58,897 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-10-12 18:50:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:50:58,988 INFO L93 Difference]: Finished difference Result 52 states and 70 transitions. [2024-10-12 18:50:58,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:50:58,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 19 [2024-10-12 18:50:58,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:50:58,991 INFO L225 Difference]: With dead ends: 52 [2024-10-12 18:50:58,991 INFO L226 Difference]: Without dead ends: 45 [2024-10-12 18:50:58,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:50:58,992 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 45 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:50:58,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 130 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:50:58,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-12 18:50:59,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2024-10-12 18:50:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 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-12 18:50:59,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-10-12 18:50:59,010 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 19 [2024-10-12 18:50:59,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:50:59,011 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-10-12 18:50:59,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-10-12 18:50:59,013 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-10-12 18:50:59,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 18:50:59,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:50:59,014 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] [2024-10-12 18:50:59,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 18:50:59,014 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:50:59,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:50:59,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1735129581, now seen corresponding path program 1 times [2024-10-12 18:50:59,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:50:59,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778876574] [2024-10-12 18:50:59,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:50:59,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:50:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 18:50:59,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [679806673] [2024-10-12 18:50:59,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:50:59,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:50:59,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:50:59,055 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-12 18:50:59,057 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-12 18:50:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 18:50:59,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 18:50:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 18:50:59,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 18:50:59,170 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 18:50:59,171 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 18:50:59,192 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-12 18:50:59,374 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-10-12 18:50:59,377 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-12 18:50:59,404 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 18:50:59,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 06:50:59 BoogieIcfgContainer [2024-10-12 18:50:59,412 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 18:50:59,412 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 18:50:59,413 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 18:50:59,414 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 18:50:59,414 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:50:58" (3/4) ... [2024-10-12 18:50:59,415 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 18:50:59,469 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 18:50:59,469 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 18:50:59,470 INFO L158 Benchmark]: Toolchain (without parser) took 2181.46ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 85.4MB in the beginning and 111.5MB in the end (delta: -26.1MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2024-10-12 18:50:59,470 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 50.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:50:59,470 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.57ms. Allocated memory is still 148.9MB. Free memory was 85.4MB in the beginning and 109.8MB in the end (delta: -24.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 18:50:59,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.90ms. Allocated memory is still 148.9MB. Free memory was 109.8MB in the beginning and 108.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:50:59,471 INFO L158 Benchmark]: Boogie Preprocessor took 35.13ms. Allocated memory is still 148.9MB. Free memory was 108.3MB in the beginning and 106.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:50:59,471 INFO L158 Benchmark]: RCFGBuilder took 359.19ms. Allocated memory is still 148.9MB. Free memory was 106.2MB in the beginning and 93.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 18:50:59,472 INFO L158 Benchmark]: TraceAbstraction took 1375.33ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 92.1MB in the beginning and 114.1MB in the end (delta: -22.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 18:50:59,472 INFO L158 Benchmark]: Witness Printer took 57.21ms. Allocated memory is still 180.4MB. Free memory was 114.1MB in the beginning and 111.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:50:59,474 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.16ms. Allocated memory is still 96.5MB. Free memory is still 50.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.57ms. Allocated memory is still 148.9MB. Free memory was 85.4MB in the beginning and 109.8MB in the end (delta: -24.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.90ms. Allocated memory is still 148.9MB. Free memory was 109.8MB in the beginning and 108.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.13ms. Allocated memory is still 148.9MB. Free memory was 108.3MB in the beginning and 106.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 359.19ms. Allocated memory is still 148.9MB. Free memory was 106.2MB in the beginning and 93.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1375.33ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 92.1MB in the beginning and 114.1MB in the end (delta: -22.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Witness Printer took 57.21ms. Allocated memory is still 180.4MB. Free memory was 114.1MB in the beginning and 111.5MB in the end (delta: 2.6MB). 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; [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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 270 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 162 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56 IncrementalHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 108 mSDtfsCounter, 56 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=3, 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.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 77 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-10-12 18:50:59,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE