./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.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 f50c7bc2857aa84cb02200a831151d15e1603828dabc8b6cfed5e5d60ae2ee71 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 06:57:20,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 06:57:21,056 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 06:57:21,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 06:57:21,060 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 06:57:21,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 06:57:21,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 06:57:21,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 06:57:21,095 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 06:57:21,096 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 06:57:21,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 06:57:21,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 06:57:21,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 06:57:21,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 06:57:21,097 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 06:57:21,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 06:57:21,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 06:57:21,102 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 06:57:21,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 06:57:21,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 06:57:21,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 06:57:21,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 06:57:21,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 06:57:21,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 06:57:21,104 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 06:57:21,104 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 06:57:21,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 06:57:21,105 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 06:57:21,105 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 06:57:21,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 06:57:21,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 06:57:21,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 06:57:21,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:57:21,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 06:57:21,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 06:57:21,108 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 06:57:21,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 06:57:21,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 06:57:21,109 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 06:57:21,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 06:57:21,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 06:57:21,110 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 06:57:21,110 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 -> f50c7bc2857aa84cb02200a831151d15e1603828dabc8b6cfed5e5d60ae2ee71 [2024-11-16 06:57:21,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 06:57:21,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 06:57:21,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 06:57:21,372 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 06:57:21,373 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 06:57:21,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2024-11-16 06:57:22,886 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 06:57:23,072 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 06:57:23,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2024-11-16 06:57:23,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27f9b47dc/dc841ce137294b479d77e60eaf9ee464/FLAGd90685f85 [2024-11-16 06:57:23,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27f9b47dc/dc841ce137294b479d77e60eaf9ee464 [2024-11-16 06:57:23,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 06:57:23,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 06:57:23,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 06:57:23,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 06:57:23,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 06:57:23,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:57:23" (1/1) ... [2024-11-16 06:57:23,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b5049a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:23, skipping insertion in model container [2024-11-16 06:57:23,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:57:23" (1/1) ... [2024-11-16 06:57:23,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 06:57:23,305 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.c[588,601] [2024-11-16 06:57:23,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:57:23,333 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 06:57:23,343 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.c[588,601] [2024-11-16 06:57:23,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:57:23,370 INFO L204 MainTranslator]: Completed translation [2024-11-16 06:57:23,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:23 WrapperNode [2024-11-16 06:57:23,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 06:57:23,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 06:57:23,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 06:57:23,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 06:57:23,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:23" (1/1) ... [2024-11-16 06:57:23,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:23" (1/1) ... [2024-11-16 06:57:23,407 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2024-11-16 06:57:23,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 06:57:23,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 06:57:23,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 06:57:23,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 06:57:23,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:23" (1/1) ... [2024-11-16 06:57:23,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:23" (1/1) ... [2024-11-16 06:57:23,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:23" (1/1) ... [2024-11-16 06:57:23,435 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 06:57:23,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:23" (1/1) ... [2024-11-16 06:57:23,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:23" (1/1) ... [2024-11-16 06:57:23,438 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:23" (1/1) ... [2024-11-16 06:57:23,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:23" (1/1) ... [2024-11-16 06:57:23,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:23" (1/1) ... [2024-11-16 06:57:23,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:23" (1/1) ... [2024-11-16 06:57:23,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 06:57:23,447 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 06:57:23,447 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 06:57:23,447 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 06:57:23,448 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:23" (1/1) ... [2024-11-16 06:57:23,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:57:23,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:23,484 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 06:57:23,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 06:57:23,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 06:57:23,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 06:57:23,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 06:57:23,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 06:57:23,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-16 06:57:23,536 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-16 06:57:23,606 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 06:57:23,610 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 06:57:23,783 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-11-16 06:57:23,784 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 06:57:23,797 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 06:57:23,797 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 06:57:23,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:57:23 BoogieIcfgContainer [2024-11-16 06:57:23,798 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 06:57:23,801 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 06:57:23,802 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 06:57:23,805 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 06:57:23,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:57:23" (1/3) ... [2024-11-16 06:57:23,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d381e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:57:23, skipping insertion in model container [2024-11-16 06:57:23,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:23" (2/3) ... [2024-11-16 06:57:23,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d381e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:57:23, skipping insertion in model container [2024-11-16 06:57:23,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:57:23" (3/3) ... [2024-11-16 06:57:23,809 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound2.c [2024-11-16 06:57:23,828 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 06:57:23,828 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 06:57:23,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 06:57:23,895 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;@729e8528, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 06:57:23,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 06:57:23,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 06:57:23,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-16 06:57:23,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:23,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:23,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:23,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:23,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1686356366, now seen corresponding path program 1 times [2024-11-16 06:57:23,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:23,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959877763] [2024-11-16 06:57:23,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:23,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:57:24,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:24,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959877763] [2024-11-16 06:57:24,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959877763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:57:24,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:57:24,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 06:57:24,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451937334] [2024-11-16 06:57:24,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:57:24,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 06:57:24,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:24,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 06:57:24,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 06:57:24,087 INFO L87 Difference]: Start difference. First operand has 27 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:57:24,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:24,117 INFO L93 Difference]: Finished difference Result 52 states and 89 transitions. [2024-11-16 06:57:24,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 06:57:24,120 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-16 06:57:24,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:24,127 INFO L225 Difference]: With dead ends: 52 [2024-11-16 06:57:24,127 INFO L226 Difference]: Without dead ends: 23 [2024-11-16 06:57:24,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 06:57:24,137 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:24,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:57:24,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-16 06:57:24,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-16 06:57:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-16 06:57:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2024-11-16 06:57:24,183 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 8 [2024-11-16 06:57:24,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:24,184 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2024-11-16 06:57:24,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:57:24,184 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2024-11-16 06:57:24,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 06:57:24,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:24,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:24,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 06:57:24,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:24,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:24,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1994067049, now seen corresponding path program 1 times [2024-11-16 06:57:24,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:24,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302205655] [2024-11-16 06:57:24,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:24,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:57:24,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:24,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302205655] [2024-11-16 06:57:24,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302205655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:57:24,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:57:24,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 06:57:24,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107995498] [2024-11-16 06:57:24,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:57:24,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 06:57:24,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:24,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 06:57:24,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:57:24,406 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:57:24,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:24,440 INFO L93 Difference]: Finished difference Result 38 states and 54 transitions. [2024-11-16 06:57:24,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 06:57:24,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-16 06:57:24,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:24,441 INFO L225 Difference]: With dead ends: 38 [2024-11-16 06:57:24,442 INFO L226 Difference]: Without dead ends: 25 [2024-11-16 06:57:24,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:57:24,443 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:24,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:57:24,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-16 06:57:24,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-16 06:57:24,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-16 06:57:24,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2024-11-16 06:57:24,452 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 9 [2024-11-16 06:57:24,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:24,452 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-11-16 06:57:24,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:57:24,453 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2024-11-16 06:57:24,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 06:57:24,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:24,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:24,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 06:57:24,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:24,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:24,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2031931410, now seen corresponding path program 1 times [2024-11-16 06:57:24,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:24,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807098518] [2024-11-16 06:57:24,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:24,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:57:24,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:24,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807098518] [2024-11-16 06:57:24,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807098518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:57:24,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:57:24,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 06:57:24,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417477178] [2024-11-16 06:57:24,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:57:24,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 06:57:24,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:24,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 06:57:24,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:57:24,664 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:57:24,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:24,823 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2024-11-16 06:57:24,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 06:57:24,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-16 06:57:24,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:24,826 INFO L225 Difference]: With dead ends: 32 [2024-11-16 06:57:24,826 INFO L226 Difference]: Without dead ends: 29 [2024-11-16 06:57:24,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 06:57:24,828 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:24,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 89 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:57:24,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-16 06:57:24,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-16 06:57:24,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-16 06:57:24,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2024-11-16 06:57:24,840 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 9 [2024-11-16 06:57:24,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:24,840 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2024-11-16 06:57:24,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:57:24,841 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-11-16 06:57:24,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-16 06:57:24,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:24,841 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:24,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 06:57:24,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:24,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:24,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1400374437, now seen corresponding path program 1 times [2024-11-16 06:57:24,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:24,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034858859] [2024-11-16 06:57:24,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:24,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:57:24,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1435335231] [2024-11-16 06:57:24,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:24,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:24,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:24,860 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:57:24,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 06:57:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:24,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 06:57:24,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:57:25,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 06:57:25,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:25,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034858859] [2024-11-16 06:57:25,040 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 06:57:25,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435335231] [2024-11-16 06:57:25,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435335231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:57:25,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:57:25,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 06:57:25,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48351832] [2024-11-16 06:57:25,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:57:25,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 06:57:25,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:25,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 06:57:25,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:57:25,043 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 06:57:25,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:25,139 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2024-11-16 06:57:25,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 06:57:25,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-16 06:57:25,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:25,144 INFO L225 Difference]: With dead ends: 48 [2024-11-16 06:57:25,144 INFO L226 Difference]: Without dead ends: 45 [2024-11-16 06:57:25,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 06:57:25,145 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:25,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 124 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:57:25,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-16 06:57:25,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2024-11-16 06:57:25,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 06:57:25,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-11-16 06:57:25,161 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 14 [2024-11-16 06:57:25,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:25,162 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-11-16 06:57:25,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 06:57:25,162 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-11-16 06:57:25,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-16 06:57:25,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:25,164 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:25,182 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-11-16 06:57:25,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:25,366 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:25,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:25,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1833948082, now seen corresponding path program 1 times [2024-11-16 06:57:25,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:25,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787515459] [2024-11-16 06:57:25,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:25,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:57:25,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1514777314] [2024-11-16 06:57:25,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:25,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:25,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:25,393 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:57:25,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 06:57:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:25,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 06:57:25,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 06:57:25,525 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 06:57:25,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:25,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787515459] [2024-11-16 06:57:25,526 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 06:57:25,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514777314] [2024-11-16 06:57:25,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514777314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:57:25,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:57:25,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 06:57:25,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922969179] [2024-11-16 06:57:25,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:57:25,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 06:57:25,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:25,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 06:57:25,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:57:25,528 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 06:57:25,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:25,617 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2024-11-16 06:57:25,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 06:57:25,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-16 06:57:25,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:25,619 INFO L225 Difference]: With dead ends: 52 [2024-11-16 06:57:25,619 INFO L226 Difference]: Without dead ends: 49 [2024-11-16 06:57:25,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 06:57:25,621 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:25,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 133 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:57:25,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-16 06:57:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2024-11-16 06:57:25,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-16 06:57:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2024-11-16 06:57:25,644 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 19 [2024-11-16 06:57:25,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:25,644 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2024-11-16 06:57:25,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 06:57:25,645 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2024-11-16 06:57:25,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-16 06:57:25,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:25,645 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:25,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 06:57:25,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:25,850 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:25,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:25,850 INFO L85 PathProgramCache]: Analyzing trace with hash 799704197, now seen corresponding path program 1 times [2024-11-16 06:57:25,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:25,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945166698] [2024-11-16 06:57:25,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:25,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:57:25,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [586088505] [2024-11-16 06:57:25,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:25,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:25,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:25,878 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:57:25,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 06:57:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:25,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 06:57:25,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 06:57:26,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 06:57:26,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:26,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945166698] [2024-11-16 06:57:26,005 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 06:57:26,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586088505] [2024-11-16 06:57:26,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586088505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:57:26,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:57:26,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 06:57:26,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482039455] [2024-11-16 06:57:26,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:57:26,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 06:57:26,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:26,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 06:57:26,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:57:26,008 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 06:57:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:26,083 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2024-11-16 06:57:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 06:57:26,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-11-16 06:57:26,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:26,085 INFO L225 Difference]: With dead ends: 60 [2024-11-16 06:57:26,085 INFO L226 Difference]: Without dead ends: 47 [2024-11-16 06:57:26,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 06:57:26,086 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 4 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:26,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:57:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-16 06:57:26,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-16 06:57:26,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 06:57:26,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2024-11-16 06:57:26,097 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 24 [2024-11-16 06:57:26,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:26,097 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2024-11-16 06:57:26,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 06:57:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2024-11-16 06:57:26,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-16 06:57:26,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:26,099 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:26,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 06:57:26,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:26,304 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:26,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:26,304 INFO L85 PathProgramCache]: Analyzing trace with hash 594587768, now seen corresponding path program 1 times [2024-11-16 06:57:26,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:26,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233088465] [2024-11-16 06:57:26,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:26,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:26,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 06:57:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:26,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 06:57:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:26,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-16 06:57:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:26,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 06:57:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:26,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 06:57:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:26,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 06:57:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 06:57:26,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:26,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233088465] [2024-11-16 06:57:26,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233088465] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:57:26,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873236474] [2024-11-16 06:57:26,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:26,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:26,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:26,501 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:57:26,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 06:57:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:26,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 06:57:26,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:26,636 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-16 06:57:26,636 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 06:57:26,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873236474] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:26,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:57:26,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 7 [2024-11-16 06:57:26,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039612360] [2024-11-16 06:57:26,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:26,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 06:57:26,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:26,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 06:57:26,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-16 06:57:26,714 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 06:57:26,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:26,769 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2024-11-16 06:57:26,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 06:57:26,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 42 [2024-11-16 06:57:26,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:26,770 INFO L225 Difference]: With dead ends: 70 [2024-11-16 06:57:26,770 INFO L226 Difference]: Without dead ends: 53 [2024-11-16 06:57:26,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-16 06:57:26,771 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:26,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:57:26,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-16 06:57:26,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-16 06:57:26,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 06:57:26,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2024-11-16 06:57:26,785 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 42 [2024-11-16 06:57:26,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:26,785 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2024-11-16 06:57:26,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 06:57:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2024-11-16 06:57:26,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-16 06:57:26,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:26,787 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:26,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-16 06:57:26,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:26,992 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:26,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:26,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1422995375, now seen corresponding path program 1 times [2024-11-16 06:57:26,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:26,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274995137] [2024-11-16 06:57:26,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:26,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:57:27,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1036920487] [2024-11-16 06:57:27,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:27,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:27,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:27,035 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:57:27,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-16 06:57:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:27,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-16 06:57:27,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-16 06:57:27,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-16 06:57:27,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:27,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274995137] [2024-11-16 06:57:27,394 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 06:57:27,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036920487] [2024-11-16 06:57:27,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036920487] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:27,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:57:27,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-16 06:57:27,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280397783] [2024-11-16 06:57:27,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:27,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 06:57:27,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:27,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 06:57:27,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-16 06:57:27,397 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-16 06:57:27,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:27,691 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2024-11-16 06:57:27,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 06:57:27,691 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 42 [2024-11-16 06:57:27,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:27,693 INFO L225 Difference]: With dead ends: 76 [2024-11-16 06:57:27,693 INFO L226 Difference]: Without dead ends: 73 [2024-11-16 06:57:27,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-11-16 06:57:27,694 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:27,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 228 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 06:57:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-16 06:57:27,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2024-11-16 06:57:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 06:57:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2024-11-16 06:57:27,719 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 42 [2024-11-16 06:57:27,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:27,720 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2024-11-16 06:57:27,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-16 06:57:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2024-11-16 06:57:27,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-16 06:57:27,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:27,721 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:27,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-16 06:57:27,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:27,922 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:27,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:27,923 INFO L85 PathProgramCache]: Analyzing trace with hash -854982936, now seen corresponding path program 2 times [2024-11-16 06:57:27,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:27,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697443106] [2024-11-16 06:57:27,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:27,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:57:27,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1671427710] [2024-11-16 06:57:27,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 06:57:27,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:27,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:27,945 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:57:27,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-16 06:57:28,006 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 06:57:28,007 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 06:57:28,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-16 06:57:28,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:28,197 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-16 06:57:28,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-16 06:57:28,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:28,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697443106] [2024-11-16 06:57:28,413 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 06:57:28,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671427710] [2024-11-16 06:57:28,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671427710] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:28,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:57:28,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2024-11-16 06:57:28,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556949618] [2024-11-16 06:57:28,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:28,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 06:57:28,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:28,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 06:57:28,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-16 06:57:28,417 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 14 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-16 06:57:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:28,829 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2024-11-16 06:57:28,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 06:57:28,829 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 47 [2024-11-16 06:57:28,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:28,833 INFO L225 Difference]: With dead ends: 92 [2024-11-16 06:57:28,833 INFO L226 Difference]: Without dead ends: 86 [2024-11-16 06:57:28,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-11-16 06:57:28,834 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:28,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 216 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 06:57:28,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-16 06:57:28,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2024-11-16 06:57:28,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 24 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-16 06:57:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2024-11-16 06:57:28,869 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 47 [2024-11-16 06:57:28,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:28,871 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2024-11-16 06:57:28,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-16 06:57:28,872 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2024-11-16 06:57:28,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-16 06:57:28,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:28,873 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:28,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-16 06:57:29,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:29,074 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:29,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:29,074 INFO L85 PathProgramCache]: Analyzing trace with hash -480361726, now seen corresponding path program 1 times [2024-11-16 06:57:29,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:29,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675941365] [2024-11-16 06:57:29,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:29,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:57:29,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [442831516] [2024-11-16 06:57:29,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:29,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:29,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:29,112 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:57:29,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-16 06:57:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:29,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-16 06:57:29,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:29,559 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 21 proven. 39 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-16 06:57:29,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-16 06:57:30,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:30,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675941365] [2024-11-16 06:57:30,098 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 06:57:30,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442831516] [2024-11-16 06:57:30,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442831516] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:30,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:57:30,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2024-11-16 06:57:30,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654228484] [2024-11-16 06:57:30,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:30,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 06:57:30,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:30,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 06:57:30,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-16 06:57:30,100 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2024-11-16 06:57:30,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:30,634 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2024-11-16 06:57:30,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 06:57:30,635 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 68 [2024-11-16 06:57:30,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:30,637 INFO L225 Difference]: With dead ends: 99 [2024-11-16 06:57:30,637 INFO L226 Difference]: Without dead ends: 96 [2024-11-16 06:57:30,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-11-16 06:57:30,638 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:30,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 172 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 06:57:30,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-16 06:57:30,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2024-11-16 06:57:30,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 55 states have internal predecessors, (56), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 06:57:30,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2024-11-16 06:57:30,673 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 68 [2024-11-16 06:57:30,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:30,673 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2024-11-16 06:57:30,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2024-11-16 06:57:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2024-11-16 06:57:30,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-16 06:57:30,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:30,676 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:30,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-16 06:57:30,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:30,880 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:30,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:30,880 INFO L85 PathProgramCache]: Analyzing trace with hash 499796098, now seen corresponding path program 2 times [2024-11-16 06:57:30,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:30,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237598184] [2024-11-16 06:57:30,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:30,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:57:30,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [604931693] [2024-11-16 06:57:30,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 06:57:30,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:30,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:30,909 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:57:30,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-16 06:57:30,968 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 06:57:30,968 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-16 06:57:30,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 06:57:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 06:57:31,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 06:57:31,040 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 06:57:31,041 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 06:57:31,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-16 06:57:31,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-16 06:57:31,250 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:31,281 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 06:57:31,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:57:31 BoogieIcfgContainer [2024-11-16 06:57:31,283 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 06:57:31,284 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 06:57:31,284 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 06:57:31,284 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 06:57:31,285 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:57:23" (3/4) ... [2024-11-16 06:57:31,285 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 06:57:31,340 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 06:57:31,340 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 06:57:31,340 INFO L158 Benchmark]: Toolchain (without parser) took 8243.51ms. Allocated memory was 123.7MB in the beginning and 201.3MB in the end (delta: 77.6MB). Free memory was 53.8MB in the beginning and 81.7MB in the end (delta: -27.9MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2024-11-16 06:57:31,341 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 123.7MB. Free memory was 83.4MB in the beginning and 83.1MB in the end (delta: 283.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 06:57:31,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.47ms. Allocated memory was 123.7MB in the beginning and 167.8MB in the end (delta: 44.0MB). Free memory was 53.5MB in the beginning and 137.5MB in the end (delta: -83.9MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2024-11-16 06:57:31,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.55ms. Allocated memory is still 167.8MB. Free memory was 137.5MB in the beginning and 135.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 06:57:31,342 INFO L158 Benchmark]: Boogie Preprocessor took 38.13ms. Allocated memory is still 167.8MB. Free memory was 135.4MB in the beginning and 134.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 06:57:31,342 INFO L158 Benchmark]: IcfgBuilder took 351.65ms. Allocated memory is still 167.8MB. Free memory was 134.3MB in the beginning and 121.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 06:57:31,342 INFO L158 Benchmark]: TraceAbstraction took 7482.05ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 120.7MB in the beginning and 84.9MB in the end (delta: 35.9MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. [2024-11-16 06:57:31,342 INFO L158 Benchmark]: Witness Printer took 56.37ms. Allocated memory is still 201.3MB. Free memory was 84.9MB in the beginning and 81.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 06:57:31,344 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 123.7MB. Free memory was 83.4MB in the beginning and 83.1MB in the end (delta: 283.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.47ms. Allocated memory was 123.7MB in the beginning and 167.8MB in the end (delta: 44.0MB). Free memory was 53.5MB in the beginning and 137.5MB in the end (delta: -83.9MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.55ms. Allocated memory is still 167.8MB. Free memory was 137.5MB in the beginning and 135.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.13ms. Allocated memory is still 167.8MB. Free memory was 135.4MB in the beginning and 134.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 351.65ms. Allocated memory is still 167.8MB. Free memory was 134.3MB in the beginning and 121.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7482.05ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 120.7MB in the beginning and 84.9MB in the end (delta: 35.9MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. * Witness Printer took 56.37ms. Allocated memory is still 201.3MB. Free memory was 84.9MB in the beginning and 81.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [a=2, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [a=2, counter=1, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<2 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=2, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=2, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=2, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=2, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=2, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=2, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [a=2, counter=2, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<2 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=2, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=2, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=2, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=2, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=2, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=2, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [a=2, counter=3, n=2, x=8, y=19, z=18] [L33] COND FALSE !(counter++<2) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [a=2, counter=3, n=2, x=8, y=19, z=18] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, counter=3] [L15] COND TRUE !(cond) VAL [\old(cond)=0, counter=3] [L17] reach_error() VAL [\old(cond)=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 11, TraceHistogramMax: 12, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 1342 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1011 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 747 IncrementalHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 331 mSDtfsCounter, 747 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 487 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=10, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 34 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 678 NumberOfCodeBlocks, 678 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 508 ConstructedInterpolants, 0 QuantifiedInterpolants, 2226 SizeOfPredicates, 10 NumberOfNonLiveVariables, 717 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 972/1108 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-16 06:57:31,363 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