./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 7f97a505fe6488215cf15708661c3a7c87a5132fbff317a4b6f7f9cc44d66008 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:11:11,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:11:11,703 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:11:11,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:11:11,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:11:11,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:11:11,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:11:11,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:11:11,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:11:11,738 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:11:11,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:11:11,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:11:11,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:11:11,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:11:11,739 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:11:11,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:11:11,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:11:11,740 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:11:11,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:11:11,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:11:11,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:11:11,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:11:11,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:11:11,741 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:11:11,742 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:11:11,742 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:11:11,742 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:11:11,742 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:11:11,743 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:11:11,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:11:11,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:11:11,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:11:11,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:11:11,744 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:11:11,744 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:11:11,744 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:11:11,744 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:11:11,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:11:11,745 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:11:11,745 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:11:11,745 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:11:11,746 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:11:11,746 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-clean/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-clean/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 -> 7f97a505fe6488215cf15708661c3a7c87a5132fbff317a4b6f7f9cc44d66008 [2024-10-11 02:11:11,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:11:11,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:11:11,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:11:11,987 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:11:11,988 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:11:11,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c [2024-10-11 02:11:13,414 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:11:13,613 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:11:13,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c [2024-10-11 02:11:13,621 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/38b93cb5b/c221794fd6a544f78d518780039dbca6/FLAG06c28ba2f [2024-10-11 02:11:14,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/38b93cb5b/c221794fd6a544f78d518780039dbca6 [2024-10-11 02:11:14,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:11:14,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:11:14,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:11:14,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:11:14,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:11:14,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:11:14" (1/1) ... [2024-10-11 02:11:14,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@146e28a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:14, skipping insertion in model container [2024-10-11 02:11:14,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:11:14" (1/1) ... [2024-10-11 02:11:14,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:11:14,192 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c[535,548] [2024-10-11 02:11:14,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:11:14,225 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:11:14,236 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c[535,548] [2024-10-11 02:11:14,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:11:14,270 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:11:14,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:14 WrapperNode [2024-10-11 02:11:14,270 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:11:14,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:11:14,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:11:14,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:11:14,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:14" (1/1) ... [2024-10-11 02:11:14,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:14" (1/1) ... [2024-10-11 02:11:14,295 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2024-10-11 02:11:14,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:11:14,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:11:14,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:11:14,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:11:14,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:14" (1/1) ... [2024-10-11 02:11:14,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:14" (1/1) ... [2024-10-11 02:11:14,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:14" (1/1) ... [2024-10-11 02:11:14,321 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 02:11:14,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:14" (1/1) ... [2024-10-11 02:11:14,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:14" (1/1) ... [2024-10-11 02:11:14,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:14" (1/1) ... [2024-10-11 02:11:14,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:14" (1/1) ... [2024-10-11 02:11:14,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:14" (1/1) ... [2024-10-11 02:11:14,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:14" (1/1) ... [2024-10-11 02:11:14,329 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:11:14,330 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:11:14,330 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:11:14,330 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:11:14,331 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:14" (1/1) ... [2024-10-11 02:11:14,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:11:14,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:14,363 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:11:14,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:11:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:11:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 02:11:14,462 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 02:11:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:11:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:11:14,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:11:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 02:11:14,463 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 02:11:14,511 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:11:14,513 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:11:14,623 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-11 02:11:14,624 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:11:14,650 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:11:14,650 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 02:11:14,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:11:14 BoogieIcfgContainer [2024-10-11 02:11:14,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:11:14,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:11:14,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:11:14,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:11:14,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:11:14" (1/3) ... [2024-10-11 02:11:14,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d2e102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:11:14, skipping insertion in model container [2024-10-11 02:11:14,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:14" (2/3) ... [2024-10-11 02:11:14,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d2e102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:11:14, skipping insertion in model container [2024-10-11 02:11:14,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:11:14" (3/3) ... [2024-10-11 02:11:14,657 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound5.c [2024-10-11 02:11:14,670 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:11:14,671 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:11:14,711 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:11:14,721 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;@56fbabf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:11:14,721 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:11:14,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 02:11:14,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 02:11:14,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:14,732 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:14,732 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:14,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:14,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1287337846, now seen corresponding path program 1 times [2024-10-11 02:11:14,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:14,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265093276] [2024-10-11 02:11:14,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:14,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:14,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:14,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:14,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:14,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:14,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265093276] [2024-10-11 02:11:14,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265093276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:11:14,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:11:14,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 02:11:14,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780342002] [2024-10-11 02:11:14,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:11:14,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:11:14,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:14,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:11:14,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 02:11:14,943 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:11:14,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:14,966 INFO L93 Difference]: Finished difference Result 56 states and 89 transitions. [2024-10-11 02:11:14,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:11:14,968 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-10-11 02:11:14,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:14,973 INFO L225 Difference]: With dead ends: 56 [2024-10-11 02:11:14,973 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 02:11:14,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 02:11:14,977 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:14,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:11:14,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 02:11:15,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-11 02:11:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 02:11:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-10-11 02:11:15,004 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2024-10-11 02:11:15,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:15,006 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-11 02:11:15,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:11:15,006 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2024-10-11 02:11:15,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 02:11:15,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:15,007 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:15,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:11:15,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:15,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:15,009 INFO L85 PathProgramCache]: Analyzing trace with hash -138178001, now seen corresponding path program 1 times [2024-10-11 02:11:15,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:15,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119088884] [2024-10-11 02:11:15,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:15,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:15,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:15,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:15,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:15,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119088884] [2024-10-11 02:11:15,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119088884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:11:15,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:11:15,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 02:11:15,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710253767] [2024-10-11 02:11:15,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:11:15,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 02:11:15,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:15,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 02:11:15,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:11:15,158 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 02:11:15,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:15,191 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-10-11 02:11:15,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 02:11:15,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-11 02:11:15,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:15,196 INFO L225 Difference]: With dead ends: 36 [2024-10-11 02:11:15,196 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 02:11:15,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:11:15,197 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:15,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 88 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:11:15,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 02:11:15,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-11 02:11:15,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 02:11:15,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-10-11 02:11:15,203 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 18 [2024-10-11 02:11:15,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:15,204 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-10-11 02:11:15,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 02:11:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-10-11 02:11:15,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 02:11:15,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:15,208 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:15,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:11:15,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:15,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:15,210 INFO L85 PathProgramCache]: Analyzing trace with hash -136509705, now seen corresponding path program 1 times [2024-10-11 02:11:15,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:15,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952255719] [2024-10-11 02:11:15,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:15,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:11:15,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [318626632] [2024-10-11 02:11:15,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:15,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:15,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:15,240 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:15,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:11:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:15,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 02:11:15,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:15,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:15,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:11:15,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:15,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952255719] [2024-10-11 02:11:15,509 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 02:11:15,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318626632] [2024-10-11 02:11:15,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318626632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:11:15,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:11:15,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:11:15,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807856496] [2024-10-11 02:11:15,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:11:15,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:11:15,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:15,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:11:15,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:11:15,513 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 02:11:19,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 02:11:21,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 02:11:22,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 02:11:22,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:22,550 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2024-10-11 02:11:22,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:11:22,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-11 02:11:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:22,552 INFO L225 Difference]: With dead ends: 48 [2024-10-11 02:11:22,552 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 02:11:22,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:11:22,553 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:22,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 100 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2024-10-11 02:11:22,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 02:11:22,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-10-11 02:11:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 02:11:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2024-10-11 02:11:22,564 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 18 [2024-10-11 02:11:22,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:22,564 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2024-10-11 02:11:22,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 02:11:22,565 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2024-10-11 02:11:22,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 02:11:22,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:22,566 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:22,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:11:22,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:22,770 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:22,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:22,770 INFO L85 PathProgramCache]: Analyzing trace with hash -99991460, now seen corresponding path program 1 times [2024-10-11 02:11:22,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:22,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226162007] [2024-10-11 02:11:22,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:22,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:23,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:23,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226162007] [2024-10-11 02:11:23,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226162007] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:23,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534211234] [2024-10-11 02:11:23,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:23,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:23,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:23,118 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:23,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:11:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 02:11:23,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:23,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:23,355 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:23,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534211234] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:23,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:23,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2024-10-11 02:11:23,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576805484] [2024-10-11 02:11:23,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:23,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:11:23,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:23,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:11:23,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:11:23,361 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 02:11:23,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:23,511 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2024-10-11 02:11:23,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:11:23,514 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 24 [2024-10-11 02:11:23,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:23,515 INFO L225 Difference]: With dead ends: 52 [2024-10-11 02:11:23,515 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 02:11:23,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:11:23,516 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:23,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 91 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:11:23,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 02:11:23,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-11 02:11:23,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 02:11:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2024-10-11 02:11:23,535 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 24 [2024-10-11 02:11:23,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:23,536 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2024-10-11 02:11:23,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 02:11:23,536 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2024-10-11 02:11:23,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 02:11:23,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:23,539 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, 1, 1] [2024-10-11 02:11:23,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:11:23,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:23,740 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:23,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:23,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1981880857, now seen corresponding path program 1 times [2024-10-11 02:11:23,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:23,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247172039] [2024-10-11 02:11:23,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:23,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,847 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:23,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:23,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247172039] [2024-10-11 02:11:23,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247172039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:11:23,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:11:23,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:11:23,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484541191] [2024-10-11 02:11:23,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:11:23,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:11:23,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:23,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:11:23,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:11:23,850 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 02:11:23,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:23,910 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2024-10-11 02:11:23,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:11:23,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2024-10-11 02:11:23,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:23,911 INFO L225 Difference]: With dead ends: 92 [2024-10-11 02:11:23,911 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 02:11:23,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:11:23,912 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:23,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 107 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:11:23,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 02:11:23,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 02:11:23,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 02:11:23,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2024-10-11 02:11:23,924 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 30 [2024-10-11 02:11:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:23,924 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2024-10-11 02:11:23,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 02:11:23,925 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2024-10-11 02:11:23,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 02:11:23,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:23,926 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:23,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:11:23,926 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:23,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:23,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2089520544, now seen corresponding path program 1 times [2024-10-11 02:11:23,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:23,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890997424] [2024-10-11 02:11:23,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:23,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,003 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 02:11:24,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:24,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890997424] [2024-10-11 02:11:24,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890997424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:11:24,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:11:24,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:11:24,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186851276] [2024-10-11 02:11:24,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:11:24,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:11:24,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:24,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:11:24,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:11:24,005 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 02:11:24,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:24,053 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2024-10-11 02:11:24,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:11:24,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2024-10-11 02:11:24,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:24,054 INFO L225 Difference]: With dead ends: 101 [2024-10-11 02:11:24,054 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 02:11:24,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:11:24,055 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:24,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 97 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:11:24,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 02:11:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2024-10-11 02:11:24,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 02:11:24,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2024-10-11 02:11:24,068 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 36 [2024-10-11 02:11:24,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:24,068 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2024-10-11 02:11:24,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 02:11:24,069 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2024-10-11 02:11:24,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 02:11:24,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:24,070 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:24,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:11:24,070 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:24,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:24,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1409797157, now seen corresponding path program 1 times [2024-10-11 02:11:24,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:24,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892915505] [2024-10-11 02:11:24,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:24,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 02:11:24,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:24,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892915505] [2024-10-11 02:11:24,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892915505] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:24,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752741794] [2024-10-11 02:11:24,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:24,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:24,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:24,169 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:24,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:11:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 02:11:24,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:24,251 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:24,310 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 02:11:24,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752741794] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:24,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:24,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 11 [2024-10-11 02:11:24,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49960627] [2024-10-11 02:11:24,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:24,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:11:24,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:24,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:11:24,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:11:24,312 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 02:11:24,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:24,449 INFO L93 Difference]: Finished difference Result 151 states and 192 transitions. [2024-10-11 02:11:24,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:11:24,449 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 38 [2024-10-11 02:11:24,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:24,451 INFO L225 Difference]: With dead ends: 151 [2024-10-11 02:11:24,451 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 02:11:24,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:11:24,452 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 38 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:24,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 164 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:11:24,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 02:11:24,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2024-10-11 02:11:24,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 78 states have internal predecessors, (93), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 02:11:24,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2024-10-11 02:11:24,478 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 38 [2024-10-11 02:11:24,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:24,478 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2024-10-11 02:11:24,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 02:11:24,478 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2024-10-11 02:11:24,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 02:11:24,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:24,479 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:24,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 02:11:24,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:24,681 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:24,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:24,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1072156249, now seen corresponding path program 1 times [2024-10-11 02:11:24,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:24,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156140003] [2024-10-11 02:11:24,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:24,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:11:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,725 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:11:24,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:24,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156140003] [2024-10-11 02:11:24,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156140003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:11:24,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:11:24,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 02:11:24,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909078969] [2024-10-11 02:11:24,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:11:24,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 02:11:24,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:24,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 02:11:24,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:11:24,727 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 02:11:24,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:24,774 INFO L93 Difference]: Finished difference Result 190 states and 254 transitions. [2024-10-11 02:11:24,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 02:11:24,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2024-10-11 02:11:24,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:24,777 INFO L225 Difference]: With dead ends: 190 [2024-10-11 02:11:24,777 INFO L226 Difference]: Without dead ends: 143 [2024-10-11 02:11:24,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:11:24,778 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 16 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:24,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 121 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:11:24,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-11 02:11:24,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 125. [2024-10-11 02:11:24,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 92 states have (on average 1.25) internal successors, (115), 94 states have internal predecessors, (115), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 02:11:24,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 160 transitions. [2024-10-11 02:11:24,803 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 160 transitions. Word has length 42 [2024-10-11 02:11:24,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:24,804 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 160 transitions. [2024-10-11 02:11:24,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 02:11:24,804 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 160 transitions. [2024-10-11 02:11:24,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 02:11:24,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:24,805 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:24,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:11:24,805 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:24,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:24,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2142553388, now seen corresponding path program 1 times [2024-10-11 02:11:24,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:24,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835795777] [2024-10-11 02:11:24,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:24,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:11:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,910 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:11:24,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:24,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835795777] [2024-10-11 02:11:24,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835795777] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:24,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447009379] [2024-10-11 02:11:24,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:24,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:24,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:24,912 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:24,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 02:11:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 02:11:24,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:25,014 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:25,015 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:11:25,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447009379] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:25,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:25,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 11 [2024-10-11 02:11:25,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824542837] [2024-10-11 02:11:25,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:25,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:11:25,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:25,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:11:25,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:11:25,085 INFO L87 Difference]: Start difference. First operand 125 states and 160 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 7 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-10-11 02:11:25,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:25,179 INFO L93 Difference]: Finished difference Result 198 states and 265 transitions. [2024-10-11 02:11:25,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:11:25,180 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 7 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 44 [2024-10-11 02:11:25,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:25,181 INFO L225 Difference]: With dead ends: 198 [2024-10-11 02:11:25,181 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 02:11:25,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:11:25,182 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 18 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:25,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 167 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:11:25,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 02:11:25,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-10-11 02:11:25,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 98 states have internal predecessors, (121), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 02:11:25,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 166 transitions. [2024-10-11 02:11:25,207 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 166 transitions. Word has length 44 [2024-10-11 02:11:25,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:25,207 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 166 transitions. [2024-10-11 02:11:25,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 7 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-10-11 02:11:25,208 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 166 transitions. [2024-10-11 02:11:25,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 02:11:25,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:25,209 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:25,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 02:11:25,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 02:11:25,410 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:25,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:25,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1696895027, now seen corresponding path program 1 times [2024-10-11 02:11:25,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:25,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232141407] [2024-10-11 02:11:25,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:25,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:25,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:25,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:25,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:25,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:25,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:11:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:25,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:11:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:25,517 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:11:25,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:25,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232141407] [2024-10-11 02:11:25,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232141407] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:25,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652563319] [2024-10-11 02:11:25,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:25,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:25,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:25,522 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:25,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 02:11:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:25,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 02:11:25,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:25,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:11:25,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652563319] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:25,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:25,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 10 [2024-10-11 02:11:25,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010044536] [2024-10-11 02:11:25,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:25,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:11:25,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:25,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:11:25,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:11:25,730 INFO L87 Difference]: Start difference. First operand 131 states and 166 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2024-10-11 02:11:25,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:25,797 INFO L93 Difference]: Finished difference Result 140 states and 176 transitions. [2024-10-11 02:11:25,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:11:25,798 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 50 [2024-10-11 02:11:25,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:25,799 INFO L225 Difference]: With dead ends: 140 [2024-10-11 02:11:25,799 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 02:11:25,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 104 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:11:25,800 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 21 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:25,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 116 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:11:25,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 02:11:25,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-11 02:11:25,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 02:11:25,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 170 transitions. [2024-10-11 02:11:25,820 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 170 transitions. Word has length 50 [2024-10-11 02:11:25,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:25,821 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 170 transitions. [2024-10-11 02:11:25,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2024-10-11 02:11:25,821 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 170 transitions. [2024-10-11 02:11:25,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 02:11:25,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:25,822 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:25,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 02:11:26,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 02:11:26,024 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:26,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:26,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1952424639, now seen corresponding path program 2 times [2024-10-11 02:11:26,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:26,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990077710] [2024-10-11 02:11:26,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:26,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:11:26,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [646881497] [2024-10-11 02:11:26,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 02:11:26,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:26,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:26,041 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:26,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 02:11:26,094 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 02:11:26,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-11 02:11:26,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 02:11:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 02:11:26,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 02:11:26,128 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 02:11:26,129 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 02:11:26,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 02:11:26,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 02:11:26,333 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:26,356 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 02:11:26,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:11:26 BoogieIcfgContainer [2024-10-11 02:11:26,358 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 02:11:26,358 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 02:11:26,358 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 02:11:26,358 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 02:11:26,359 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:11:14" (3/4) ... [2024-10-11 02:11:26,359 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 02:11:26,409 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 02:11:26,411 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 02:11:26,411 INFO L158 Benchmark]: Toolchain (without parser) took 12394.42ms. Allocated memory is still 197.1MB. Free memory was 129.5MB in the beginning and 109.3MB in the end (delta: 20.2MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2024-10-11 02:11:26,412 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 75.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:11:26,412 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.78ms. Allocated memory is still 197.1MB. Free memory was 129.3MB in the beginning and 116.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 02:11:26,412 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.71ms. Allocated memory is still 197.1MB. Free memory was 116.8MB in the beginning and 115.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 02:11:26,412 INFO L158 Benchmark]: Boogie Preprocessor took 32.76ms. Allocated memory is still 197.1MB. Free memory was 115.1MB in the beginning and 113.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 02:11:26,412 INFO L158 Benchmark]: RCFGBuilder took 321.29ms. Allocated memory is still 197.1MB. Free memory was 113.3MB in the beginning and 158.9MB in the end (delta: -45.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 02:11:26,412 INFO L158 Benchmark]: TraceAbstraction took 11705.36ms. Allocated memory is still 197.1MB. Free memory was 157.8MB in the beginning and 112.5MB in the end (delta: 45.4MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2024-10-11 02:11:26,412 INFO L158 Benchmark]: Witness Printer took 52.91ms. Allocated memory is still 197.1MB. Free memory was 111.4MB in the beginning and 109.3MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 02:11:26,414 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.13ms. Allocated memory is still 109.1MB. Free memory is still 75.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.78ms. Allocated memory is still 197.1MB. Free memory was 129.3MB in the beginning and 116.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.71ms. Allocated memory is still 197.1MB. Free memory was 116.8MB in the beginning and 115.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.76ms. Allocated memory is still 197.1MB. Free memory was 115.1MB in the beginning and 113.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 321.29ms. Allocated memory is still 197.1MB. Free memory was 113.3MB in the beginning and 158.9MB in the end (delta: -45.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11705.36ms. Allocated memory is still 197.1MB. Free memory was 157.8MB in the beginning and 112.5MB in the end (delta: 45.4MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. * Witness Printer took 52.91ms. Allocated memory is still 197.1MB. Free memory was 111.4MB in the beginning and 109.3MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L25] 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] [L25] RET assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [A=3, R=0, counter=0] [L27] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L27] RET assume_abort_if_not(A % 2 == 1) VAL [A=3, R=0, counter=0] [L29] u = ((long long) 2 * R) + 1 [L30] v = 1 [L31] r = ((long long) R * R) - A VAL [A=3, counter=0, r=-3, u=1, v=1] [L34] EXPR counter++ VAL [A=3, counter=1, r=-3, u=1, v=1] [L34] COND TRUE counter++<5 [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=3, counter=1, r=-3, u=1, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=3, counter=1, r=-3, u=1, v=1] [L39] EXPR counter++ VAL [A=3, counter=2, r=-3, u=1, v=1] [L39] COND TRUE counter++<5 [L40] 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] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=3, counter=2, r=-3, u=1, v=1] [L41] COND TRUE !(r > 0) VAL [A=3, counter=2, r=-3, u=1, v=1] [L47] EXPR counter++ VAL [A=3, counter=3, r=-3, u=1, v=1] [L47] COND TRUE counter++<5 [L48] 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] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=3, counter=3, r=-3, u=1, v=1] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [A=3, counter=3, r=-2, u=3, v=1] [L47] EXPR counter++ VAL [A=3, counter=4, r=-2, u=3, v=1] [L47] COND TRUE counter++<5 [L48] 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] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=3, counter=4, r=-2, u=3, v=1] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [A=3, counter=4, r=1, u=5, v=1] [L47] EXPR counter++ VAL [A=3, counter=5, r=1, u=5, v=1] [L47] COND TRUE counter++<5 [L48] 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] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=3, counter=5, r=1, u=5, v=1] [L49] COND TRUE !(r < 0) VAL [A=3, counter=5, r=1, u=5, v=1] [L34] EXPR counter++ VAL [A=3, counter=6, r=1, u=5, v=1] [L34] COND FALSE !(counter++<5) [L56] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=6] [L12] COND TRUE !(cond) VAL [\old(cond)=0, counter=6] [L14] reach_error() VAL [\old(cond)=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 183 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 1087 SdHoareTripleChecker+Invalid, 7.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 771 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 380 IncrementalHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 316 mSDtfsCounter, 380 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 447 GetRequests, 376 SyntacticMatches, 12 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=10, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 33 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 607 NumberOfCodeBlocks, 607 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 611 ConstructedInterpolants, 0 QuantifiedInterpolants, 1438 SizeOfPredicates, 11 NumberOfNonLiveVariables, 498 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 255/328 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 02:11:26,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE