./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f97a505fe6488215cf15708661c3a7c87a5132fbff317a4b6f7f9cc44d66008 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:20:42,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:20:42,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:20:42,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:20:42,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:20:42,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:20:42,940 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:20:42,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:20:42,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:20:42,941 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:20:42,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:20:42,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:20:42,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:20:42,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:20:42,943 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:20:42,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:20:42,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:20:42,946 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:20:42,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:20:42,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:20:42,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:20:42,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:20:42,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:20:42,951 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:20:42,951 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:20:42,951 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:20:42,952 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:20:42,952 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:20:42,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:20:42,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:20:42,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:20:42,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:20:42,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:20:42,954 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:20:42,955 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:20:42,955 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:20:42,955 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:20:42,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:20:42,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:20:42,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:20:42,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:20:42,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:20:42,956 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7f97a505fe6488215cf15708661c3a7c87a5132fbff317a4b6f7f9cc44d66008 [2024-10-14 02:20:43,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:20:43,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:20:43,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:20:43,224 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:20:43,224 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:20:43,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c [2024-10-14 02:20:44,661 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:20:44,826 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:20:44,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c [2024-10-14 02:20:44,834 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c614341a/5f8607317bbb44119ebd26e9fb30f49b/FLAGbd2821692 [2024-10-14 02:20:44,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c614341a/5f8607317bbb44119ebd26e9fb30f49b [2024-10-14 02:20:44,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:20:44,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:20:44,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:20:44,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:20:44,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:20:44,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:20:44" (1/1) ... [2024-10-14 02:20:44,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a154299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:20:44, skipping insertion in model container [2024-10-14 02:20:44,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:20:44" (1/1) ... [2024-10-14 02:20:44,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:20:45,038 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c[535,548] [2024-10-14 02:20:45,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:20:45,083 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:20:45,097 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c[535,548] [2024-10-14 02:20:45,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:20:45,131 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:20:45,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:20:45 WrapperNode [2024-10-14 02:20:45,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:20:45,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:20:45,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:20:45,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:20:45,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:20:45" (1/1) ... [2024-10-14 02:20:45,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:20:45" (1/1) ... [2024-10-14 02:20:45,166 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2024-10-14 02:20:45,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:20:45,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:20:45,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:20:45,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:20:45,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:20:45" (1/1) ... [2024-10-14 02:20:45,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:20:45" (1/1) ... [2024-10-14 02:20:45,179 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:20:45" (1/1) ... [2024-10-14 02:20:45,190 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 02:20:45,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:20:45" (1/1) ... [2024-10-14 02:20:45,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:20:45" (1/1) ... [2024-10-14 02:20:45,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:20:45" (1/1) ... [2024-10-14 02:20:45,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:20:45" (1/1) ... [2024-10-14 02:20:45,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:20:45" (1/1) ... [2024-10-14 02:20:45,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:20:45" (1/1) ... [2024-10-14 02:20:45,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:20:45,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:20:45,210 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:20:45,210 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:20:45,211 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:20:45" (1/1) ... [2024-10-14 02:20:45,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:20:45,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:20:45,244 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 02:20:45,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 02:20:45,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:20:45,298 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 02:20:45,299 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 02:20:45,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:20:45,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:20:45,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:20:45,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 02:20:45,301 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 02:20:45,368 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:20:45,370 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:20:45,572 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-14 02:20:45,572 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:20:45,598 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:20:45,598 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-14 02:20:45,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:20:45 BoogieIcfgContainer [2024-10-14 02:20:45,599 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:20:45,602 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:20:45,602 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:20:45,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:20:45,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:20:44" (1/3) ... [2024-10-14 02:20:45,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1af8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:20:45, skipping insertion in model container [2024-10-14 02:20:45,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:20:45" (2/3) ... [2024-10-14 02:20:45,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1af8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:20:45, skipping insertion in model container [2024-10-14 02:20:45,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:20:45" (3/3) ... [2024-10-14 02:20:45,609 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound5.c [2024-10-14 02:20:45,627 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:20:45,627 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:20:45,678 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:20:45,685 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;@24ab3da3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:20:45,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:20:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 02:20:45,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 02:20:45,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:20:45,696 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:20:45,697 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:20:45,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:20:45,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1287337846, now seen corresponding path program 1 times [2024-10-14 02:20:45,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:20:45,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280153125] [2024-10-14 02:20:45,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:20:45,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:20:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:45,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:20:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:45,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:20:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:45,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:20:45,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:20:45,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280153125] [2024-10-14 02:20:45,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280153125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:20:45,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:20:45,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 02:20:45,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884823760] [2024-10-14 02:20:45,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:20:45,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 02:20:45,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:20:45,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 02:20:45,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 02:20:45,948 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 02:20:45,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:20:45,971 INFO L93 Difference]: Finished difference Result 56 states and 89 transitions. [2024-10-14 02:20:45,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 02:20:45,973 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-10-14 02:20:45,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:20:45,978 INFO L225 Difference]: With dead ends: 56 [2024-10-14 02:20:45,978 INFO L226 Difference]: Without dead ends: 27 [2024-10-14 02:20:45,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 02:20:45,983 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:20:45,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:20:45,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-14 02:20:46,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-14 02:20:46,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 02:20:46,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-10-14 02:20:46,016 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2024-10-14 02:20:46,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:20:46,016 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-14 02:20:46,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 02:20:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2024-10-14 02:20:46,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 02:20:46,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:20:46,018 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:20:46,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:20:46,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:20:46,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:20:46,020 INFO L85 PathProgramCache]: Analyzing trace with hash -138178001, now seen corresponding path program 1 times [2024-10-14 02:20:46,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:20:46,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607783768] [2024-10-14 02:20:46,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:20:46,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:20:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:46,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:20:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:46,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:20:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:20:46,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:20:46,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607783768] [2024-10-14 02:20:46,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607783768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:20:46,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:20:46,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 02:20:46,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659044403] [2024-10-14 02:20:46,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:20:46,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 02:20:46,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:20:46,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 02:20:46,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 02:20:46,264 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 02:20:46,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:20:46,303 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-10-14 02:20:46,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 02:20:46,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-14 02:20:46,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:20:46,307 INFO L225 Difference]: With dead ends: 36 [2024-10-14 02:20:46,307 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 02:20:46,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 02:20:46,308 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:20:46,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 88 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:20:46,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 02:20:46,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-14 02:20:46,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 02:20:46,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-10-14 02:20:46,325 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 18 [2024-10-14 02:20:46,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:20:46,326 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-10-14 02:20:46,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 02:20:46,326 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-10-14 02:20:46,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 02:20:46,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:20:46,327 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:20:46,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:20:46,327 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:20:46,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:20:46,328 INFO L85 PathProgramCache]: Analyzing trace with hash -136509705, now seen corresponding path program 1 times [2024-10-14 02:20:46,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:20:46,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858569460] [2024-10-14 02:20:46,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:20:46,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:20:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 02:20:46,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [298084504] [2024-10-14 02:20:46,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:20:46,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:20:46,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:20:46,385 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:20:46,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 02:20:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:46,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 02:20:46,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:20:46,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:20:46,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:20:46,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:20:46,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858569460] [2024-10-14 02:20:46,725 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 02:20:46,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298084504] [2024-10-14 02:20:46,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298084504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:20:46,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:20:46,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 02:20:46,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116352182] [2024-10-14 02:20:46,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:20:46,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:20:46,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:20:46,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:20:46,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 02:20:46,731 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 02:20:50,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 02:20:51,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 02:20:52,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:20:52,827 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2024-10-14 02:20:52,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 02:20:52,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-14 02:20:52,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:20:52,829 INFO L225 Difference]: With dead ends: 48 [2024-10-14 02:20:52,829 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 02:20:52,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:20:52,832 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:20:52,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 100 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2024-10-14 02:20:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 02:20:52,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-10-14 02:20:52,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 02:20:52,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2024-10-14 02:20:52,851 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 18 [2024-10-14 02:20:52,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:20:52,852 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2024-10-14 02:20:52,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 02:20:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2024-10-14 02:20:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 02:20:52,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:20:52,853 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:20:52,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 02:20:53,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:20:53,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:20:53,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:20:53,059 INFO L85 PathProgramCache]: Analyzing trace with hash -99991460, now seen corresponding path program 1 times [2024-10-14 02:20:53,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:20:53,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585763885] [2024-10-14 02:20:53,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:20:53,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:20:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:53,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:20:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:53,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:20:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:53,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:20:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:20:53,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:20:53,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585763885] [2024-10-14 02:20:53,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585763885] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:20:53,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142729752] [2024-10-14 02:20:53,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:20:53,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:20:53,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:20:53,403 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:20:53,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 02:20:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:53,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 02:20:53,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:20:53,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:20:53,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:20:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:20:53,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142729752] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:20:53,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:20:53,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2024-10-14 02:20:53,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917222070] [2024-10-14 02:20:53,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:20:53,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 02:20:53,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:20:53,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 02:20:53,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:20:53,680 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 02:20:53,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:20:53,814 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2024-10-14 02:20:53,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:20:53,815 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 24 [2024-10-14 02:20:53,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:20:53,816 INFO L225 Difference]: With dead ends: 52 [2024-10-14 02:20:53,816 INFO L226 Difference]: Without dead ends: 47 [2024-10-14 02:20:53,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:20:53,818 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:20:53,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 91 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:20:53,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-14 02:20:53,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-14 02:20:53,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 02:20:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2024-10-14 02:20:53,844 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 24 [2024-10-14 02:20:53,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:20:53,844 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2024-10-14 02:20:53,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 02:20:53,845 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2024-10-14 02:20:53,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 02:20:53,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:20:53,846 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:20:53,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 02:20:54,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-14 02:20:54,047 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:20:54,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:20:54,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1981880857, now seen corresponding path program 1 times [2024-10-14 02:20:54,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:20:54,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968235699] [2024-10-14 02:20:54,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:20:54,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:20:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:54,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:20:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:54,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:20:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:54,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:20:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:54,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:20:54,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:20:54,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968235699] [2024-10-14 02:20:54,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968235699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:20:54,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:20:54,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:20:54,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948090504] [2024-10-14 02:20:54,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:20:54,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:20:54,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:20:54,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:20:54,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:20:54,173 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 02:20:54,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:20:54,225 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2024-10-14 02:20:54,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:20:54,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2024-10-14 02:20:54,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:20:54,227 INFO L225 Difference]: With dead ends: 92 [2024-10-14 02:20:54,227 INFO L226 Difference]: Without dead ends: 55 [2024-10-14 02:20:54,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:20:54,228 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:20:54,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 107 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:20:54,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-14 02:20:54,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-14 02:20:54,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 02:20:54,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2024-10-14 02:20:54,245 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 30 [2024-10-14 02:20:54,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:20:54,245 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2024-10-14 02:20:54,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 02:20:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2024-10-14 02:20:54,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 02:20:54,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:20:54,247 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:20:54,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 02:20:54,248 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:20:54,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:20:54,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2089520544, now seen corresponding path program 1 times [2024-10-14 02:20:54,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:20:54,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989349311] [2024-10-14 02:20:54,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:20:54,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:20:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:54,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:20:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:54,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:20:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:54,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:20:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:54,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 02:20:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:54,349 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 02:20:54,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:20:54,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989349311] [2024-10-14 02:20:54,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989349311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:20:54,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:20:54,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:20:54,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181627030] [2024-10-14 02:20:54,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:20:54,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:20:54,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:20:54,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:20:54,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:20:54,352 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 02:20:54,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:20:54,410 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2024-10-14 02:20:54,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:20:54,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2024-10-14 02:20:54,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:20:54,412 INFO L225 Difference]: With dead ends: 101 [2024-10-14 02:20:54,412 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 02:20:54,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:20:54,413 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:20:54,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 97 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:20:54,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 02:20:54,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2024-10-14 02:20:54,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 02:20:54,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2024-10-14 02:20:54,433 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 36 [2024-10-14 02:20:54,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:20:54,433 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2024-10-14 02:20:54,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 02:20:54,433 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2024-10-14 02:20:54,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 02:20:54,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:20:54,435 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:20:54,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 02:20:54,435 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:20:54,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:20:54,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1409797157, now seen corresponding path program 1 times [2024-10-14 02:20:54,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:20:54,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988782718] [2024-10-14 02:20:54,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:20:54,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:20:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:54,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:20:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:54,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:20:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:54,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:20:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:54,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 02:20:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 02:20:54,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:20:54,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988782718] [2024-10-14 02:20:54,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988782718] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:20:54,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46196520] [2024-10-14 02:20:54,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:20:54,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:20:54,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:20:54,544 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:20:54,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 02:20:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:54,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 02:20:54,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:20:54,661 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:20:54,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:20:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 02:20:54,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46196520] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:20:54,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:20:54,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 11 [2024-10-14 02:20:54,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238874878] [2024-10-14 02:20:54,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:20:54,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 02:20:54,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:20:54,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 02:20:54,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:20:54,739 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-14 02:20:54,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:20:54,875 INFO L93 Difference]: Finished difference Result 151 states and 192 transitions. [2024-10-14 02:20:54,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:20:54,876 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 38 [2024-10-14 02:20:54,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:20:54,878 INFO L225 Difference]: With dead ends: 151 [2024-10-14 02:20:54,878 INFO L226 Difference]: Without dead ends: 114 [2024-10-14 02:20:54,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:20:54,879 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 38 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:20:54,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 164 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:20:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-14 02:20:54,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2024-10-14 02:20:54,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 78 states have internal predecessors, (93), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 02:20:54,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2024-10-14 02:20:54,914 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 38 [2024-10-14 02:20:54,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:20:54,915 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2024-10-14 02:20:54,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-14 02:20:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2024-10-14 02:20:54,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 02:20:54,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:20:54,916 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:20:54,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 02:20:55,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:20:55,118 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:20:55,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:20:55,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1072156249, now seen corresponding path program 1 times [2024-10-14 02:20:55,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:20:55,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110466261] [2024-10-14 02:20:55,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:20:55,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:20:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:55,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:20:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:55,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:20:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:55,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:20:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:55,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 02:20:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:55,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:20:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 02:20:55,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:20:55,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110466261] [2024-10-14 02:20:55,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110466261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:20:55,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:20:55,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 02:20:55,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856627093] [2024-10-14 02:20:55,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:20:55,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 02:20:55,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:20:55,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 02:20:55,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 02:20:55,181 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 02:20:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:20:55,242 INFO L93 Difference]: Finished difference Result 190 states and 254 transitions. [2024-10-14 02:20:55,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 02:20:55,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2024-10-14 02:20:55,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:20:55,246 INFO L225 Difference]: With dead ends: 190 [2024-10-14 02:20:55,246 INFO L226 Difference]: Without dead ends: 143 [2024-10-14 02:20:55,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 02:20:55,247 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 16 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:20:55,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 121 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:20:55,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-14 02:20:55,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 125. [2024-10-14 02:20:55,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 92 states have (on average 1.25) internal successors, (115), 94 states have internal predecessors, (115), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 02:20:55,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 160 transitions. [2024-10-14 02:20:55,293 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 160 transitions. Word has length 42 [2024-10-14 02:20:55,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:20:55,293 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 160 transitions. [2024-10-14 02:20:55,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 02:20:55,294 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 160 transitions. [2024-10-14 02:20:55,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 02:20:55,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:20:55,295 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:20:55,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 02:20:55,295 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:20:55,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:20:55,298 INFO L85 PathProgramCache]: Analyzing trace with hash 2142553388, now seen corresponding path program 1 times [2024-10-14 02:20:55,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:20:55,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766512252] [2024-10-14 02:20:55,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:20:55,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:20:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:55,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:20:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:55,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:20:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:55,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:20:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:55,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 02:20:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:55,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:20:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:55,417 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 02:20:55,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:20:55,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766512252] [2024-10-14 02:20:55,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766512252] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:20:55,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117294778] [2024-10-14 02:20:55,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:20:55,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:20:55,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:20:55,421 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:20:55,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 02:20:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:55,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 02:20:55,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:20:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:20:55,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:20:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 02:20:55,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117294778] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:20:55,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:20:55,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 11 [2024-10-14 02:20:55,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210355816] [2024-10-14 02:20:55,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:20:55,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 02:20:55,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:20:55,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 02:20:55,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:20:55,618 INFO L87 Difference]: Start difference. First operand 125 states and 160 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 7 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-10-14 02:20:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:20:55,728 INFO L93 Difference]: Finished difference Result 198 states and 265 transitions. [2024-10-14 02:20:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 02:20:55,728 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 7 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 44 [2024-10-14 02:20:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:20:55,730 INFO L225 Difference]: With dead ends: 198 [2024-10-14 02:20:55,730 INFO L226 Difference]: Without dead ends: 133 [2024-10-14 02:20:55,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:20:55,732 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 18 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:20:55,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 167 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:20:55,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-14 02:20:55,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-10-14 02:20:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 98 states have internal predecessors, (121), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 02:20:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 166 transitions. [2024-10-14 02:20:55,774 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 166 transitions. Word has length 44 [2024-10-14 02:20:55,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:20:55,774 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 166 transitions. [2024-10-14 02:20:55,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 7 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-10-14 02:20:55,776 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 166 transitions. [2024-10-14 02:20:55,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 02:20:55,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:20:55,780 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:20:55,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 02:20:55,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:20:55,981 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:20:55,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:20:55,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1696895027, now seen corresponding path program 1 times [2024-10-14 02:20:55,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:20:55,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776651459] [2024-10-14 02:20:55,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:20:55,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:20:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:56,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:20:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:56,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:20:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:56,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:20:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:56,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 02:20:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:56,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:20:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:56,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 02:20:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:56,175 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 02:20:56,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:20:56,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776651459] [2024-10-14 02:20:56,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776651459] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:20:56,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631458891] [2024-10-14 02:20:56,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:20:56,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:20:56,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:20:56,180 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:20:56,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 02:20:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:20:56,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 02:20:56,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:20:56,322 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:20:56,322 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:20:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 02:20:56,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631458891] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:20:56,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:20:56,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 10 [2024-10-14 02:20:56,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664233726] [2024-10-14 02:20:56,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:20:56,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:20:56,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:20:56,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:20:56,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:20:56,423 INFO L87 Difference]: Start difference. First operand 131 states and 166 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2024-10-14 02:20:56,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:20:56,505 INFO L93 Difference]: Finished difference Result 140 states and 176 transitions. [2024-10-14 02:20:56,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:20:56,505 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 50 [2024-10-14 02:20:56,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:20:56,506 INFO L225 Difference]: With dead ends: 140 [2024-10-14 02:20:56,506 INFO L226 Difference]: Without dead ends: 135 [2024-10-14 02:20:56,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 104 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:20:56,507 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 21 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:20:56,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 116 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:20:56,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-14 02:20:56,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-14 02:20:56,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 02:20:56,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 170 transitions. [2024-10-14 02:20:56,542 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 170 transitions. Word has length 50 [2024-10-14 02:20:56,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:20:56,543 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 170 transitions. [2024-10-14 02:20:56,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2024-10-14 02:20:56,543 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 170 transitions. [2024-10-14 02:20:56,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 02:20:56,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:20:56,546 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:20:56,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 02:20:56,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 02:20:56,747 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:20:56,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:20:56,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1952424639, now seen corresponding path program 2 times [2024-10-14 02:20:56,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:20:56,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261879094] [2024-10-14 02:20:56,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:20:56,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:20:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 02:20:56,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [557409070] [2024-10-14 02:20:56,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 02:20:56,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:20:56,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:20:56,786 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:20:56,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 02:20:56,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 02:20:56,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-14 02:20:56,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 02:20:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 02:20:56,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 02:20:56,906 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 02:20:56,909 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 02:20:56,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 02:20:57,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:20:57,114 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:20:57,142 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 02:20:57,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:20:57 BoogieIcfgContainer [2024-10-14 02:20:57,146 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 02:20:57,147 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 02:20:57,147 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 02:20:57,147 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 02:20:57,148 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:20:45" (3/4) ... [2024-10-14 02:20:57,148 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 02:20:57,199 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 02:20:57,201 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 02:20:57,202 INFO L158 Benchmark]: Toolchain (without parser) took 12353.03ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 103.5MB in the beginning and 116.5MB in the end (delta: -13.0MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2024-10-14 02:20:57,202 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 02:20:57,202 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.42ms. Allocated memory is still 159.4MB. Free memory was 103.1MB in the beginning and 90.7MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 02:20:57,202 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.11ms. Allocated memory is still 159.4MB. Free memory was 90.7MB in the beginning and 88.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 02:20:57,203 INFO L158 Benchmark]: Boogie Preprocessor took 41.60ms. Allocated memory is still 159.4MB. Free memory was 88.9MB in the beginning and 87.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 02:20:57,203 INFO L158 Benchmark]: RCFGBuilder took 389.36ms. Allocated memory is still 159.4MB. Free memory was 87.3MB in the beginning and 74.3MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 02:20:57,203 INFO L158 Benchmark]: TraceAbstraction took 11544.75ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 73.6MB in the beginning and 119.7MB in the end (delta: -46.1MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2024-10-14 02:20:57,203 INFO L158 Benchmark]: Witness Printer took 54.41ms. Allocated memory is still 220.2MB. Free memory was 119.7MB in the beginning and 116.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 02:20:57,205 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 159.4MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.42ms. Allocated memory is still 159.4MB. Free memory was 103.1MB in the beginning and 90.7MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.11ms. Allocated memory is still 159.4MB. Free memory was 90.7MB in the beginning and 88.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.60ms. Allocated memory is still 159.4MB. Free memory was 88.9MB in the beginning and 87.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 389.36ms. Allocated memory is still 159.4MB. Free memory was 87.3MB in the beginning and 74.3MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11544.75ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 73.6MB in the beginning and 119.7MB in the end (delta: -46.1MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Witness Printer took 54.41ms. Allocated memory is still 220.2MB. Free memory was 119.7MB in the beginning and 116.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L25] CALL assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L25] RET assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [A=3, R=0, counter=0] [L27] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L27] RET assume_abort_if_not(A % 2 == 1) VAL [A=3, R=0, counter=0] [L29] u = ((long long) 2 * R) + 1 [L30] v = 1 [L31] r = ((long long) R * R) - A VAL [A=3, counter=0, r=-3, u=1, v=1] [L34] EXPR counter++ VAL [A=3, counter=1, r=-3, u=1, v=1] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=3, counter=1, r=-3, u=1, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=3, counter=1, r=-3, u=1, v=1] [L39] EXPR counter++ VAL [A=3, counter=2, r=-3, u=1, v=1] [L39] COND TRUE counter++<5 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=3, counter=2, r=-3, u=1, v=1] [L41] COND TRUE !(r > 0) VAL [A=3, counter=2, r=-3, u=1, v=1] [L47] EXPR counter++ VAL [A=3, counter=3, r=-3, u=1, v=1] [L47] COND TRUE counter++<5 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=3, counter=3, r=-3, u=1, v=1] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [A=3, counter=3, r=-2, u=3, v=1] [L47] EXPR counter++ VAL [A=3, counter=4, r=-2, u=3, v=1] [L47] COND TRUE counter++<5 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=3, counter=4, r=-2, u=3, v=1] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [A=3, counter=4, r=1, u=5, v=1] [L47] EXPR counter++ VAL [A=3, counter=5, r=1, u=5, v=1] [L47] COND TRUE counter++<5 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=3, counter=5, r=1, u=5, v=1] [L49] COND TRUE !(r < 0) VAL [A=3, counter=5, r=1, u=5, v=1] [L34] EXPR counter++ VAL [A=3, counter=6, r=1, u=5, v=1] [L34] COND FALSE !(counter++<5) [L56] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=6] [L12] COND TRUE !(cond) VAL [\old(cond)=0, counter=6] [L14] reach_error() VAL [\old(cond)=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 183 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 1087 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 771 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 380 IncrementalHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 316 mSDtfsCounter, 380 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 447 GetRequests, 376 SyntacticMatches, 12 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=10, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 33 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 607 NumberOfCodeBlocks, 607 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 611 ConstructedInterpolants, 0 QuantifiedInterpolants, 1438 SizeOfPredicates, 11 NumberOfNonLiveVariables, 498 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 255/328 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-14 02:20:57,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE