./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/fermat2-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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/fermat2-ll_unwindbound20.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 c16561338eb70030ddc560fe6b7af6d1b48b7a566766a02092344cb5475a4c1a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:21:18,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:21:18,661 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:21:18,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:21:18,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:21:18,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:21:18,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:21:18,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:21:18,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:21:18,690 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:21:18,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:21:18,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:21:18,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:21:18,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:21:18,693 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:21:18,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:21:18,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:21:18,695 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:21:18,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:21:18,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:21:18,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:21:18,699 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:21:18,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:21:18,700 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:21:18,700 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:21:18,700 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:21:18,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:21:18,700 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:21:18,701 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:21:18,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:21:18,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:21:18,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:21:18,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:21:18,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:21:18,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:21:18,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:21:18,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:21:18,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:21:18,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:21:18,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:21:18,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:21:18,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:21:18,703 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 -> c16561338eb70030ddc560fe6b7af6d1b48b7a566766a02092344cb5475a4c1a [2024-10-14 02:21:18,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:21:18,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:21:18,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:21:18,924 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:21:18,924 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:21:18,925 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2024-10-14 02:21:20,100 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:21:20,256 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:21:20,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2024-10-14 02:21:20,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87d71a16d/6615a70239d6479ca406a96d10f897f7/FLAGa8f211b52 [2024-10-14 02:21:20,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87d71a16d/6615a70239d6479ca406a96d10f897f7 [2024-10-14 02:21:20,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:21:20,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:21:20,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:21:20,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:21:20,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:21:20,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:21:20" (1/1) ... [2024-10-14 02:21:20,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1095f909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:20, skipping insertion in model container [2024-10-14 02:21:20,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:21:20" (1/1) ... [2024-10-14 02:21:20,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:21:20,823 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/fermat2-ll_unwindbound20.c[524,537] [2024-10-14 02:21:20,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:21:20,842 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:21:20,854 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/fermat2-ll_unwindbound20.c[524,537] [2024-10-14 02:21:20,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:21:20,877 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:21:20,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:20 WrapperNode [2024-10-14 02:21:20,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:21:20,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:21:20,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:21:20,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:21:20,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:20" (1/1) ... [2024-10-14 02:21:20,891 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:20" (1/1) ... [2024-10-14 02:21:20,904 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2024-10-14 02:21:20,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:21:20,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:21:20,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:21:20,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:21:20,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:20" (1/1) ... [2024-10-14 02:21:20,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:20" (1/1) ... [2024-10-14 02:21:20,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:20" (1/1) ... [2024-10-14 02:21:20,920 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-14 02:21:20,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:20" (1/1) ... [2024-10-14 02:21:20,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:20" (1/1) ... [2024-10-14 02:21:20,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:20" (1/1) ... [2024-10-14 02:21:20,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:20" (1/1) ... [2024-10-14 02:21:20,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:20" (1/1) ... [2024-10-14 02:21:20,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:20" (1/1) ... [2024-10-14 02:21:20,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:21:20,932 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:21:20,932 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:21:20,932 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:21:20,932 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:20" (1/1) ... [2024-10-14 02:21:20,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:21:20,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:21:20,960 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-14 02:21:20,965 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-14 02:21:20,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:21:20,996 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 02:21:20,996 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 02:21:20,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:21:20,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:21:20,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:21:20,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 02:21:20,998 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 02:21:21,046 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:21:21,048 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:21:21,177 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-14 02:21:21,177 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:21:21,197 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:21:21,197 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:21:21,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:21:21 BoogieIcfgContainer [2024-10-14 02:21:21,197 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:21:21,199 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:21:21,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:21:21,202 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:21:21,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:21:20" (1/3) ... [2024-10-14 02:21:21,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1218f6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:21:21, skipping insertion in model container [2024-10-14 02:21:21,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:20" (2/3) ... [2024-10-14 02:21:21,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1218f6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:21:21, skipping insertion in model container [2024-10-14 02:21:21,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:21:21" (3/3) ... [2024-10-14 02:21:21,204 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound20.c [2024-10-14 02:21:21,215 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:21:21,216 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:21:21,258 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:21:21,262 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;@1e5249be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:21:21,263 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:21:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 02:21:21,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 02:21:21,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:21:21,271 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:21:21,271 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:21:21,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:21:21,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1060579028, now seen corresponding path program 1 times [2024-10-14 02:21:21,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:21:21,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869548139] [2024-10-14 02:21:21,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:21,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:21:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:21,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:21:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:21,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:21:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:21,404 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-14 02:21:21,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:21:21,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869548139] [2024-10-14 02:21:21,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869548139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:21:21,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:21:21,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 02:21:21,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794356688] [2024-10-14 02:21:21,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:21:21,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 02:21:21,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:21:21,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 02:21:21,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 02:21:21,450 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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-14 02:21:21,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:21:21,468 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2024-10-14 02:21:21,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 02:21:21,470 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-14 02:21:21,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:21:21,475 INFO L225 Difference]: With dead ends: 42 [2024-10-14 02:21:21,475 INFO L226 Difference]: Without dead ends: 20 [2024-10-14 02:21:21,477 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-14 02:21:21,480 INFO L432 NwaCegarLoop]: 24 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, 24 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-14 02:21:21,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:21:21,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-14 02:21:21,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-14 02:21:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 02:21:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-14 02:21:21,508 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 17 [2024-10-14 02:21:21,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:21:21,508 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-14 02:21:21,509 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-14 02:21:21,509 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-14 02:21:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 02:21:21,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:21:21,510 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:21:21,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:21:21,510 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:21:21,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:21:21,511 INFO L85 PathProgramCache]: Analyzing trace with hash -778881514, now seen corresponding path program 1 times [2024-10-14 02:21:21,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:21:21,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663564446] [2024-10-14 02:21:21,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:21,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:21:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:21,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:21:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:21,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:21:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:21,700 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-14 02:21:21,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:21:21,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663564446] [2024-10-14 02:21:21,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663564446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:21:21,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:21:21,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 02:21:21,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830136209] [2024-10-14 02:21:21,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:21:21,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 02:21:21,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:21:21,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 02:21:21,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 02:21:21,706 INFO L87 Difference]: Start difference. First operand 20 states and 24 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-14 02:21:21,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:21:21,722 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-10-14 02:21:21,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 02:21:21,723 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-14 02:21:21,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:21:21,724 INFO L225 Difference]: With dead ends: 29 [2024-10-14 02:21:21,724 INFO L226 Difference]: Without dead ends: 22 [2024-10-14 02:21:21,724 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-14 02:21:21,725 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:21:21,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 54 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:21:21,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-14 02:21:21,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-14 02:21:21,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 02:21:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-10-14 02:21:21,730 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 18 [2024-10-14 02:21:21,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:21:21,731 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-14 02:21:21,731 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-14 02:21:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-10-14 02:21:21,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 02:21:21,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:21:21,732 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:21:21,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:21:21,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:21:21,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:21:21,734 INFO L85 PathProgramCache]: Analyzing trace with hash -777094054, now seen corresponding path program 1 times [2024-10-14 02:21:21,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:21:21,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466974874] [2024-10-14 02:21:21,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:21,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:21:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 02:21:21,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [263023975] [2024-10-14 02:21:21,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:21,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:21,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:21:21,767 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-14 02:21:21,768 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-14 02:21:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:21,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 02:21:21,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:21:22,005 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-14 02:21:22,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:21:22,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:21:22,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466974874] [2024-10-14 02:21:22,012 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 02:21:22,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263023975] [2024-10-14 02:21:22,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263023975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:21:22,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:21:22,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 02:21:22,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004815710] [2024-10-14 02:21:22,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:21:22,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:21:22,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:21:22,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:21:22,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 02:21:22,014 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.0) 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-14 02:21:23,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 02:21:23,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:21:23,219 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-10-14 02:21:23,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 02:21:23,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-14 02:21:23,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:21:23,221 INFO L225 Difference]: With dead ends: 34 [2024-10-14 02:21:23,221 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 02:21:23,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:21:23,222 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:21:23,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 68 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 02:21:23,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 02:21:23,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-10-14 02:21:23,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 02:21:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-10-14 02:21:23,228 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 18 [2024-10-14 02:21:23,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:21:23,228 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-10-14 02:21:23,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-14 02:21:23,229 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-10-14 02:21:23,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 02:21:23,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:21:23,230 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-14 02:21:23,244 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-14 02:21:23,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:23,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:21:23,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:21:23,434 INFO L85 PathProgramCache]: Analyzing trace with hash -331201790, now seen corresponding path program 1 times [2024-10-14 02:21:23,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:21:23,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331015337] [2024-10-14 02:21:23,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:23,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:21:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:23,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:21:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:23,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:21:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:23,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:21:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:23,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:21:23,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:21:23,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331015337] [2024-10-14 02:21:23,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331015337] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:21:23,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274892778] [2024-10-14 02:21:23,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:23,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:23,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:21:23,671 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:21:23,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 02:21:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:23,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 02:21:23,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:21:23,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:21:23,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:21:23,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:21:23,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274892778] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:21:23,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:21:23,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2024-10-14 02:21:23,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019546259] [2024-10-14 02:21:23,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:21:23,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 02:21:23,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:21:23,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 02:21:23,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:21:23,935 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 02:21:24,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:21:24,034 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-10-14 02:21:24,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:21:24,035 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 24 [2024-10-14 02:21:24,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:21:24,035 INFO L225 Difference]: With dead ends: 38 [2024-10-14 02:21:24,035 INFO L226 Difference]: Without dead ends: 33 [2024-10-14 02:21:24,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:21:24,036 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:21:24,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 113 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:21:24,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-14 02:21:24,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2024-10-14 02:21:24,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 02:21:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-10-14 02:21:24,051 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 24 [2024-10-14 02:21:24,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:21:24,051 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-10-14 02:21:24,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 02:21:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-10-14 02:21:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 02:21:24,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:21:24,052 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:21:24,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 02:21:24,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-14 02:21:24,257 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:21:24,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:21:24,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1584280999, now seen corresponding path program 1 times [2024-10-14 02:21:24,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:21:24,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94317933] [2024-10-14 02:21:24,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:24,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:21:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:24,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:21:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:24,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:21:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:24,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:21:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:21:24,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:21:24,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94317933] [2024-10-14 02:21:24,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94317933] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:21:24,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331380813] [2024-10-14 02:21:24,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:24,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:24,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:21:24,360 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:21:24,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 02:21:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:24,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 02:21:24,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:21:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:21:24,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:21:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:21:24,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331380813] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:21:24,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:21:24,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2024-10-14 02:21:24,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998246622] [2024-10-14 02:21:24,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:21:24,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:21:24,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:21:24,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:21:24,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:21:24,486 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-14 02:21:24,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:21:24,546 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2024-10-14 02:21:24,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 02:21:24,547 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 27 [2024-10-14 02:21:24,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:21:24,548 INFO L225 Difference]: With dead ends: 56 [2024-10-14 02:21:24,548 INFO L226 Difference]: Without dead ends: 51 [2024-10-14 02:21:24,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:21:24,549 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 20 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:21:24,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 100 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:21:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-14 02:21:24,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-14 02:21:24,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 02:21:24,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-10-14 02:21:24,564 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 27 [2024-10-14 02:21:24,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:21:24,564 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-10-14 02:21:24,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-14 02:21:24,565 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-10-14 02:21:24,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 02:21:24,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:21:24,565 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:21:24,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 02:21:24,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:24,766 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:21:24,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:21:24,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1262136106, now seen corresponding path program 2 times [2024-10-14 02:21:24,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:21:24,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163195342] [2024-10-14 02:21:24,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:24,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:21:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:24,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:21:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:24,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:21:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:24,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:21:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:24,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 02:21:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:24,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:21:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:24,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:21:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 02:21:24,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:21:24,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163195342] [2024-10-14 02:21:24,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163195342] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:21:24,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13228291] [2024-10-14 02:21:24,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 02:21:24,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:24,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:21:24,907 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:21:24,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 02:21:24,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 02:21:24,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 02:21:24,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 02:21:24,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:21:25,021 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:21:25,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:21:25,156 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 02:21:25,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13228291] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:21:25,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:21:25,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 16 [2024-10-14 02:21:25,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402259189] [2024-10-14 02:21:25,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:21:25,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 02:21:25,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:21:25,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 02:21:25,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2024-10-14 02:21:25,159 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-14 02:21:25,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:21:25,346 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2024-10-14 02:21:25,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 02:21:25,346 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 54 [2024-10-14 02:21:25,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:21:25,347 INFO L225 Difference]: With dead ends: 110 [2024-10-14 02:21:25,347 INFO L226 Difference]: Without dead ends: 105 [2024-10-14 02:21:25,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2024-10-14 02:21:25,348 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 80 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:21:25,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 111 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:21:25,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-14 02:21:25,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-14 02:21:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.1375) internal successors, (91), 80 states have internal predecessors, (91), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 02:21:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2024-10-14 02:21:25,374 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 54 [2024-10-14 02:21:25,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:21:25,375 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2024-10-14 02:21:25,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-14 02:21:25,375 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2024-10-14 02:21:25,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 02:21:25,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:21:25,379 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:21:25,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 02:21:25,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:25,583 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:21:25,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:21:25,583 INFO L85 PathProgramCache]: Analyzing trace with hash -254685450, now seen corresponding path program 3 times [2024-10-14 02:21:25,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:21:25,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994808625] [2024-10-14 02:21:25,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:25,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:21:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:25,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:21:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:25,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:21:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:25,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:21:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:25,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 02:21:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:25,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:21:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:25,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:21:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:25,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 02:21:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:25,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 02:21:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:25,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 02:21:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:25,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 02:21:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:25,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 02:21:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:25,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 02:21:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-14 02:21:25,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:21:25,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994808625] [2024-10-14 02:21:25,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994808625] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:21:25,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277749168] [2024-10-14 02:21:25,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 02:21:25,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:25,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:21:25,948 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:21:25,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 02:21:26,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-14 02:21:26,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 02:21:26,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 02:21:26,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:21:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:21:26,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:21:26,571 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-14 02:21:26,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277749168] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:21:26,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:21:26,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 26 [2024-10-14 02:21:26,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137693416] [2024-10-14 02:21:26,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:21:26,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 02:21:26,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:21:26,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 02:21:26,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2024-10-14 02:21:26,573 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 26 states, 26 states have (on average 5.0) internal successors, (130), 26 states have internal predecessors, (130), 22 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (35), 21 states have call predecessors, (35), 21 states have call successors, (35) [2024-10-14 02:21:26,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:21:26,938 INFO L93 Difference]: Finished difference Result 200 states and 230 transitions. [2024-10-14 02:21:26,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-14 02:21:26,942 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.0) internal successors, (130), 26 states have internal predecessors, (130), 22 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (35), 21 states have call predecessors, (35), 21 states have call successors, (35) Word has length 108 [2024-10-14 02:21:26,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:21:26,944 INFO L225 Difference]: With dead ends: 200 [2024-10-14 02:21:26,944 INFO L226 Difference]: Without dead ends: 195 [2024-10-14 02:21:26,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=687, Invalid=1205, Unknown=0, NotChecked=0, Total=1892 [2024-10-14 02:21:26,945 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 140 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:21:26,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 189 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:21:26,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-14 02:21:26,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-10-14 02:21:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 150 states have (on average 1.14) internal successors, (171), 150 states have internal predecessors, (171), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 02:21:26,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 216 transitions. [2024-10-14 02:21:26,979 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 216 transitions. Word has length 108 [2024-10-14 02:21:26,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:21:26,980 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 216 transitions. [2024-10-14 02:21:26,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.0) internal successors, (130), 26 states have internal predecessors, (130), 22 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (35), 21 states have call predecessors, (35), 21 states have call successors, (35) [2024-10-14 02:21:26,981 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 216 transitions. [2024-10-14 02:21:26,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-14 02:21:26,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:21:26,986 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:21:26,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 02:21:27,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:27,186 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:21:27,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:21:27,187 INFO L85 PathProgramCache]: Analyzing trace with hash 351932374, now seen corresponding path program 4 times [2024-10-14 02:21:27,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:21:27,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701391528] [2024-10-14 02:21:27,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:27,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:21:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 02:21:27,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1027580176] [2024-10-14 02:21:27,267 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 02:21:27,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:27,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:21:27,269 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:21:27,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 02:21:27,355 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 02:21:27,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-14 02:21:27,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 02:21:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 02:21:27,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 02:21:27,465 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 02:21:27,466 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 02:21:27,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 02:21:27,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:27,670 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2024-10-14 02:21:27,724 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 02:21:27,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:21:27 BoogieIcfgContainer [2024-10-14 02:21:27,726 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 02:21:27,726 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 02:21:27,727 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 02:21:27,727 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 02:21:27,727 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:21:21" (3/4) ... [2024-10-14 02:21:27,728 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 02:21:27,803 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 02:21:27,803 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 02:21:27,803 INFO L158 Benchmark]: Toolchain (without parser) took 7112.79ms. Allocated memory was 165.7MB in the beginning and 209.7MB in the end (delta: 44.0MB). Free memory was 112.4MB in the beginning and 98.5MB in the end (delta: 13.8MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. [2024-10-14 02:21:27,804 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 165.7MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 02:21:27,804 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.47ms. Allocated memory is still 165.7MB. Free memory was 111.9MB in the beginning and 100.3MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 02:21:27,804 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.92ms. Allocated memory is still 165.7MB. Free memory was 100.3MB in the beginning and 98.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 02:21:27,804 INFO L158 Benchmark]: Boogie Preprocessor took 21.58ms. Allocated memory is still 165.7MB. Free memory was 98.7MB in the beginning and 97.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 02:21:27,804 INFO L158 Benchmark]: RCFGBuilder took 266.04ms. Allocated memory is still 165.7MB. Free memory was 97.1MB in the beginning and 85.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 02:21:27,805 INFO L158 Benchmark]: TraceAbstraction took 6526.83ms. Allocated memory was 165.7MB in the beginning and 209.7MB in the end (delta: 44.0MB). Free memory was 84.1MB in the beginning and 105.9MB in the end (delta: -21.8MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2024-10-14 02:21:27,805 INFO L158 Benchmark]: Witness Printer took 76.65ms. Allocated memory is still 209.7MB. Free memory was 105.9MB in the beginning and 98.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 02:21:27,806 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.14ms. Allocated memory is still 165.7MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 186.47ms. Allocated memory is still 165.7MB. Free memory was 111.9MB in the beginning and 100.3MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.92ms. Allocated memory is still 165.7MB. Free memory was 100.3MB in the beginning and 98.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.58ms. Allocated memory is still 165.7MB. Free memory was 98.7MB in the beginning and 97.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 266.04ms. Allocated memory is still 165.7MB. Free memory was 97.1MB in the beginning and 85.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6526.83ms. Allocated memory was 165.7MB in the beginning and 209.7MB in the end (delta: 44.0MB). Free memory was 84.1MB in the beginning and 105.9MB in the end (delta: -21.8MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Witness Printer took 76.65ms. Allocated memory is still 209.7MB. Free memory was 105.9MB in the beginning and 98.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [A=40805, R=203, counter=0] [L28] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L28] RET assume_abort_if_not(A % 2 == 1) VAL [A=40805, R=203, counter=0] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [A=40805, counter=0, r=404, u=407, v=1] [L34] EXPR counter++ VAL [A=40805, counter=1, r=404, u=407, v=1] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=1, r=404, u=407, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=1, r=404, u=407, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=1, r=403, u=407, v=3] [L34] EXPR counter++ VAL [A=40805, counter=2, r=403, u=407, v=3] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=2, r=403, u=407, v=3] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=2, r=403, u=407, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=2, r=400, u=407, v=5] [L34] EXPR counter++ VAL [A=40805, counter=3, r=400, u=407, v=5] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=3, r=400, u=407, v=5] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=3, r=400, u=407, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=3, r=395, u=407, v=7] [L34] EXPR counter++ VAL [A=40805, counter=4, r=395, u=407, v=7] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=4, r=395, u=407, v=7] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=4, r=395, u=407, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=4, r=388, u=407, v=9] [L34] EXPR counter++ VAL [A=40805, counter=5, r=388, u=407, v=9] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=5, r=388, u=407, v=9] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=5, r=388, u=407, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=5, r=379, u=407, v=11] [L34] EXPR counter++ VAL [A=40805, counter=6, r=379, u=407, v=11] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=6, r=379, u=407, v=11] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=6, r=379, u=407, v=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=6, r=368, u=407, v=13] [L34] EXPR counter++ VAL [A=40805, counter=7, r=368, u=407, v=13] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=7, r=368, u=407, v=13] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=7, r=368, u=407, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=7, r=355, u=407, v=15] [L34] EXPR counter++ VAL [A=40805, counter=8, r=355, u=407, v=15] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=8, r=355, u=407, v=15] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=8, r=355, u=407, v=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=8, r=340, u=407, v=17] [L34] EXPR counter++ VAL [A=40805, counter=9, r=340, u=407, v=17] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=9, r=340, u=407, v=17] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=9, r=340, u=407, v=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=9, r=323, u=407, v=19] [L34] EXPR counter++ VAL [A=40805, counter=10, r=323, u=407, v=19] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=10, r=323, u=407, v=19] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=10, r=323, u=407, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=10, r=304, u=407, v=21] [L34] EXPR counter++ VAL [A=40805, counter=11, r=304, u=407, v=21] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=11, r=304, u=407, v=21] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=11, r=304, u=407, v=21] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=11, r=283, u=407, v=23] [L34] EXPR counter++ VAL [A=40805, counter=12, r=283, u=407, v=23] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=12, r=283, u=407, v=23] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=12, r=283, u=407, v=23] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=12, r=260, u=407, v=25] [L34] EXPR counter++ VAL [A=40805, counter=13, r=260, u=407, v=25] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=13, r=260, u=407, v=25] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=13, r=260, u=407, v=25] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=13, r=235, u=407, v=27] [L34] EXPR counter++ VAL [A=40805, counter=14, r=235, u=407, v=27] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=14, r=235, u=407, v=27] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=14, r=235, u=407, v=27] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=14, r=208, u=407, v=29] [L34] EXPR counter++ VAL [A=40805, counter=15, r=208, u=407, v=29] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=15, r=208, u=407, v=29] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=15, r=208, u=407, v=29] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=15, r=179, u=407, v=31] [L34] EXPR counter++ VAL [A=40805, counter=16, r=179, u=407, v=31] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=16, r=179, u=407, v=31] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=16, r=179, u=407, v=31] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=16, r=148, u=407, v=33] [L34] EXPR counter++ VAL [A=40805, counter=17, r=148, u=407, v=33] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=17, r=148, u=407, v=33] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=17, r=148, u=407, v=33] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=17, r=115, u=407, v=35] [L34] EXPR counter++ VAL [A=40805, counter=18, r=115, u=407, v=35] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=18, r=115, u=407, v=35] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=18, r=115, u=407, v=35] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=18, r=80, u=407, v=37] [L34] EXPR counter++ VAL [A=40805, counter=19, r=80, u=407, v=37] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=19, r=80, u=407, v=37] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=19, r=80, u=407, v=37] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=19, r=43, u=407, v=39] [L34] EXPR counter++ VAL [A=40805, counter=20, r=43, u=407, v=39] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=20, r=43, u=407, v=39] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=20, r=43, u=407, v=39] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=20, r=4, u=407, v=41] [L34] EXPR counter++ VAL [A=40805, counter=21, r=4, u=407, v=41] [L34] COND FALSE !(counter++<20) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=21] [L12] COND TRUE !(cond) VAL [\old(cond)=0, counter=21] [L14] reach_error() VAL [\old(cond)=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 263 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 262 mSDsluCounter, 659 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 520 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 285 IncrementalHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 139 mSDtfsCounter, 285 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 563 GetRequests, 468 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=195occurred in iteration=7, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 893 NumberOfCodeBlocks, 893 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 677 ConstructedInterpolants, 0 QuantifiedInterpolants, 1706 SizeOfPredicates, 17 NumberOfNonLiveVariables, 636 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 561/1623 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-14 02:21:27,831 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