./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../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-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 01:22:50,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 01:22:50,519 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 01:22:50,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 01:22:50,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 01:22:50,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 01:22:50,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 01:22:50,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 01:22:50,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 01:22:50,550 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 01:22:50,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 01:22:50,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 01:22:50,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 01:22:50,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 01:22:50,552 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 01:22:50,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 01:22:50,552 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 01:22:50,553 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 01:22:50,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 01:22:50,553 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 01:22:50,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 01:22:50,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 01:22:50,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 01:22:50,557 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 01:22:50,557 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 01:22:50,558 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 01:22:50,558 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 01:22:50,558 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 01:22:50,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 01:22:50,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 01:22:50,559 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 01:22:50,559 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 01:22:50,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 01:22:50,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 01:22:50,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 01:22:50,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 01:22:50,560 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 01:22:50,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 01:22:50,560 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 01:22:50,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 01:22:50,563 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 01:22:50,564 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 01:22:50,564 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-11-22 01:22:50,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 01:22:50,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 01:22:50,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 01:22:50,775 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 01:22:50,776 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 01:22:50,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2024-11-22 01:22:52,013 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 01:22:52,160 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 01:22:52,161 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2024-11-22 01:22:52,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0675da66/1831081bc42242658b783df77240045d/FLAGb12413cd2 [2024-11-22 01:22:52,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0675da66/1831081bc42242658b783df77240045d [2024-11-22 01:22:52,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 01:22:52,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 01:22:52,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 01:22:52,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 01:22:52,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 01:22:52,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:22:52" (1/1) ... [2024-11-22 01:22:52,576 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191fdae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:52, skipping insertion in model container [2024-11-22 01:22:52,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:22:52" (1/1) ... [2024-11-22 01:22:52,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 01:22:52,735 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c[524,537] [2024-11-22 01:22:52,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 01:22:52,768 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 01:22:52,777 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c[524,537] [2024-11-22 01:22:52,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 01:22:52,794 INFO L204 MainTranslator]: Completed translation [2024-11-22 01:22:52,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:52 WrapperNode [2024-11-22 01:22:52,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 01:22:52,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 01:22:52,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 01:22:52,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 01:22:52,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:52" (1/1) ... [2024-11-22 01:22:52,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:52" (1/1) ... [2024-11-22 01:22:52,819 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2024-11-22 01:22:52,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 01:22:52,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 01:22:52,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 01:22:52,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 01:22:52,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:52" (1/1) ... [2024-11-22 01:22:52,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:52" (1/1) ... [2024-11-22 01:22:52,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:52" (1/1) ... [2024-11-22 01:22:52,837 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 01:22:52,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:52" (1/1) ... [2024-11-22 01:22:52,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:52" (1/1) ... [2024-11-22 01:22:52,839 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:52" (1/1) ... [2024-11-22 01:22:52,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:52" (1/1) ... [2024-11-22 01:22:52,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:52" (1/1) ... [2024-11-22 01:22:52,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:52" (1/1) ... [2024-11-22 01:22:52,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 01:22:52,844 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 01:22:52,845 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 01:22:52,845 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 01:22:52,845 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:52" (1/1) ... [2024-11-22 01:22:52,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 01:22:52,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:22:52,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 01:22:52,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 01:22:52,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 01:22:52,913 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 01:22:52,913 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 01:22:52,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 01:22:52,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 01:22:52,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 01:22:52,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-22 01:22:52,915 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-22 01:22:52,958 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 01:22:52,960 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 01:22:53,092 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-22 01:22:53,094 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 01:22:53,104 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 01:22:53,104 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 01:22:53,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:22:53 BoogieIcfgContainer [2024-11-22 01:22:53,105 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 01:22:53,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 01:22:53,107 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 01:22:53,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 01:22:53,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:22:52" (1/3) ... [2024-11-22 01:22:53,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee86533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:22:53, skipping insertion in model container [2024-11-22 01:22:53,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:52" (2/3) ... [2024-11-22 01:22:53,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee86533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:22:53, skipping insertion in model container [2024-11-22 01:22:53,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:22:53" (3/3) ... [2024-11-22 01:22:53,113 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound20.c [2024-11-22 01:22:53,125 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 01:22:53,126 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 01:22:53,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 01:22:53,174 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;@5a2c8b21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 01:22:53,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 01:22:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 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-11-22 01:22:53,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-22 01:22:53,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:22:53,184 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:22:53,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:22:53,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:22:53,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1086166160, now seen corresponding path program 1 times [2024-11-22 01:22:53,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:22:53,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44902293] [2024-11-22 01:22:53,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:22:53,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:22:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:22:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 01:22:53,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:22:53,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44902293] [2024-11-22 01:22:53,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44902293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:22:53,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144133759] [2024-11-22 01:22:53,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:22:53,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:22:53,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:22:53,325 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 01:22:53,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 01:22:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:22:53,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 01:22:53,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:22:53,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 01:22:53,417 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 01:22:53,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144133759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:22:53,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 01:22:53,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 01:22:53,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388857906] [2024-11-22 01:22:53,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:22:53,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 01:22:53,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:22:53,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 01:22:53,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 01:22:53,444 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 01:22:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:22:53,462 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2024-11-22 01:22:53,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 01:22:53,464 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-11-22 01:22:53,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:22:53,470 INFO L225 Difference]: With dead ends: 47 [2024-11-22 01:22:53,470 INFO L226 Difference]: Without dead ends: 21 [2024-11-22 01:22:53,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 01:22:53,476 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 01:22:53,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 01:22:53,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-22 01:22:53,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-22 01:22:53,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 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-11-22 01:22:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-11-22 01:22:53,507 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2024-11-22 01:22:53,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:22:53,507 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-11-22 01:22:53,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 01:22:53,508 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-11-22 01:22:53,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 01:22:53,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:22:53,510 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:22:53,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 01:22:53,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 01:22:53,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:22:53,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:22:53,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1345709874, now seen corresponding path program 1 times [2024-11-22 01:22:53,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:22:53,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465063260] [2024-11-22 01:22:53,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:22:53,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:22:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:22:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 01:22:53,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:22:53,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465063260] [2024-11-22 01:22:53,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465063260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:22:53,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 01:22:53,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 01:22:53,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403052675] [2024-11-22 01:22:53,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:22:53,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 01:22:53,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:22:53,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 01:22:53,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 01:22:53,838 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 01:22:53,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:22:53,859 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-11-22 01:22:53,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 01:22:53,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-22 01:22:53,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:22:53,863 INFO L225 Difference]: With dead ends: 30 [2024-11-22 01:22:53,863 INFO L226 Difference]: Without dead ends: 23 [2024-11-22 01:22:53,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 01:22:53,864 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 01:22:53,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 57 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 01:22:53,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-22 01:22:53,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-22 01:22:53,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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-11-22 01:22:53,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-22 01:22:53,870 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2024-11-22 01:22:53,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:22:53,873 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-22 01:22:53,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 01:22:53,874 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-22 01:22:53,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 01:22:53,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:22:53,875 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:22:53,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 01:22:53,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:22:53,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:22:53,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1347497334, now seen corresponding path program 1 times [2024-11-22 01:22:53,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:22:53,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347725948] [2024-11-22 01:22:53,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:22:53,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:22:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 01:22:53,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1232307084] [2024-11-22 01:22:53,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:22:53,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:22:53,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:22:53,928 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 01:22:53,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 01:22:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:22:53,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 01:22:53,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:22:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 01:22:54,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 01:22:54,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:22:54,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347725948] [2024-11-22 01:22:54,182 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 01:22:54,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232307084] [2024-11-22 01:22:54,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232307084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:22:54,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 01:22:54,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 01:22:54,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477113860] [2024-11-22 01:22:54,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:22:54,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 01:22:54,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:22:54,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 01:22:54,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 01:22:54,185 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 01:22:56,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-22 01:22:56,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:22:56,677 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2024-11-22 01:22:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 01:22:56,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-22 01:22:56,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:22:56,678 INFO L225 Difference]: With dead ends: 35 [2024-11-22 01:22:56,678 INFO L226 Difference]: Without dead ends: 33 [2024-11-22 01:22:56,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 01:22:56,679 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-22 01:22:56,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 75 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-22 01:22:56,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-22 01:22:56,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-11-22 01:22:56,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 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-11-22 01:22:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-11-22 01:22:56,690 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 19 [2024-11-22 01:22:56,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:22:56,690 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-22 01:22:56,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 01:22:56,691 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-11-22 01:22:56,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 01:22:56,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:22:56,692 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:22:56,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 01:22:56,892 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,SelfDestructingSolverStorable2 [2024-11-22 01:22:56,893 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:22:56,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:22:56,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1636478750, now seen corresponding path program 1 times [2024-11-22 01:22:56,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:22:56,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950142387] [2024-11-22 01:22:56,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:22:56,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:22:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:22:57,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 01:22:57,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:22:57,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950142387] [2024-11-22 01:22:57,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950142387] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:22:57,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748789091] [2024-11-22 01:22:57,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:22:57,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:22:57,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:22:57,135 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-11-22 01:22:57,136 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-11-22 01:22:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:22:57,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 01:22:57,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:22:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 01:22:57,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:22:57,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 01:22:57,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748789091] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:22:57,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 01:22:57,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2024-11-22 01:22:57,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923665932] [2024-11-22 01:22:57,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 01:22:57,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 01:22:57,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:22:57,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 01:22:57,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-22 01:22:57,344 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 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-11-22 01:22:57,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:22:57,409 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2024-11-22 01:22:57,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 01:22:57,409 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 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 25 [2024-11-22 01:22:57,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:22:57,410 INFO L225 Difference]: With dead ends: 39 [2024-11-22 01:22:57,410 INFO L226 Difference]: Without dead ends: 34 [2024-11-22 01:22:57,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-22 01:22:57,411 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 01:22:57,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 109 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 01:22:57,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-22 01:22:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2024-11-22 01:22:57,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 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-11-22 01:22:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-11-22 01:22:57,418 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 25 [2024-11-22 01:22:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:22:57,419 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-11-22 01:22:57,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 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-11-22 01:22:57,419 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-11-22 01:22:57,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 01:22:57,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:22:57,422 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, 1] [2024-11-22 01:22:57,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 01:22:57,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:22:57,623 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:22:57,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:22:57,623 INFO L85 PathProgramCache]: Analyzing trace with hash -126969667, now seen corresponding path program 1 times [2024-11-22 01:22:57,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:22:57,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638462416] [2024-11-22 01:22:57,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:22:57,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:22:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:22:57,684 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 01:22:57,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:22:57,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638462416] [2024-11-22 01:22:57,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638462416] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:22:57,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687079539] [2024-11-22 01:22:57,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:22:57,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:22:57,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:22:57,688 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-11-22 01:22:57,688 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-11-22 01:22:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:22:57,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 01:22:57,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:22:57,760 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 01:22:57,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:22:57,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 01:22:57,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687079539] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:22:57,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 01:22:57,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2024-11-22 01:22:57,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575123268] [2024-11-22 01:22:57,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 01:22:57,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 01:22:57,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:22:57,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 01:22:57,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-22 01:22:57,800 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-22 01:22:57,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:22:57,851 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2024-11-22 01:22:57,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 01:22:57,851 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 28 [2024-11-22 01:22:57,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:22:57,852 INFO L225 Difference]: With dead ends: 57 [2024-11-22 01:22:57,852 INFO L226 Difference]: Without dead ends: 52 [2024-11-22 01:22:57,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-22 01:22:57,853 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 01:22:57,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 104 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 01:22:57,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-22 01:22:57,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-22 01:22:57,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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-11-22 01:22:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2024-11-22 01:22:57,864 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 28 [2024-11-22 01:22:57,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:22:57,864 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2024-11-22 01:22:57,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-22 01:22:57,864 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2024-11-22 01:22:57,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-22 01:22:57,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:22:57,865 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, 1] [2024-11-22 01:22:57,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 01:22:58,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:22:58,066 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:22:58,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:22:58,067 INFO L85 PathProgramCache]: Analyzing trace with hash 972990450, now seen corresponding path program 2 times [2024-11-22 01:22:58,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:22:58,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144026351] [2024-11-22 01:22:58,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 01:22:58,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:22:58,082 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 01:22:58,082 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:22:58,231 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-22 01:22:58,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:22:58,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144026351] [2024-11-22 01:22:58,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144026351] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:22:58,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009922278] [2024-11-22 01:22:58,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 01:22:58,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:22:58,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:22:58,234 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-11-22 01:22:58,235 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-11-22 01:22:58,282 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 01:22:58,283 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:22:58,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 01:22:58,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:22:58,355 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 01:22:58,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:22:58,464 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-22 01:22:58,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009922278] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:22:58,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 01:22:58,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 15 [2024-11-22 01:22:58,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069302428] [2024-11-22 01:22:58,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 01:22:58,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 01:22:58,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:22:58,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 01:22:58,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2024-11-22 01:22:58,468 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-22 01:22:58,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:22:58,640 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2024-11-22 01:22:58,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-22 01:22:58,640 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) Word has length 55 [2024-11-22 01:22:58,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:22:58,641 INFO L225 Difference]: With dead ends: 111 [2024-11-22 01:22:58,642 INFO L226 Difference]: Without dead ends: 106 [2024-11-22 01:22:58,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2024-11-22 01:22:58,642 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 40 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 01:22:58,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 144 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 01:22:58,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-22 01:22:58,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-22 01:22:58,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 81 states have internal predecessors, (92), 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-11-22 01:22:58,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2024-11-22 01:22:58,671 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 55 [2024-11-22 01:22:58,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:22:58,671 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2024-11-22 01:22:58,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-22 01:22:58,671 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2024-11-22 01:22:58,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-22 01:22:58,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:22:58,673 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, 1] [2024-11-22 01:22:58,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 01:22:58,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:22:58,874 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:22:58,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:22:58,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1909967598, now seen corresponding path program 3 times [2024-11-22 01:22:58,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:22:58,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990771020] [2024-11-22 01:22:58,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 01:22:58,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:22:58,941 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-22 01:22:58,941 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:22:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-22 01:22:59,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:22:59,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990771020] [2024-11-22 01:22:59,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990771020] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:22:59,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671375275] [2024-11-22 01:22:59,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 01:22:59,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:22:59,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:22:59,513 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-11-22 01:22:59,517 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-11-22 01:22:59,667 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-22 01:22:59,667 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:22:59,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-22 01:22:59,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:22:59,955 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 01:22:59,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:23:00,313 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-22 01:23:00,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671375275] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:23:00,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 01:23:00,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 14] total 38 [2024-11-22 01:23:00,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88933934] [2024-11-22 01:23:00,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 01:23:00,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-22 01:23:00,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:23:00,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-22 01:23:00,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=1024, Unknown=0, NotChecked=0, Total=1406 [2024-11-22 01:23:00,317 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 38 states, 38 states have (on average 4.157894736842105) internal successors, (158), 38 states have internal predecessors, (158), 28 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (35), 27 states have call predecessors, (35), 27 states have call successors, (35) [2024-11-22 01:23:00,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:23:00,911 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2024-11-22 01:23:00,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-22 01:23:00,912 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.157894736842105) internal successors, (158), 38 states have internal predecessors, (158), 28 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (35), 27 states have call predecessors, (35), 27 states have call successors, (35) Word has length 109 [2024-11-22 01:23:00,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:23:00,914 INFO L225 Difference]: With dead ends: 201 [2024-11-22 01:23:00,914 INFO L226 Difference]: Without dead ends: 196 [2024-11-22 01:23:00,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 197 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1022, Invalid=2170, Unknown=0, NotChecked=0, Total=3192 [2024-11-22 01:23:00,916 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 100 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 01:23:00,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 350 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 01:23:00,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-22 01:23:00,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-11-22 01:23:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 151 states have (on average 1.1390728476821192) internal successors, (172), 151 states have internal predecessors, (172), 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-11-22 01:23:00,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 217 transitions. [2024-11-22 01:23:00,961 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 217 transitions. Word has length 109 [2024-11-22 01:23:00,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:23:00,963 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 217 transitions. [2024-11-22 01:23:00,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.157894736842105) internal successors, (158), 38 states have internal predecessors, (158), 28 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (35), 27 states have call predecessors, (35), 27 states have call successors, (35) [2024-11-22 01:23:00,963 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 217 transitions. [2024-11-22 01:23:00,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-22 01:23:00,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:23:00,966 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, 1] [2024-11-22 01:23:00,972 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-11-22 01:23:01,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:23:01,167 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:23:01,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:23:01,167 INFO L85 PathProgramCache]: Analyzing trace with hash 32762610, now seen corresponding path program 4 times [2024-11-22 01:23:01,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:23:01,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897477843] [2024-11-22 01:23:01,168 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 01:23:01,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:23:01,257 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 01:23:01,258 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-22 01:23:01,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [7318401] [2024-11-22 01:23:01,260 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 01:23:01,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:23:01,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:23:01,262 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 01:23:01,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 01:23:01,349 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 01:23:01,349 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 01:23:01,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 01:23:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 01:23:01,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 01:23:01,438 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 01:23:01,439 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 01:23:01,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-22 01:23:01,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:23:01,645 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2024-11-22 01:23:01,716 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 01:23:01,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:23:01 BoogieIcfgContainer [2024-11-22 01:23:01,718 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 01:23:01,718 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 01:23:01,719 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 01:23:01,719 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 01:23:01,719 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:22:53" (3/4) ... [2024-11-22 01:23:01,720 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 01:23:01,783 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 01:23:01,785 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 01:23:01,786 INFO L158 Benchmark]: Toolchain (without parser) took 9216.22ms. Allocated memory was 119.5MB in the beginning and 201.3MB in the end (delta: 81.8MB). Free memory was 60.5MB in the beginning and 99.7MB in the end (delta: -39.2MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2024-11-22 01:23:01,786 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 119.5MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 01:23:01,786 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.28ms. Allocated memory was 119.5MB in the beginning and 167.8MB in the end (delta: 48.2MB). Free memory was 60.3MB in the beginning and 139.3MB in the end (delta: -79.0MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2024-11-22 01:23:01,786 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.06ms. Allocated memory is still 167.8MB. Free memory was 139.3MB in the beginning and 137.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 01:23:01,787 INFO L158 Benchmark]: Boogie Preprocessor took 23.85ms. Allocated memory is still 167.8MB. Free memory was 137.8MB in the beginning and 135.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 01:23:01,787 INFO L158 Benchmark]: RCFGBuilder took 260.43ms. Allocated memory is still 167.8MB. Free memory was 135.8MB in the beginning and 124.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-22 01:23:01,787 INFO L158 Benchmark]: TraceAbstraction took 8611.49ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 123.9MB in the beginning and 107.0MB in the end (delta: 16.9MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2024-11-22 01:23:01,787 INFO L158 Benchmark]: Witness Printer took 66.80ms. Allocated memory is still 201.3MB. Free memory was 107.0MB in the beginning and 99.7MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-22 01:23:01,788 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.19ms. Allocated memory is still 119.5MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.28ms. Allocated memory was 119.5MB in the beginning and 167.8MB in the end (delta: 48.2MB). Free memory was 60.3MB in the beginning and 139.3MB in the end (delta: -79.0MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.06ms. Allocated memory is still 167.8MB. Free memory was 139.3MB in the beginning and 137.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.85ms. Allocated memory is still 167.8MB. Free memory was 137.8MB in the beginning and 135.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 260.43ms. Allocated memory is still 167.8MB. Free memory was 135.8MB in the beginning and 124.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8611.49ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 123.9MB in the beginning and 107.0MB in the end (delta: 16.9MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. * Witness Printer took 66.80ms. Allocated memory is still 201.3MB. Free memory was 107.0MB in the beginning and 99.7MB 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; VAL [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=40403, R=202, 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=40403, R=202, counter=0] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [A=40403, counter=0, r=401, u=405, v=1] [L34] EXPR counter++ VAL [A=40403, counter=1, r=401, u=405, 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=40403, counter=1, r=401, u=405, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=1, r=401, u=405, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=1, r=400, u=405, v=3] [L34] EXPR counter++ VAL [A=40403, counter=2, r=400, u=405, 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=40403, counter=2, r=400, u=405, v=3] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=2, r=400, u=405, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=2, r=397, u=405, v=5] [L34] EXPR counter++ VAL [A=40403, counter=3, r=397, u=405, 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=40403, counter=3, r=397, u=405, v=5] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=3, r=397, u=405, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=3, r=392, u=405, v=7] [L34] EXPR counter++ VAL [A=40403, counter=4, r=392, u=405, 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=40403, counter=4, r=392, u=405, v=7] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=4, r=392, u=405, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=4, r=385, u=405, v=9] [L34] EXPR counter++ VAL [A=40403, counter=5, r=385, u=405, 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=40403, counter=5, r=385, u=405, v=9] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=5, r=385, u=405, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=5, r=376, u=405, v=11] [L34] EXPR counter++ VAL [A=40403, counter=6, r=376, u=405, 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=40403, counter=6, r=376, u=405, v=11] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=6, r=376, u=405, v=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=6, r=365, u=405, v=13] [L34] EXPR counter++ VAL [A=40403, counter=7, r=365, u=405, 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=40403, counter=7, r=365, u=405, v=13] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=7, r=365, u=405, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=7, r=352, u=405, v=15] [L34] EXPR counter++ VAL [A=40403, counter=8, r=352, u=405, 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=40403, counter=8, r=352, u=405, v=15] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=8, r=352, u=405, v=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=8, r=337, u=405, v=17] [L34] EXPR counter++ VAL [A=40403, counter=9, r=337, u=405, 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=40403, counter=9, r=337, u=405, v=17] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=9, r=337, u=405, v=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=9, r=320, u=405, v=19] [L34] EXPR counter++ VAL [A=40403, counter=10, r=320, u=405, 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=40403, counter=10, r=320, u=405, v=19] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=10, r=320, u=405, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=10, r=301, u=405, v=21] [L34] EXPR counter++ VAL [A=40403, counter=11, r=301, u=405, 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=40403, counter=11, r=301, u=405, v=21] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=11, r=301, u=405, v=21] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=11, r=280, u=405, v=23] [L34] EXPR counter++ VAL [A=40403, counter=12, r=280, u=405, 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=40403, counter=12, r=280, u=405, v=23] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=12, r=280, u=405, v=23] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=12, r=257, u=405, v=25] [L34] EXPR counter++ VAL [A=40403, counter=13, r=257, u=405, 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=40403, counter=13, r=257, u=405, v=25] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=13, r=257, u=405, v=25] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=13, r=232, u=405, v=27] [L34] EXPR counter++ VAL [A=40403, counter=14, r=232, u=405, 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=40403, counter=14, r=232, u=405, v=27] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=14, r=232, u=405, v=27] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=14, r=205, u=405, v=29] [L34] EXPR counter++ VAL [A=40403, counter=15, r=205, u=405, 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=40403, counter=15, r=205, u=405, v=29] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=15, r=205, u=405, v=29] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=15, r=176, u=405, v=31] [L34] EXPR counter++ VAL [A=40403, counter=16, r=176, u=405, 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=40403, counter=16, r=176, u=405, v=31] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=16, r=176, u=405, v=31] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=16, r=145, u=405, v=33] [L34] EXPR counter++ VAL [A=40403, counter=17, r=145, u=405, 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=40403, counter=17, r=145, u=405, v=33] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=17, r=145, u=405, v=33] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=17, r=112, u=405, v=35] [L34] EXPR counter++ VAL [A=40403, counter=18, r=112, u=405, 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=40403, counter=18, r=112, u=405, v=35] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=18, r=112, u=405, v=35] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=18, r=77, u=405, v=37] [L34] EXPR counter++ VAL [A=40403, counter=19, r=77, u=405, 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=40403, counter=19, r=77, u=405, v=37] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=19, r=77, u=405, v=37] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=19, r=40, u=405, v=39] [L34] EXPR counter++ VAL [A=40403, counter=20, r=40, u=405, 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=40403, counter=20, r=40, u=405, v=39] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=20, r=40, u=405, v=39] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=20, r=1, u=405, v=41] [L34] EXPR counter++ VAL [A=40403, counter=21, r=1, u=405, 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, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 178 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 177 mSDsluCounter, 868 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 712 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 351 IncrementalHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 156 mSDtfsCounter, 351 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 543 GetRequests, 435 SyntacticMatches, 6 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred 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.4s InterpolantComputationTime, 925 NumberOfCodeBlocks, 925 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 709 ConstructedInterpolants, 0 QuantifiedInterpolants, 1845 SizeOfPredicates, 17 NumberOfNonLiveVariables, 697 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 16 InterpolantComputations, 3 PerfectInterpolantSequences, 563/1627 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-22 01:23:01,805 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