./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/egcd-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/egcd-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 77987d39218daa3d8ca19fe9337f6493b276d704fa95c2d6fb7800ec30efdcea --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:07:59,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:07:59,979 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:07:59,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:07:59,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:08:00,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:08:00,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:08:00,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:08:00,036 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:08:00,052 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:08:00,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:08:00,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:08:00,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:08:00,056 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:08:00,056 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:08:00,057 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:08:00,057 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:08:00,057 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:08:00,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:08:00,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:08:00,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:08:00,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:08:00,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:08:00,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:08:00,062 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:08:00,062 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:08:00,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:08:00,063 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:08:00,063 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:08:00,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:08:00,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:08:00,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:08:00,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:08:00,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:08:00,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:08:00,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:08:00,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:08:00,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:08:00,065 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:08:00,065 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:08:00,065 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:08:00,066 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:08:00,066 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 -> 77987d39218daa3d8ca19fe9337f6493b276d704fa95c2d6fb7800ec30efdcea [2024-10-11 02:08:00,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:08:00,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:08:00,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:08:00,355 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:08:00,356 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:08:00,357 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound5.c [2024-10-11 02:08:01,815 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:08:02,008 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:08:02,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound5.c [2024-10-11 02:08:02,015 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/26741dbee/853d1cb6472a482c978a1eb5861f5fc3/FLAG6dd48526c [2024-10-11 02:08:02,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/26741dbee/853d1cb6472a482c978a1eb5861f5fc3 [2024-10-11 02:08:02,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:08:02,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:08:02,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:08:02,413 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:08:02,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:08:02,419 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:08:02" (1/1) ... [2024-10-11 02:08:02,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17e5139a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:02, skipping insertion in model container [2024-10-11 02:08:02,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:08:02" (1/1) ... [2024-10-11 02:08:02,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:08:02,601 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/egcd-ll_unwindbound5.c[489,502] [2024-10-11 02:08:02,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:08:02,626 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:08:02,636 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/egcd-ll_unwindbound5.c[489,502] [2024-10-11 02:08:02,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:08:02,673 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:08:02,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:02 WrapperNode [2024-10-11 02:08:02,674 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:08:02,675 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:08:02,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:08:02,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:08:02,683 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:08:02" (1/1) ... [2024-10-11 02:08:02,691 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:08:02" (1/1) ... [2024-10-11 02:08:02,712 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2024-10-11 02:08:02,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:08:02,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:08:02,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:08:02,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:08:02,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:02" (1/1) ... [2024-10-11 02:08:02,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:02" (1/1) ... [2024-10-11 02:08:02,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:02" (1/1) ... [2024-10-11 02:08:02,736 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:08:02,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:02" (1/1) ... [2024-10-11 02:08:02,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:02" (1/1) ... [2024-10-11 02:08:02,740 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:02" (1/1) ... [2024-10-11 02:08:02,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:02" (1/1) ... [2024-10-11 02:08:02,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:02" (1/1) ... [2024-10-11 02:08:02,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:02" (1/1) ... [2024-10-11 02:08:02,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:08:02,746 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:08:02,747 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:08:02,747 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:08:02,747 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:02" (1/1) ... [2024-10-11 02:08:02,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:08:02,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:08:02,779 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:08:02,781 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:08:02,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:08:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 02:08:02,830 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 02:08:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:08:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:08:02,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:08:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 02:08:02,832 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 02:08:02,906 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:08:02,908 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:08:03,091 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-11 02:08:03,092 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:08:03,121 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:08:03,122 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:08:03,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:08:03 BoogieIcfgContainer [2024-10-11 02:08:03,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:08:03,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:08:03,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:08:03,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:08:03,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:08:02" (1/3) ... [2024-10-11 02:08:03,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@434d304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:08:03, skipping insertion in model container [2024-10-11 02:08:03,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:02" (2/3) ... [2024-10-11 02:08:03,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@434d304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:08:03, skipping insertion in model container [2024-10-11 02:08:03,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:08:03" (3/3) ... [2024-10-11 02:08:03,135 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound5.c [2024-10-11 02:08:03,152 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:08:03,153 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:08:03,216 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:08:03,224 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;@103dbaa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:08:03,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:08:03,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 02:08:03,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 02:08:03,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:08:03,235 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:08:03,235 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:08:03,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:08:03,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2138951705, now seen corresponding path program 1 times [2024-10-11 02:08:03,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:08:03,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981550450] [2024-10-11 02:08:03,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:03,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:08:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:03,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:08:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:03,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:08:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:03,401 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:08:03,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:08:03,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981550450] [2024-10-11 02:08:03,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981550450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:08:03,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:08:03,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 02:08:03,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397580982] [2024-10-11 02:08:03,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:08:03,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:08:03,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:08:03,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:08:03,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 02:08:03,431 INFO L87 Difference]: Start difference. First operand has 27 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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:08:03,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:08:03,462 INFO L93 Difference]: Finished difference Result 52 states and 84 transitions. [2024-10-11 02:08:03,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:08:03,471 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:08:03,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:08:03,485 INFO L225 Difference]: With dead ends: 52 [2024-10-11 02:08:03,485 INFO L226 Difference]: Without dead ends: 25 [2024-10-11 02:08:03,493 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:08:03,496 INFO L432 NwaCegarLoop]: 34 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, 34 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:08:03,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:08:03,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-11 02:08:03,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-11 02:08:03,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 02:08:03,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2024-10-11 02:08:03,534 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 17 [2024-10-11 02:08:03,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:08:03,534 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2024-10-11 02:08:03,535 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:08:03,535 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2024-10-11 02:08:03,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 02:08:03,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:08:03,536 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:08:03,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:08:03,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:08:03,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:08:03,537 INFO L85 PathProgramCache]: Analyzing trace with hash -443127421, now seen corresponding path program 1 times [2024-10-11 02:08:03,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:08:03,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817870835] [2024-10-11 02:08:03,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:03,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:08:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:03,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:08:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:03,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:08:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:03,785 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:08:03,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:08:03,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817870835] [2024-10-11 02:08:03,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817870835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:08:03,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:08:03,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 02:08:03,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220889757] [2024-10-11 02:08:03,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:08:03,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 02:08:03,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:08:03,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 02:08:03,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:08:03,791 INFO L87 Difference]: Start difference. First operand 25 states and 34 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:08:03,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:08:03,824 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2024-10-11 02:08:03,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 02:08:03,825 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:08:03,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:08:03,826 INFO L225 Difference]: With dead ends: 37 [2024-10-11 02:08:03,826 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 02:08:03,826 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:08:03,828 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:08:03,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 84 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:08:03,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 02:08:03,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-11 02:08:03,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 02:08:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-10-11 02:08:03,836 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 18 [2024-10-11 02:08:03,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:08:03,838 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-11 02:08:03,838 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:08:03,838 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2024-10-11 02:08:03,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 02:08:03,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:08:03,839 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:08:03,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:08:03,840 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:08:03,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:08:03,840 INFO L85 PathProgramCache]: Analyzing trace with hash -441459125, now seen corresponding path program 1 times [2024-10-11 02:08:03,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:08:03,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829558068] [2024-10-11 02:08:03,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:03,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:08:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:08:03,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1598288792] [2024-10-11 02:08:03,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:03,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:08:03,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:08:03,866 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:08:03,869 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:08:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:03,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 02:08:03,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:08:04,064 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:08:04,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:08:04,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:08:04,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829558068] [2024-10-11 02:08:04,067 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 02:08:04,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598288792] [2024-10-11 02:08:04,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598288792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:08:04,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:08:04,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:08:04,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934177606] [2024-10-11 02:08:04,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:08:04,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:08:04,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:08:04,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:08:04,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:08:04,074 INFO L87 Difference]: Start difference. First operand 27 states and 36 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:08:04,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:08:04,156 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2024-10-11 02:08:04,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:08:04,157 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:08:04,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:08:04,158 INFO L225 Difference]: With dead ends: 44 [2024-10-11 02:08:04,158 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 02:08:04,159 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:08:04,160 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:08:04,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 105 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:08:04,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 02:08:04,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-10-11 02:08:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 24 states have internal predecessors, (29), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 02:08:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2024-10-11 02:08:04,172 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 18 [2024-10-11 02:08:04,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:08:04,172 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2024-10-11 02:08:04,172 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:08:04,172 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2024-10-11 02:08:04,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 02:08:04,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:08:04,173 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:08:04,191 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:08:04,377 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:08:04,378 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:08:04,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:08:04,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1203735897, now seen corresponding path program 1 times [2024-10-11 02:08:04,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:08:04,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354945254] [2024-10-11 02:08:04,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:04,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:08:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:08:04,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [881330525] [2024-10-11 02:08:04,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:04,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:08:04,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:08:04,404 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:08:04,408 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:08:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:04,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 02:08:04,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:08:04,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:08:04,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:08:04,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:08:04,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354945254] [2024-10-11 02:08:04,546 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 02:08:04,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881330525] [2024-10-11 02:08:04,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881330525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:08:04,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:08:04,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:08:04,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102358419] [2024-10-11 02:08:04,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:08:04,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:08:04,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:08:04,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:08:04,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:08:04,552 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 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:08:04,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:08:04,607 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2024-10-11 02:08:04,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:08:04,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 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 23 [2024-10-11 02:08:04,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:08:04,609 INFO L225 Difference]: With dead ends: 48 [2024-10-11 02:08:04,609 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 02:08:04,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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:08:04,610 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:08:04,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 119 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:08:04,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 02:08:04,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-10-11 02:08:04,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 02:08:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2024-10-11 02:08:04,619 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 23 [2024-10-11 02:08:04,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:08:04,619 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2024-10-11 02:08:04,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 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:08:04,620 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2024-10-11 02:08:04,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 02:08:04,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:08:04,621 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:08:04,637 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:08:04,824 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:08:04,827 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:08:04,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:08:04,828 INFO L85 PathProgramCache]: Analyzing trace with hash 705122187, now seen corresponding path program 1 times [2024-10-11 02:08:04,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:08:04,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782503638] [2024-10-11 02:08:04,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:04,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:08:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:08:04,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2047669758] [2024-10-11 02:08:04,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:04,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:08:04,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:08:04,858 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:08:04,859 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:08:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:04,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 02:08:04,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:08:04,986 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 02:08:04,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:08:04,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:08:04,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782503638] [2024-10-11 02:08:04,987 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 02:08:04,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047669758] [2024-10-11 02:08:04,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047669758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:08:04,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:08:04,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:08:04,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355863474] [2024-10-11 02:08:04,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:08:04,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:08:04,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:08:04,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:08:04,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:08:04,990 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 02:08:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:08:05,060 INFO L93 Difference]: Finished difference Result 70 states and 102 transitions. [2024-10-11 02:08:05,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:08:05,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-10-11 02:08:05,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:08:05,066 INFO L225 Difference]: With dead ends: 70 [2024-10-11 02:08:05,068 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 02:08:05,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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:08:05,072 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:08:05,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 104 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:08:05,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 02:08:05,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 02:08:05,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 38 states have internal predecessors, (46), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 02:08:05,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2024-10-11 02:08:05,099 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 28 [2024-10-11 02:08:05,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:08:05,100 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2024-10-11 02:08:05,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 02:08:05,100 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2024-10-11 02:08:05,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 02:08:05,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:08:05,101 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:08:05,118 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:08:05,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:08:05,306 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:08:05,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:08:05,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1795283768, now seen corresponding path program 1 times [2024-10-11 02:08:05,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:08:05,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229628746] [2024-10-11 02:08:05,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:05,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:08:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:05,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:08:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:05,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:08:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:05,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:08:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:05,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:08:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:05,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:08:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:08:05,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:08:05,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229628746] [2024-10-11 02:08:05,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229628746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:08:05,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:08:05,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:08:05,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043835423] [2024-10-11 02:08:05,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:08:05,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:08:05,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:08:05,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:08:05,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:08:05,480 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 02:08:05,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:08:05,543 INFO L93 Difference]: Finished difference Result 82 states and 118 transitions. [2024-10-11 02:08:05,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:08:05,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2024-10-11 02:08:05,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:08:05,545 INFO L225 Difference]: With dead ends: 82 [2024-10-11 02:08:05,545 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 02:08:05,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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:08:05,546 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:08:05,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 128 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:08:05,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 02:08:05,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2024-10-11 02:08:05,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 44 states have internal predecessors, (49), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 02:08:05,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 104 transitions. [2024-10-11 02:08:05,567 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 104 transitions. Word has length 34 [2024-10-11 02:08:05,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:08:05,568 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 104 transitions. [2024-10-11 02:08:05,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 02:08:05,569 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 104 transitions. [2024-10-11 02:08:05,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 02:08:05,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:08:05,570 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] [2024-10-11 02:08:05,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:08:05,571 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:08:05,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:08:05,571 INFO L85 PathProgramCache]: Analyzing trace with hash -427827123, now seen corresponding path program 1 times [2024-10-11 02:08:05,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:08:05,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580142822] [2024-10-11 02:08:05,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:05,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:08:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:05,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:08:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:05,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:08:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:05,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:08:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:05,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:08:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:05,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:08:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:08:05,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:08:05,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580142822] [2024-10-11 02:08:05,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580142822] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:08:05,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165097597] [2024-10-11 02:08:05,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:05,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:08:05,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:08:05,721 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:08:05,723 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:08:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:05,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 02:08:05,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:08:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:08:05,845 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:08:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:08:05,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165097597] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:08:05,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:08:05,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2024-10-11 02:08:05,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671053355] [2024-10-11 02:08:05,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:08:05,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:08:05,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:08:05,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:08:05,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:08:05,929 INFO L87 Difference]: Start difference. First operand 73 states and 104 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-11 02:08:06,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:08:06,119 INFO L93 Difference]: Finished difference Result 217 states and 285 transitions. [2024-10-11 02:08:06,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:08:06,120 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 37 [2024-10-11 02:08:06,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:08:06,125 INFO L225 Difference]: With dead ends: 217 [2024-10-11 02:08:06,126 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 02:08:06,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:08:06,127 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 61 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:08:06,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 177 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:08:06,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 02:08:06,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 189. [2024-10-11 02:08:06,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 107 states have (on average 1.2242990654205608) internal successors, (131), 118 states have internal predecessors, (131), 61 states have call successors, (61), 21 states have call predecessors, (61), 20 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 02:08:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 246 transitions. [2024-10-11 02:08:06,172 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 246 transitions. Word has length 37 [2024-10-11 02:08:06,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:08:06,172 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 246 transitions. [2024-10-11 02:08:06,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-11 02:08:06,173 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 246 transitions. [2024-10-11 02:08:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 02:08:06,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:08:06,174 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:08:06,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 02:08:06,374 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,SelfDestructingSolverStorable6 [2024-10-11 02:08:06,374 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:08:06,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:08:06,375 INFO L85 PathProgramCache]: Analyzing trace with hash -426158827, now seen corresponding path program 1 times [2024-10-11 02:08:06,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:08:06,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547175892] [2024-10-11 02:08:06,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:06,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:08:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:08:06,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [615803617] [2024-10-11 02:08:06,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:06,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:08:06,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:08:06,397 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:08:06,400 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:08:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:06,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 02:08:06,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:08:06,532 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 02:08:06,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:08:06,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:08:06,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547175892] [2024-10-11 02:08:06,533 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 02:08:06,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615803617] [2024-10-11 02:08:06,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615803617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:08:06,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:08:06,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:08:06,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166455259] [2024-10-11 02:08:06,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:08:06,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:08:06,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:08:06,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:08:06,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:08:06,535 INFO L87 Difference]: Start difference. First operand 189 states and 246 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 02:08:06,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:08:06,591 INFO L93 Difference]: Finished difference Result 203 states and 259 transitions. [2024-10-11 02:08:06,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:08:06,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2024-10-11 02:08:06,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:08:06,594 INFO L225 Difference]: With dead ends: 203 [2024-10-11 02:08:06,594 INFO L226 Difference]: Without dead ends: 198 [2024-10-11 02:08:06,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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:08:06,595 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:08:06,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 105 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:08:06,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-11 02:08:06,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-10-11 02:08:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 116 states have (on average 1.206896551724138) internal successors, (140), 127 states have internal predecessors, (140), 58 states have call successors, (58), 24 states have call predecessors, (58), 23 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 02:08:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 249 transitions. [2024-10-11 02:08:06,637 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 249 transitions. Word has length 37 [2024-10-11 02:08:06,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:08:06,637 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 249 transitions. [2024-10-11 02:08:06,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 02:08:06,638 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2024-10-11 02:08:06,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 02:08:06,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:08:06,639 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 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:08:06,654 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:08:06,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:08:06,843 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:08:06,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:08:06,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1298990710, now seen corresponding path program 1 times [2024-10-11 02:08:06,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:08:06,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111420016] [2024-10-11 02:08:06,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:06,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:08:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:07,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:08:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:07,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:08:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:07,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:08:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:07,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:08:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:07,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:08:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:07,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:08:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 02:08:07,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:08:07,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111420016] [2024-10-11 02:08:07,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111420016] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:08:07,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800559104] [2024-10-11 02:08:07,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:07,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:08:07,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:08:07,128 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:08:07,130 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:08:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:07,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 02:08:07,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:08:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:08:07,294 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:08:07,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800559104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:08:07,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:08:07,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-10-11 02:08:07,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700600497] [2024-10-11 02:08:07,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:08:07,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:08:07,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:08:07,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:08:07,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:08:07,296 INFO L87 Difference]: Start difference. First operand 198 states and 249 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 02:08:07,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:08:07,398 INFO L93 Difference]: Finished difference Result 229 states and 278 transitions. [2024-10-11 02:08:07,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:08:07,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2024-10-11 02:08:07,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:08:07,401 INFO L225 Difference]: With dead ends: 229 [2024-10-11 02:08:07,401 INFO L226 Difference]: Without dead ends: 219 [2024-10-11 02:08:07,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:08:07,402 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:08:07,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 128 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:08:07,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-11 02:08:07,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2024-10-11 02:08:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 129 states have (on average 1.178294573643411) internal successors, (152), 140 states have internal predecessors, (152), 57 states have call successors, (57), 28 states have call predecessors, (57), 28 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 02:08:07,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 260 transitions. [2024-10-11 02:08:07,428 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 260 transitions. Word has length 39 [2024-10-11 02:08:07,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:08:07,429 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 260 transitions. [2024-10-11 02:08:07,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 02:08:07,431 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 260 transitions. [2024-10-11 02:08:07,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 02:08:07,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:08:07,432 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] [2024-10-11 02:08:07,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 02:08:07,635 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,SelfDestructingSolverStorable8 [2024-10-11 02:08:07,636 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:08:07,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:08:07,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1786533347, now seen corresponding path program 2 times [2024-10-11 02:08:07,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:08:07,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190137023] [2024-10-11 02:08:07,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:07,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:08:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:08:07,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1430035589] [2024-10-11 02:08:07,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 02:08:07,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:08:07,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:08:07,653 INFO L229 MonitoredProcess]: Starting monitored process 8 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:08:07,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 02:08:07,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 02:08:07,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 02:08:07,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 02:08:07,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:08:08,041 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:08:08,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:08:08,600 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 02:08:08,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:08:08,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190137023] [2024-10-11 02:08:08,601 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 02:08:08,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430035589] [2024-10-11 02:08:08,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430035589] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:08:08,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 02:08:08,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2024-10-11 02:08:08,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385018771] [2024-10-11 02:08:08,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 02:08:08,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 02:08:08,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:08:08,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 02:08:08,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:08:08,603 INFO L87 Difference]: Start difference. First operand 215 states and 260 transitions. Second operand has 17 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-11 02:08:11,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 02:08:11,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:08:11,641 INFO L93 Difference]: Finished difference Result 265 states and 334 transitions. [2024-10-11 02:08:11,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:08:11,641 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 42 [2024-10-11 02:08:11,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:08:11,643 INFO L225 Difference]: With dead ends: 265 [2024-10-11 02:08:11,643 INFO L226 Difference]: Without dead ends: 263 [2024-10-11 02:08:11,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:08:11,645 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:08:11,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 234 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 02:08:11,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-11 02:08:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 227. [2024-10-11 02:08:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 138 states have (on average 1.1666666666666667) internal successors, (161), 149 states have internal predecessors, (161), 57 states have call successors, (57), 31 states have call predecessors, (57), 31 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 02:08:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 269 transitions. [2024-10-11 02:08:11,700 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 269 transitions. Word has length 42 [2024-10-11 02:08:11,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:08:11,701 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 269 transitions. [2024-10-11 02:08:11,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-11 02:08:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 269 transitions. [2024-10-11 02:08:11,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 02:08:11,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:08:11,704 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:08:11,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 02:08:11,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:08:11,909 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:08:11,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:08:11,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1675496919, now seen corresponding path program 1 times [2024-10-11 02:08:11,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:08:11,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188537653] [2024-10-11 02:08:11,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:11,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:08:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:08:11,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1491670384] [2024-10-11 02:08:11,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:11,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:08:11,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:08:11,926 INFO L229 MonitoredProcess]: Starting monitored process 9 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:08:11,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 02:08:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:11,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 02:08:11,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:08:12,313 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-11 02:08:12,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:08:12,698 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 02:08:12,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:08:12,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188537653] [2024-10-11 02:08:12,699 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 02:08:12,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491670384] [2024-10-11 02:08:12,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491670384] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:08:12,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 02:08:12,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2024-10-11 02:08:12,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280041137] [2024-10-11 02:08:12,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 02:08:12,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 02:08:12,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:08:12,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 02:08:12,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:08:12,703 INFO L87 Difference]: Start difference. First operand 227 states and 269 transitions. Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-11 02:08:13,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:08:13,528 INFO L93 Difference]: Finished difference Result 276 states and 341 transitions. [2024-10-11 02:08:13,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 02:08:13,529 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 47 [2024-10-11 02:08:13,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:08:13,530 INFO L225 Difference]: With dead ends: 276 [2024-10-11 02:08:13,531 INFO L226 Difference]: Without dead ends: 234 [2024-10-11 02:08:13,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:08:13,534 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:08:13,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 194 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 02:08:13,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-11 02:08:13,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 199. [2024-10-11 02:08:13,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 128 states have (on average 1.1484375) internal successors, (147), 134 states have internal predecessors, (147), 43 states have call successors, (43), 28 states have call predecessors, (43), 27 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 02:08:13,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 228 transitions. [2024-10-11 02:08:13,589 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 228 transitions. Word has length 47 [2024-10-11 02:08:13,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:08:13,590 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 228 transitions. [2024-10-11 02:08:13,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-11 02:08:13,590 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 228 transitions. [2024-10-11 02:08:13,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 02:08:13,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:08:13,591 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:08:13,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 02:08:13,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 02:08:13,796 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:08:13,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:08:13,796 INFO L85 PathProgramCache]: Analyzing trace with hash -882918259, now seen corresponding path program 1 times [2024-10-11 02:08:13,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:08:13,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555179578] [2024-10-11 02:08:13,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:13,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:08:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:08:13,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [852745445] [2024-10-11 02:08:13,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:13,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:08:13,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:08:13,813 INFO L229 MonitoredProcess]: Starting monitored process 10 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:08:13,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 02:08:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:13,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 02:08:13,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:08:14,105 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-11 02:08:14,106 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:08:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-11 02:08:14,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:08:14,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555179578] [2024-10-11 02:08:14,359 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 02:08:14,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852745445] [2024-10-11 02:08:14,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852745445] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:08:14,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 02:08:14,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-10-11 02:08:14,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740774860] [2024-10-11 02:08:14,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 02:08:14,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 02:08:14,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:08:14,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 02:08:14,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:08:14,361 INFO L87 Difference]: Start difference. First operand 199 states and 228 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 14 states have internal predecessors, (37), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2024-10-11 02:08:14,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:08:14,712 INFO L93 Difference]: Finished difference Result 219 states and 254 transitions. [2024-10-11 02:08:14,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:08:14,712 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 14 states have internal predecessors, (37), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 56 [2024-10-11 02:08:14,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:08:14,714 INFO L225 Difference]: With dead ends: 219 [2024-10-11 02:08:14,714 INFO L226 Difference]: Without dead ends: 212 [2024-10-11 02:08:14,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:08:14,715 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 33 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:08:14,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 365 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 02:08:14,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-11 02:08:14,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 190. [2024-10-11 02:08:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 128 states have (on average 1.140625) internal successors, (146), 130 states have internal predecessors, (146), 34 states have call successors, (34), 28 states have call predecessors, (34), 27 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 02:08:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2024-10-11 02:08:14,750 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 56 [2024-10-11 02:08:14,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:08:14,750 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2024-10-11 02:08:14,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 14 states have internal predecessors, (37), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2024-10-11 02:08:14,750 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2024-10-11 02:08:14,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 02:08:14,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:08:14,751 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:08:14,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 02:08:14,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:08:14,955 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:08:14,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:08:14,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1456768256, now seen corresponding path program 1 times [2024-10-11 02:08:14,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:08:14,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290258361] [2024-10-11 02:08:14,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:14,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:08:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:15,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:08:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:15,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:08:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:15,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:08:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:15,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:08:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:15,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:08:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:15,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:08:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:15,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:08:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:15,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:08:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:15,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:08:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-10-11 02:08:15,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:08:15,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290258361] [2024-10-11 02:08:15,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290258361] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:08:15,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110464647] [2024-10-11 02:08:15,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:15,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:08:15,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:08:15,202 INFO L229 MonitoredProcess]: Starting monitored process 11 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:08:15,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 02:08:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:15,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 02:08:15,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:08:15,319 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-11 02:08:15,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:08:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-11 02:08:15,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110464647] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:08:15,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:08:15,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 13 [2024-10-11 02:08:15,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113806332] [2024-10-11 02:08:15,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:08:15,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 02:08:15,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:08:15,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 02:08:15,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:08:15,428 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand has 13 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 02:08:15,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:08:15,630 INFO L93 Difference]: Finished difference Result 216 states and 241 transitions. [2024-10-11 02:08:15,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:08:15,631 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) Word has length 58 [2024-10-11 02:08:15,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:08:15,632 INFO L225 Difference]: With dead ends: 216 [2024-10-11 02:08:15,632 INFO L226 Difference]: Without dead ends: 196 [2024-10-11 02:08:15,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:08:15,633 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:08:15,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 115 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 02:08:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-11 02:08:15,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 97. [2024-10-11 02:08:15,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 67 states have internal predecessors, (72), 17 states have call successors, (17), 14 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 02:08:15,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2024-10-11 02:08:15,665 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 58 [2024-10-11 02:08:15,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:08:15,665 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2024-10-11 02:08:15,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 02:08:15,666 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2024-10-11 02:08:15,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 02:08:15,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:08:15,667 INFO L215 NwaCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:08:15,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 02:08:15,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 02:08:15,868 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:08:15,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:08:15,868 INFO L85 PathProgramCache]: Analyzing trace with hash -11441917, now seen corresponding path program 2 times [2024-10-11 02:08:15,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:08:15,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119762863] [2024-10-11 02:08:15,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:15,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:08:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:16,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:08:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:16,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:08:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:16,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:08:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:16,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:08:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:16,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:08:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:16,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:08:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:16,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:08:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:16,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:08:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:16,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:08:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:16,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:08:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:16,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:08:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:16,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:08:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:16,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:08:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:16,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:08:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:08:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-10-11 02:08:16,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:08:16,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119762863] [2024-10-11 02:08:16,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119762863] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:08:16,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522763993] [2024-10-11 02:08:16,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 02:08:16,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:08:16,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:08:16,077 INFO L229 MonitoredProcess]: Starting monitored process 12 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:08:16,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 02:08:16,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 02:08:16,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 02:08:16,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 02:08:16,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:08:16,246 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 02:08:16,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:08:16,365 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-10-11 02:08:16,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522763993] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:08:16,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:08:16,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 10 [2024-10-11 02:08:16,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983526534] [2024-10-11 02:08:16,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:08:16,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:08:16,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:08:16,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:08:16,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:08:16,367 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 7 states have call successors, (31), 7 states have call predecessors, (31), 6 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) [2024-10-11 02:08:16,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:08:16,463 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2024-10-11 02:08:16,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:08:16,464 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 7 states have call successors, (31), 7 states have call predecessors, (31), 6 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) Word has length 94 [2024-10-11 02:08:16,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:08:16,465 INFO L225 Difference]: With dead ends: 127 [2024-10-11 02:08:16,465 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 02:08:16,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 208 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:08:16,466 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:08:16,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 111 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:08:16,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 02:08:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2024-10-11 02:08:16,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 78 states have (on average 1.1025641025641026) internal successors, (86), 80 states have internal predecessors, (86), 20 states have call successors, (20), 17 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 02:08:16,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2024-10-11 02:08:16,489 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 94 [2024-10-11 02:08:16,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:08:16,489 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2024-10-11 02:08:16,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 7 states have call successors, (31), 7 states have call predecessors, (31), 6 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) [2024-10-11 02:08:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2024-10-11 02:08:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 02:08:16,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:08:16,490 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:08:16,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 02:08:16,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 02:08:16,691 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:08:16,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:08:16,691 INFO L85 PathProgramCache]: Analyzing trace with hash -201740083, now seen corresponding path program 3 times [2024-10-11 02:08:16,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:08:16,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079391869] [2024-10-11 02:08:16,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:08:16,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:08:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:08:16,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [950133799] [2024-10-11 02:08:16,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 02:08:16,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:08:16,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:08:16,724 INFO L229 MonitoredProcess]: Starting monitored process 13 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:08:16,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 02:08:16,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-11 02:08:16,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-11 02:08:16,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 02:08:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 02:08:16,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 02:08:16,888 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 02:08:16,889 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 02:08:16,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-11 02:08:17,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 02:08:17,095 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:08:17,157 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 02:08:17,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:08:17 BoogieIcfgContainer [2024-10-11 02:08:17,159 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 02:08:17,160 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 02:08:17,160 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 02:08:17,160 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 02:08:17,160 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:08:03" (3/4) ... [2024-10-11 02:08:17,162 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 02:08:17,246 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 02:08:17,246 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 02:08:17,247 INFO L158 Benchmark]: Toolchain (without parser) took 14835.05ms. Allocated memory was 142.6MB in the beginning and 295.7MB in the end (delta: 153.1MB). Free memory was 73.6MB in the beginning and 91.8MB in the end (delta: -18.3MB). Peak memory consumption was 135.2MB. Max. memory is 16.1GB. [2024-10-11 02:08:17,249 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 142.6MB. Free memory was 108.0MB in the beginning and 107.8MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:08:17,250 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.58ms. Allocated memory was 142.6MB in the beginning and 203.4MB in the end (delta: 60.8MB). Free memory was 73.4MB in the beginning and 174.4MB in the end (delta: -101.1MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-10-11 02:08:17,250 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.93ms. Allocated memory is still 203.4MB. Free memory was 174.4MB in the beginning and 173.9MB in the end (delta: 552.3kB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-10-11 02:08:17,250 INFO L158 Benchmark]: Boogie Preprocessor took 31.42ms. Allocated memory is still 203.4MB. Free memory was 173.9MB in the beginning and 172.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:08:17,250 INFO L158 Benchmark]: RCFGBuilder took 376.97ms. Allocated memory is still 203.4MB. Free memory was 172.8MB in the beginning and 159.2MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 02:08:17,251 INFO L158 Benchmark]: TraceAbstraction took 14031.72ms. Allocated memory was 203.4MB in the beginning and 295.7MB in the end (delta: 92.3MB). Free memory was 159.2MB in the beginning and 97.1MB in the end (delta: 62.1MB). Peak memory consumption was 154.3MB. Max. memory is 16.1GB. [2024-10-11 02:08:17,251 INFO L158 Benchmark]: Witness Printer took 86.64ms. Allocated memory is still 295.7MB. Free memory was 97.1MB in the beginning and 91.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 02:08:17,266 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.18ms. Allocated memory is still 142.6MB. Free memory was 108.0MB in the beginning and 107.8MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.58ms. Allocated memory was 142.6MB in the beginning and 203.4MB in the end (delta: 60.8MB). Free memory was 73.4MB in the beginning and 174.4MB in the end (delta: -101.1MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.93ms. Allocated memory is still 203.4MB. Free memory was 174.4MB in the beginning and 173.9MB in the end (delta: 552.3kB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.42ms. Allocated memory is still 203.4MB. Free memory was 173.9MB in the beginning and 172.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 376.97ms. Allocated memory is still 203.4MB. Free memory was 172.8MB in the beginning and 159.2MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14031.72ms. Allocated memory was 203.4MB in the beginning and 295.7MB in the end (delta: 92.3MB). Free memory was 159.2MB in the beginning and 97.1MB in the end (delta: 62.1MB). Peak memory consumption was 154.3MB. Max. memory is 16.1GB. * Witness Printer took 86.64ms. Allocated memory is still 295.7MB. Free memory was 97.1MB in the beginning and 91.8MB in the end (delta: 5.2MB). 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: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [counter=0, x=7, y=1] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [counter=0, x=7, y=1] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=7, b=1, counter=0, p=1, q=0, r=0, s=1, x=7, y=1] [L34] EXPR counter++ VAL [a=7, b=1, counter=1, p=1, q=0, r=0, s=1, x=7, y=1] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=7, b=1, counter=1, p=1, q=0, r=0, s=1, x=7, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=7, b=1, counter=1, p=1, q=0, r=0, s=1, x=7, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=7, b=1, counter=1, p=1, q=0, r=0, s=1, x=7, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=7, b=1, counter=1, p=1, q=0, r=0, s=1, x=7, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=6, b=1, counter=1, p=1, q=0, r=-1, s=1, x=7, y=1] [L34] EXPR counter++ VAL [a=6, b=1, counter=2, p=1, q=0, r=-1, s=1, x=7, y=1] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=6, b=1, counter=2, p=1, q=0, r=-1, s=1, x=7, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=6, b=1, counter=2, p=1, q=0, r=-1, s=1, x=7, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=6, b=1, counter=2, p=1, q=0, r=-1, s=1, x=7, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=6, b=1, counter=2, p=1, q=0, r=-1, s=1, x=7, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=5, b=1, counter=2, p=1, q=0, r=-2, s=1, x=7, y=1] [L34] EXPR counter++ VAL [a=5, b=1, counter=3, p=1, q=0, r=-2, s=1, x=7, y=1] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=5, b=1, counter=3, p=1, q=0, r=-2, s=1, x=7, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=5, b=1, counter=3, p=1, q=0, r=-2, s=1, x=7, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=5, b=1, counter=3, p=1, q=0, r=-2, s=1, x=7, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=5, b=1, counter=3, p=1, q=0, r=-2, s=1, x=7, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=4, b=1, counter=3, p=1, q=0, r=-3, s=1, x=7, y=1] [L34] EXPR counter++ VAL [a=4, b=1, counter=4, p=1, q=0, r=-3, s=1, x=7, y=1] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=4, b=1, counter=4, p=1, q=0, r=-3, s=1, x=7, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=4, b=1, counter=4, p=1, q=0, r=-3, s=1, x=7, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=4, b=1, counter=4, p=1, q=0, r=-3, s=1, x=7, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=4, b=1, counter=4, p=1, q=0, r=-3, s=1, x=7, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=3, b=1, counter=4, p=1, q=0, r=-4, s=1, x=7, y=1] [L34] EXPR counter++ VAL [a=3, b=1, counter=5, p=1, q=0, r=-4, s=1, x=7, y=1] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=3, b=1, counter=5, p=1, q=0, r=-4, s=1, x=7, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=3, b=1, counter=5, p=1, q=0, r=-4, s=1, x=7, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=3, b=1, counter=5, p=1, q=0, r=-4, s=1, x=7, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=3, b=1, counter=5, p=1, q=0, r=-4, s=1, x=7, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=2, b=1, counter=5, p=1, q=0, r=-5, s=1, x=7, y=1] [L34] EXPR counter++ VAL [a=2, b=1, counter=6, p=1, q=0, r=-5, s=1, x=7, y=1] [L34] COND FALSE !(counter++<5) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, counter=6] [L11] COND TRUE !(cond) VAL [\old(cond)=0, counter=6] [L13] reach_error() VAL [\old(cond)=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.9s, OverallIterations: 15, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 273 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 2003 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1583 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1277 IncrementalHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 420 mSDtfsCounter, 1277 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 956 GetRequests, 818 SyntacticMatches, 8 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=10, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 213 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1253 NumberOfCodeBlocks, 1253 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1086 ConstructedInterpolants, 0 QuantifiedInterpolants, 3724 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1351 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 24 InterpolantComputations, 8 PerfectInterpolantSequences, 1479/1947 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:08:17,288 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